From the 1 of 2 linked papers with an AI index.
2 papers
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.OC2026
Column Generation with Domain-Independent Dynamic Programming
Ryo Kuroiwa, Edward Lam
The paper proposes using domain‑independent dynamic programming as a generic pricing solver within column generation and branch‑and‑price frameworks, showing improved performance a…