Research Explorer
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Achievements
About
Methodology
← Optimization
Mathematics & Optimization
›
Optimization
›
Combinatorial Optimization
2407 directly classified papers
Papers per year
2002: 1
2004: 1
2005: 2
2006: 9
2007: 6
2008: 5
2009: 16
2010: 20
2011: 19
2012: 19
2013: 53
2014: 48
2015: 67
2016: 61
2017: 137
2018: 174
2019: 220
2020: 270
2021: 264
2022: 259
2023: 295
2024: 230
2025: 149
2026: 82
Papers
ODSS: Efficient Hybridization for Optimal Coalition Structure Generation
AAAI 2020
Beyond Trees: Analysis and Convergence of Belief Propagation in Graphs with Multiple Cycles
AAAI 2020
High Dimensional Discrete Integration over the Hypergrid
UAI 2020
Submodular Bandit Problem Under Multiple Constraints
UAI 2020
Kidney Exchange with Inhomogeneous Edge Existence Uncertainty
UAI 2020
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank
AAAI 2020
Minimax Bounds for Structured Prediction Based on Factor Graphs
AISTATS 2020
Kernels over Sets of Finite Sets using RKHS Embeddings, with Application to Bayesian (Combinatorial) Optimization
AISTATS 2020
Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization
AISTATS 2020
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection
AISTATS 2020
Bayesian experimental design using regularized determinantal point processes
AISTATS 2020
Incentive-Compatible Diffusion Auctions
IJCAI 2020
Computational and Statistical Tradeoffs in Inferring Combinatorial Structures of Ising Model
ICML 2020
Optimal approximation for unconstrained non-submodular minimization
ICML 2020
Selecting Voting Locations for Fun and Profit
IJCAI 2020
Cross-Lingual Dependency Parsing by POS-Guided Word Reordering
EMNLP 2020
Sonnet Combinatorics with OuPoCo
COLING 2020
Lower Bounds and Faster Algorithms for Equality Constraints
IJCAI 2020
An Efficient Evolutionary Algorithm for Subset Selection with General Cost Constraints
AAAI 2020
On Maximization of Weakly Modular Functions: Guarantees of Multi-stage Algorithms, Tractability, and Hardness
AISTATS 2020
“Bring Your Own Greedy”+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack
AISTATS 2020
Streaming k-Submodular Maximization under Noise subject to Size Constraint
ICML 2020
An Analysis Framework for Metric Voting based on LP Duality
AAAI 2020
Algorithms for Manipulating Sequential Allocation
AAAI 2020
Justifying All Differences Using Pseudo-Boolean Reasoning
AAAI 2020
<
1
…
60
61
62
…
97
>