conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2,409 papers

Papers per year

2
20
67
270
149
'05
'10
'15
'20
'25

Papers

Memory Efficient Max Flow for Multi-Label Submodular MRFs CVPR 2016
Solving Temporal Puzzles CVPR 2016
Moral Lineage Tracing CVPR 2016
Correlation Clustering and Biclustering with Locally Bounded Errors ICML 2016
Boolean Matrix Factorization and Noisy Completion via Message Passing ICML 2016
Fast Constrained Submodular Maximization: Personalized Data Summarization ICML 2016
A Simple and Strongly-Local Flow-Based Method for Cut Improvement ICML 2016
Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization ICML 2016
A Box-Constrained Approach for Hard Permutation Problems ICML 2016
Greedy Column Subset Selection: New Bounds and Distributed Algorithms ICML 2016
Algorithms for Optimizing the Ratio of Submodular Functions ICML 2016
Controlling the distance to a Kemeny consensus without computing it ICML 2016
Horizontally Scalable Submodular Maximization ICML 2016
Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices JMLR 2016
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms JMLR 2016
Rounding-based Moves for Semi-Metric Labeling JMLR 2016
Distributed Submodular Maximization JMLR 2016
The Chordal Graph Polytope for Learning Decomposable Models PGM 2016
Stochastic Online Greedy Learning with Semi-bandit Feedbacks NIPS 2015
SubmodBoxes: Near-Optimal Search for a Set of Diverse Object Proposals NIPS 2015
Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models NIPS 2015
Sparse PCA via Bipartite Matchings NIPS 2015
Weighted Theta Functions and Embeddings with Applications to Max-Cut, Clustering and Summarization NIPS 2015
Fast Lifted MAP Inference via Partitioning NIPS 2015
Tractable Bayesian Network Structure Learning with Bounded Vertex Cover Number NIPS 2015