Showing 2026Show all
2 papers · 1 filter
math.OC2026
Learning to Choose Branching Rules for Nonconvex MINLPs
Timo Berthold, Fritz Geis
Outer-approximation-based branch-and-bound is a common algorithmic framework for solving MINLPs (mixed-integer nonlinear programs) to global optimality, with branching variable sel…
math.OC2026
Global Optimization for Combinatorial Geometry Problems Revisited in the Era of LLMs
Timo Berthold, Dominik Kamp, Gioni Mexi +2
Recent progress in LLM-driven algorithm discovery, exemplified by DeepMind's AlphaEvolve, has produced new best-known solutions for a range of hard geometric and combinatorial prob…