← Optimization
Mathematics & Optimization › Optimization ›

Discrete Optimization

705 directly classified papers

Papers per year

Papers

Computationally Hard Problems Are Hard for QBF Proof Systems Too AAAI 2025
MATWA: A Web Toolkit for Matching Under Preferences AAAI 2025
Optimizing for the Shortest Path in Denoising Diffusion Model CVPR 2025
Improved Maximin Share Approximations for Chores by Bin Packing AAAI 2025
Decision-Making for Land Conservation: A Derivative-Free Optimization Framework with Nonlinear Inputs AAAI 2024
Deep Submodular Peripteral Networks NIPS 2024
LP-based Construction of DC Decompositions for Efficient Inference of Markov Random Fields AISTATS 2024
Recovery Guarantees for Distributed-OMP AISTATS 2024
Sum-max Submodular Bandits AISTATS 2024
Multi-Stage Predict+Optimize for (Mixed Integer) Linear Programs NIPS 2024
Deep Learning-Based Alternative Route Computation AISTATS 2024
Learning Cut Generating Functions for Integer Programming NIPS 2024
Non-Convex Joint Community Detection and Group Synchronization via Generalized Power Method AISTATS 2024
Faster Differentially Private Top-$k$ Selection: A Joint Exponential Mechanism with Pruning NIPS 2024
A Novel Skip Orthogonal List for Dynamic Optimal Transport Problem AAAI 2024
Clustering with Non-adaptive Subset Queries NIPS 2024
Differentially Private Set Representations NIPS 2024
Fast Dynamic Sampling for Determinantal Point Processes AISTATS 2024
Learning-Augmented Dynamic Submodular Maximization NIPS 2024
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem AAAI 2024
First Passage Percolation with Queried Hints AISTATS 2024
A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem AAAI 2024
Optimal Survival Trees: A Dynamic Programming Approach AAAI 2024
Taming Binarized Neural Networks and Mixed-Integer Programs AAAI 2024
INFORMEDQX: Informed Conflict Detection for Over-Constrained Problems AAAI 2024