← Optimization
Mathematics & Optimization › Optimization ›

Discrete Optimization

705 directly classified papers

Papers per year

Papers

A Tree-Based Method for Fast Repeated Sampling of Determinantal Point Processes ICML 2019
On the Time Complexity of Algorithm Selection Hyper-Heuristics for Multimodal Optimisation AAAI 2019
SDRSAC: Semidefinite-Based Randomized Approach for Robust Point Cloud Registration Without Correspondences CVPR 2019
Long-Distance Dependencies Don’t Have to Be Long: Simplifying through Provably (Approximately) Optimal Permutations ACL 2019
Pareto Optimization for Subset Selection with Dynamic Cost Constraints AAAI 2019
Motion Estimation of Non-Holonomic Ground Vehicles From a Single Feature Correspondence Measured Over N Views CVPR 2019
Efficient Search-Based Weighted Model Integration UAI 2019
Parameterized Heuristics for Incomplete Weighted CSPs AAAI 2019
Discrete Laplace Operator Estimation for Dynamic 3D Reconstruction ICCV 2019
No-regret algorithms for online $k$-submodular maximization AISTATS 2019
Fast Decomposable Submodular Function Minimization using Constrained Total Variation NIPS 2019
Group Fairness for the Allocation of Indivisible Goods AAAI 2019
Matroid Constrained Fair Allocation Problem AAAI 2019
Bottleneck Potentials in Markov Random Fields ICCV 2019
Adaptive Hashing for Model Counting UAI 2019
Optimally Efficient Bidirectional Search IJCAI 2019
Clause Learning and New Bounds for Graph Coloring IJCAI 2019
Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT IJCAI 2019
A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs IJCAI 2019
Alternating optimization of decision trees, with application to learning sparse oblique trees NIPS 2018
Gradient Coding from Cyclic MDS Codes and Expander Graphs ICML 2018
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams ICML 2018
Decentralized Submodular Maximization: Bridging Discrete and Continuous Settings ICML 2018
Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice ICML 2018
Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints ICML 2018