← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2407 directly classified papers

Papers per year

Papers

Optimizing Ratio of Monotone Set Functions IJCAI 2017
Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems IJCAI 2017
A SAT Approach to Branchwidth IJCAI 2017
Symbolic LTLf Synthesis IJCAI 2017
Min-Max Propagation NIPS 2017
Interactive Submodular Bandit NIPS 2017
Affinity Clustering: Hierarchical Clustering at Scale NIPS 2017
Robust Advertisement Allocation IJCAI 2017
A Screening Rule for l1-Regularized Ising Model Estimation NIPS 2017
Submodular Optimization under Noise COLT 2017
Linear regression without correspondence NIPS 2017
SAT-Based Approaches for the General High School Timetabling Problem IJCAI 2017
Which is the Fairest (Rent Division) of Them All? [Extended Abstract] IJCAI 2017
Beyond Forks: Finding and Ranking Star Factorings for Decoupled Search IJCAI 2017
Optimal Escape Interdiction on Transportation Networks IJCAI 2017
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints IJCAI 2017
Deletion-Robust Submodular Maximization: Data Summarization with “the Right to be Forgotten” ICML 2017
Robust Guarantees of Stochastic Greedy Algorithms ICML 2017
Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions ICML 2017
Robust Submodular Maximization: A Non-Uniform Partitioning Approach ICML 2017
Combinatorial Topic Models using Small-Variance Asymptotics AISTATS 2017
Initialization and Coordinate Optimization for Multi-way Matching AISTATS 2017
Efficient Rank Aggregation via Lehmer Codes AISTATS 2017
Scalable Greedy Feature Selection via Weak Submodularity AISTATS 2017
Scalable Convex Multiple Sequence Alignment via Entropy-Regularized Dual Decomposition AISTATS 2017