← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2407 directly classified papers

Papers per year

Papers

Tracking Objects with Higher Order Interactions via Delayed Column Generation AISTATS 2017
A Unified Optimization View on Generalized Matching Pursuit and Frank-Wolfe AISTATS 2017
Random Consensus Robust PCA AISTATS 2017
Scaling Submodular Maximization via Pruned Submodularity Graphs AISTATS 2017
Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains AISTATS 2017
Conditions beyond treewidth for tightness of higher-order LP relaxations AISTATS 2017
Metaheuristic Approaches to Lexical Substitution and Simplification EACL 2017
Efficient Equilibrium Testing under Adhesion and Anisotropy using Empirical Contact Force Models RSS 2017
Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization COLT 2017
Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems COLT 2017
The Price of Selection in Differential Privacy COLT 2017
Correspondence retrieval COLT 2017
A Combinatorial Solution to Non-Rigid 3D Shape-To-Image Matching CVPR 2017
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching CVPR 2017
A Message Passing Algorithm for the Minimum Cost Multicut Problem CVPR 2017
Joint Graph Decomposition & Node Labeling: Problem, Algorithms, Applications CVPR 2017
Alternating Direction Graph Matching CVPR 2017
Approximate Supermodularity Bounds for Experimental Design NIPS 2017
Polynomial time algorithms for dual volume sampling NIPS 2017
Elementary Symmetric Polynomials for Optimal Experimental Design NIPS 2017
Stochastic Submodular Maximization: The Case of Coverage Functions NIPS 2017
Subset Selection under Noise NIPS 2017
Learning Chordal Markov Networks via Branch and Bound NIPS 2017
Semantic Dependency Parsing via Book Embedding ACL 2017
Clustering Stable Instances of Euclidean k-means. NIPS 2017