Showing math.OCShow all
3 papers · 1 filter
math.OC2026
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…
math.OC2025
Column Generation with Domain-Independent Dynamic Programming
Ryo Kuroiwa, Edward Lam
Column generation and branch-and-price (B&P) are leading mathematical optimization methods for large-scale exact optimization, iterating between solving a master problem and a pric…
math.OC2024
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…