← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2407 directly classified papers

Papers per year

Papers

Structure-Aware Surface Reconstruction via Primitive Assembly ICCV 2023
Greed is good: correspondence recovery for unlabeled linear regression UAI 2023
Multi-objective Search via Lazy and Efficient Dominance Checks IJCAI 2023
Approximations for Indivisible Concave Allocations with Applications to Nash Welfare Maximization AAAI 2023
Faster Exact MPE and Constrained Optimization with Deterministic Finite State Automata IJCAI 2023
Globally solving the Gromov-Wasserstein problem for point clouds in low dimensional Euclidean spaces NIPS 2023
Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games NIPS 2023
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? IJCAI 2023
A One-Size-Fits-All Approach to Improving Randomness in Paper Assignment NIPS 2023
Datasets and Benchmarks for Nanophotonic Structure and Parametric Design Simulations NIPS 2023
A Generalized Scalarization Method for Evolutionary Multi-Objective Optimization AAAI 2023
Daycare Matching in Japan: Transfers and Siblings AAAI 2023
Sudoku Assistant – an AI-Powered App to Help Solve Pen-and-Paper Sudokus AAAI 2023
Resource Sharing through Multi-Round Matchings AAAI 2023
Accelerating Voting by Quantum Computation UAI 2023
Optimal Pathfinding on Weighted Grid Maps AAAI 2023
A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings NIPS 2023
Practical Parallel Algorithms for Submodular Maximization Subject to a Knapsack Constraint with Nearly Optimal Adaptivity AAAI 2023
Ising-Traffic: Using Ising Machine Learning to Predict Traffic Congestion under Uncertainty AAAI 2023
Ultrafast Euclidean Shortest Path Computation Using Hub Labeling AAAI 2023
Recent Developments in Data-Driven Algorithms for Discrete Optimization AAAI 2023
Tight Inapproximability for Graphical Games AAAI 2023
Now We’re Talking: Better Deliberation Groups through Submodular Optimization AAAI 2023
Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule AAAI 2023
Finding Good Partial Assignments during Restart-Based Branch and Bound Search AAAI 2023