← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2407 directly classified papers

Papers per year

Papers

Sparsification of Decomposable Submodular Functions AAAI 2022
Search Strategies for Topological Network Optimization AAAI 2022
Subset Approximation of Pareto Regions with Bi-objective A* AAAI 2022
Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem COLT 2022
Improving Local Search Algorithms via Probabilistic Configuration Checking AAAI 2022
On Probabilistic Generalization of Backdoors in Boolean Satisfiability AAAI 2022
Branch & Learn for Recursively and Iteratively Solvable Problems in Predict+Optimize NIPS 2022
Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression COLT 2022
Matching in Multi-arm Bandit with Collision NIPS 2022
Minimax Optimization: The Case of Convex-Submodular AISTATS 2022
MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search AAAI 2022
Time-Constrained Participatory Budgeting Under Uncertain Project Costs IJCAI 2022
Efficient Vertex-Oriented Polytopic Projection for Web-Scale Applications AAAI 2022
Combining (Second-Order) Graph-Based and Headed-Span-Based Projective Dependency Parsing ACL 2022
An Effective and Efficient Entity Alignment Decoding Algorithm via Third-Order Tensor Isomorphism ACL 2022
Algorithmic Bayesian Persuasion with Combinatorial Actions AAAI 2022
An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs AAAI 2022
Combating Collusion Rings Is Hard but Possible AAAI 2022
Pretrained Cost Model for Distributed Constraint Optimization Problems AAAI 2022
Sequential Blocked Matching AAAI 2022
Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs AAAI 2022
Approximate Frank-Wolfe Algorithms over Graph-structured Support Sets ICML 2022
Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems: Complexity, Special Case Algorithms and Heuristics AAAI 2022
Fair Disaster Containment via Graph-Cut Problems AISTATS 2022
Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds ICML 2022