Combinatorial Optimization
2,615 papers
Papers per year
1
1
2
9
6
6
16
22
21
20
56
50
68
61
138
176
223
274
266
263
305
294
244
93
'5
'10
'15
'20
'25
Papers
Controllability of Control Argumentation Frameworks
IJCAI 2020
Convexity of b-matching Games
IJCAI 2020
Coordinated Reasoning for Cross-Lingual Knowledge Graph Alignment
AAAI 2020
Correlation Clustering with Asymmetric Classification Errors
ICML 2020
Correlation Robust Influence Maximization
NeurIPS 2020
Cross-Lingual Dependency Parsing by POS-Guided Word Reordering
EMNLP 2020
Ddo, a Generic and Efficient Framework for MDD-Based Optimization
IJCAI 2020
Deciding Acceptance in Incomplete Argumentation Frameworks
AAAI 2020
Decisions, Counterfactual Explanations and Strategic Behavior
NeurIPS 2020
Deep Learning—Powered Iterative Combinatorial Auctions
AAAI 2020
Deep Neural Network Approximated Dynamic Programming for Combinatorial Optimization
AAAI 2020
Defending with Shared Resources on a Network
AAAI 2020
Dependent randomized rounding for clustering and partition systems with knapsack constraints
AISTATS 2020
Determinant Regularization for Gradient-Efficient Graph Matching
CVPR 2020
Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time
NeurIPS 2020
Diameter-based Interactive Structure Discovery
AISTATS 2020
Did That Lost Ballot Box Cost Me a Seat? Computing Manipulations of STV Elections
AAAI 2020
Dual Formulation of the Chordal Graph Conjecture
PGM 2020
Dual Iterative Hard Thresholding
JMLR 2020
Dynamic Assortment Optimization with Changing Contextual Information
JMLR 2020
Dynamic Programming for Predict+Optimise
AAAI 2020
Dynamic Submodular Maximization
NeurIPS 2020
Early and Efficient Identification of Useless Constraint Propagation for Alldifferent Constraints
IJCAI 2020
Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs
IJCAI 2020
Efficient and Robust Shape Correspondence via Sparsity-Enforced Quadratic Assignment
CVPR 2020