← Optimization
Mathematics & Optimization › Optimization ›

Discrete Optimization

705 directly classified papers

Papers per year

Papers

Optimal Web-Scale Tiering as a Flow Problem NIPS 2010
Efficient Minimization of Decomposable Submodular Functions NIPS 2010
Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms AISTATS 2010
Generalized roof duality and bisubmodular functions NIPS 2010
Decomposing Isotonic Regression for Efficiently Solving Large Problems NIPS 2010
MAP estimation in Binary MRFs via Bipartite Multi-cuts NIPS 2010
Segmentation as Maximum-Weight Independent Set NIPS 2010
Minimum Average Cost Clustering NIPS 2010
Worst-case bounds on the quality of max-product fixed-points NIPS 2010
Local Rules for Global MAP: When Do They Work ? NIPS 2009
Randomized Pruning: Efficiently Calculating Expectations in Large Dynamic Programs NIPS 2009
Beyond Convexity: Online Submodular Minimization NIPS 2009
An LP View of the M-best MAP problem NIPS 2009
MDPs with Non-Deterministic Policies NIPS 2008
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation NIPS 2008
Learning Balls of Strings from Edit Corrections JMLR 2008
Inferring rankings under constrained sensing NIPS 2008
An Online Algorithm for Maximizing Submodular Functions NIPS 2008
One sketch for all: Theory and Application of Conditional Random Sampling NIPS 2008
Clustering via LP-based Stabilities NIPS 2008
Linear programming analysis of loopy belief propagation for weighted matching NIPS 2007
Progressive mixture rules are deviation suboptimal NIPS 2007
An Analysis of Convex Relaxations for MAP Estimation NIPS 2007
Selecting Observations against Adversarial Objectives NIPS 2007
Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning RSS 2007