Jul 2026
A Numerically-safe Branch-Price-and-Cut Algorithm for the Length-Constrained Cycle Partition Problem
This work formulate LCCP as a set partitioning model and solves it using an exact branch-price-and-cut approach, able to solve previously solved instances in a fraction of the time and closes 14 previously unsolved instances with numerically safe bounds.
Mohammed Ghannam, Ambros M. Gleixner, Gioni Mexi et al.
· arXiv.org · 0 citations