Discrete Optimization
721 papers
Papers per year
1
9
7
4
10
6
15
35
30
26
20
41
60
54
66
68
64
49
94
59
3
'10
'15
'20
'25
Papers
Satisfiability and Algorithms for Non-uniform Random k-SAT
AAAI 2021
Streaming and Distributed Algorithms for Robust Column Subset Selection
ICML 2021
Structured Reordering for Modeling Latent Alignments in Sequence Transduction
NeurIPS 2021
Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families
NeurIPS 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
ICML 2021
Symbolic Search for Oversubscription Planning
AAAI 2021
Symmetric Component Caching for Model Counting on Combinatorial Instances
AAAI 2021
The Maximin Support Method: An Extension of the D’Hondt Method to Approval-Based Multiwinner Elections
AAAI 2021
The Power of Adaptivity for Stochastic Submodular Cover
ICML 2021
Weighting-based Variable Neighborhood Search for Optimal Camera Placement
AAAI 2021
xER: An Explainable Model for Entity Resolution using an Efficient Solution for the Clique Partitioning Problem
NAACL 2021
XOR-CD: Linearly Convergent Constrained Structure Generation
ICML 2021
Adapting Stable Matchings to Evolving Preferences
AAAI 2020
Adversarial Learning for 3D Matching
UAI 2020
A Greedy Bit-flip Training Algorithm for Binarized Knowledge Graph Embeddings
EMNLP 2020
A Novel Approach for Constrained Optimization in Graphical Models
NeurIPS 2020
A Randomized Algorithm to Reduce the Support of Discrete Measures
NeurIPS 2020
A Single Recipe for Online Submodular Maximization with Adversarial or Stochastic Constraints
NeurIPS 2020
Augmenting the Power of (Partial) MaxSat Resolution with Extension
AAAI 2020
A Unified Model for the Two-stage Offline-then-Online Resource Allocation
IJCAI 2020
Automatic Dominance Breaking for a Class of Constraint Optimization Problems
IJCAI 2020
Automatic Synthesis of Generalized Winning Strategies of Impartial Combinatorial Games Using SMT Solvers
IJCAI 2020
Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound
IJCAI 2020
Bipartite Encoding: A New Binary Encoding for Solving Non-Binary CSPs
IJCAI 2020
Coresets for Estimating Means and Mean Square Error with Limited Greedy Samples
UAI 2020