2 papers
cs.AI2026
CP or DP? Why Not Both: A Case Study in the Partial Shop Scheduling Problem
Emma Legrand, Roger Kameugne, Pierre Schaus
Dynamic Programming (DP) and Constraint Programming (CP) are well-established paradigms for solving combinatorial optimization problems. Usually, these two approaches are used sepa…
cs.AI2025
Implementing Cumulative Functions with Generalized Cumulative Constraints
Pierre Schaus, Charles Thomas, Roger Kameugne
Modeling scheduling problems with conditional time intervals and cumulative functions has become a common approach when using modern commercial constraint programming solvers. This…