3 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.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…
cs.AI2021
A Scalable Two Stage Approach to Computing Optimal Decision Sets
Alexey Ignatiev, Edward Lam, Peter J. Stuckey +1
Machine learning (ML) is ubiquitous in modern life. Since it is being deployed in technologies that affect our privacy and safety, it is often crucial to understand the reasoning b…