A Numerically-safe Branch-Price-and-Cut Algorithm for the Length-Constrained Cycle Partition Problem
TL;DR
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.
Abstract
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 associated with a critical time and the length of every cycle must not exceed the critical time of any node in the cycle. We formulate LCCP as a set partitioning model and solve it using an exact branch-price-and-cut approach. Our dynamic programming-based pricing algorithm to generate improving cycles exploits the particular structure of the pricing problem for efficient bidirectional search and symmetry breaking. Computational results show that the LP relaxation of the set partitioning model produces very strong dual bounds and our branch-price-and-cut method improves significantly over the state of the art. It is able to solve previously solved instances in a fraction of the time and closes 14 previously unsolved instances with numerically safe bounds, one of which has 76 nodes, a notable improvement over the previous limit of 52 nodes.