A Numerically-safe Branch-Price-and-Cut Algorithm for the Length-Constrained Cycle Partition Problem
This paper presents a numerically safe branch-price-and-cut algorithm with an efficient dynamic programming pricing strategy that significantly outperforms existing methods for the length-constrained cycle partition problem, solving larger instances and closing previously unsolved cases.