1 citations · 1 across the 5 of their papers we have counts for
12 papers · 1 filter
Race, Exchange, Improve: Finding high-quality MIP solutions quickly
Gioni Mexi, Daniel Rehfeldt
Mixed-integer programming (MIP) is a cornerstone in applied optimization, both in industry and academia. Recently, there has been increased attention to finding strong primal solut…
A Numerically-safe Branch-Price-and-Cut Algorithm for the Length-Constrained Cycle Partition Problem
Mohammed Ghannam, Ambros Gleixner, Gioni Mexi +1
The length-constrained cycle partition problem (LCCP) is a graph optimization problem in which a set of nodes must be partitioned into a minimum number of cycles. Every node is ass…
CHAP: A Hybrid GPU-CPU Heuristic for MIP
Gennesaret Kharistio Tjusila, Alexander Hoen, Nils-Christian Kempke +5
We present CHAP (Coordinating Heuristics Across Platforms) a GPU-CPU-hybrid primal heuristic framework for mixed-integer programming. CHAP adopts a portfolio approach where it coor…
Out-of-the-Box Global Optimization for Packing Problems: New Models and Improved Solutions
Timo Berthold, Dominik Kamp, Gioni Mexi +2
Recent LLM-driven discoveries have renewed interest in geometric packing problems. In this paper, we study several classes of such packing problems through the lens of modern globa…
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…
Objective Coefficient Rounding and Almost Symmetries in Binary Programs
Dominik Kuzinowicz, Paweł Lichocki, Gioni Mexi +3
This article investigates the interplay of rounding objective coefficients in binary programs and almost symmetries. Empirically, reducing the number of significant bits through ro…