Science· Frankfurt am Main
Algorithms for Convex Mixed-Integer Programming
This event focuses on computational methods for solving convex mixed-integer optimization problems, which combine continuous variables with integer constraints. Topics likely include branch-and-bound techniques, cutting planes, convex relaxations, and other algorithms that exploit convexity to efficiently find provably optimal solutions.