← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2407 directly classified papers

Papers per year

Papers

A Data-Driven Approach to Modeling Choice NIPS 2009
Submodularity Cuts and Applications NIPS 2009
A Gaussian Tree Approximation for Integer Least-Squares NIPS 2009
An LP View of the M-best MAP problem NIPS 2009
A Game-Theoretic Approach to Hypergraph Clustering NIPS 2009
Learning Permutations with Exponential Weights JMLR 2009
An Integer Projected Fixed Point Method for Graph Matching and MAP Inference NIPS 2009
Nonparametric Greedy Algorithms for the Sparse Learning Problem NIPS 2009
Robust Submodular Observation Selection JMLR 2008
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation NIPS 2008
Improved Moves for Truncated Convex Models NIPS 2008
Linear-Time Computation of Similarity Measures for Sequential Data JMLR 2008
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies JMLR 2008
New Outer Bounds on the Marginal Polytope NIPS 2007
Local Algorithms for Approximate Inference in Minor-Excluded Graphs NIPS 2007
Message Passing for Max-weight Independent Set NIPS 2007
Selecting Observations against Adversarial Objectives NIPS 2007
Linear programming analysis of loopy belief propagation for weighted matching NIPS 2007
The On-Line Shortest Path Problem Under Partial Monitoring JMLR 2007
Using Combinatorial Optimization within Max-Product Belief Propagation NIPS 2006
Fast Computation of Graph Kernels NIPS 2006
Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints NIPS 2006
Branch and Bound for Semi-Supervised Support Vector Machines NIPS 2006
On the Complexity of Learning Lexicographic Strategies JMLR 2006
Distance Patterns in Structural Similarity JMLR 2006