Combinatorial Optimization

Combinatorial optimization studies how to choose the best arrangement, assignment, route, or schedule when decisions are discrete and constraints interact. Exact methods such as integer programming, constraint programming, SAT, dynamic programming, and branch-and-bound can certify optimality, while approximation algorithms and metaheuristics trade guarantees for speed on larger instances. Learning methods—including graph neural networks, reinforcement learning, and language-model-guided heuristic design—are increasingly paired with classical search to propose solutions, warm-start solvers, or select algorithms. A central challenge is making these methods scale and generalize without sacrificing feasibility, solution quality, or the guarantees that exact and approximation methods provide.