1 citations · 1 across the 3 of their papers we have counts for
3 papers · 1 filter
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…
Shaping and Trimming Branch-and-bound Trees
Philipp M. Christophel, Imre Pólik
We present a new branch-and-bound type search method for mixed integer linear optimization problems based on the concept of offshoots (introduced in this paper). While similar to a…
New symmetries in mixed-integer linear optimization: Symmetry heuristics and complement-based symmetries
Philipp M. Christophel, Menal Güzelsoy, Imre Pólik
We present two novel applications of symmetries for mixed-integer linear programming. First we propose two variants of a new heuristic to improve the objective value of a feasible…