12 citations · 12 across the 2 of their papers we have counts for
11 papers · 1 filter
Branch and Price for the Length-Constrained Cycle Partition Problem
Mohammed Ghannam, Gioni Mexi, Edward Lam +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…
Branch and Cut for Partitioning a Graph into a Cycle of Clusters
Leon Eifler, Jakob Witzig, Ambros Gleixner
In this paper we study formulations and algorithms for the cycle clustering problem, a partitioning problem over the vertex set of a directed graph with nonnegative arc weights tha…
Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs
Alexander Hoen, Andy Oertel, Ambros Gleixner +1
It is well known that reformulating the original problem can be crucial for the performance of mixed-integer programming (MIP) solvers. To ensure correctness, all transformations m…
Combining Precision Boosting with LP Iterative Refinement for Exact Linear Optimization
Leon Eifler, Jules Nicolas-Thouvenin, Ambros Gleixner
This article studies a combination of the two state-of-the-art algorithms for the exact solution of linear programs (LPs) over the rational numbers, i.e., without any roundoff erro…
A proof system for certifying symmetry and optimality reasoning in integer programming
Jasper van Doornmalen, Leon Eifler, Ambros Gleixner +1
We present a proof system for establishing the correctness of results produced by optimization algorithms, with a focus on mixed-integer programming (MIP). Our system generalizes t…
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
Gioni Mexi, Timo Berthold, Ambros Gleixner +1
Conflict analysis has been successfully generalized from Boolean satisfiability (SAT) solving to mixed integer programming (MIP) solvers, but although MIP solvers operate with gene…