CP or DP? Why Not Both: A Case Study in the Partial Shop Scheduling Problem

ArXi:2605.23569v1 Announce Type: new Dynamic Programming (DP) and Constraint Programming (CP) are well-established paradigms for solving combinatorial optimization problems. Usually, these two approaches are used separately. This paper aims to show that the two can be combined effectively and elegantly, with DP serving as the primary search framework and CP used as a subroutine to leverage global constraint propagation.