← Optimization
Mathematics & Optimization › Optimization ›

Discrete Optimization

705 directly classified papers

Papers per year

Papers

Personalized Extractive Summarization Using an Ising Machine Towards Real-time Generation of Efficient and Coherent Dialogue Scenarios EMNLP 2021
Learning Sparse Classifiers: Continuous and Mixed Integer Optimization Perspectives JMLR 2021
Projection-free Decentralized Online Learning for Submodular Maximization over Time-Varying Networks JMLR 2021
Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions AAAI 2021
Facility’s Perspective to Fair Facility Location Problems AAAI 2021
Interpretable Sequence Classification via Discrete Optimization AAAI 2021
A Unified Framework for Planning with Learned Neural Network Transition Models AAAI 2021
Alternating Direction Method of Multipliers for Quantization AISTATS 2021
Optimal Algorithms for Submodular Maximization with Distributed Constraints L4DC 2021
Minimizing Energy Use of Mixed-Fleet Public Transit for Fixed-Route Service AAAI 2021
Passive learning of Timed Automata from logs (Student Abstract) AAAI 2021
A Scalable Deterministic Global Optimization Algorithm for Clustering Problems ICML 2021
Graph Learning for Inverse Landscape Genetics AAAI 2021
Finding Relevant Information via a Discrete Fourier Expansion ICML 2021
Sampling Partial Acyclic Orientations in Chordal Graphs by the Lovasz Local Lemma (Student Abstract) AAAI 2021
The Power of Adaptivity for Stochastic Submodular Cover ICML 2021
Multidimensional Scaling: Approximation and Complexity ICML 2021
Weighting-based Variable Neighborhood Search for Optimal Camera Placement AAAI 2021
Randomized Algorithms for Submodular Function Maximization with a $k$-System Constraint ICML 2021
Accelerated Combinatorial Search for Outlier Detection with Provable Bound on Sub-Optimality AAAI 2021
Problem Dependent View on Structured Thresholding Bandit Problems ICML 2021
Instance Specific Approximations for Submodular Maximization ICML 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity ICML 2021
Restricted Domains of Dichotomous Preferences with Possibly Incomplete Information AAAI 2021
Faster and Better Simple Temporal Problems AAAI 2021