no code implementations • 25 Sep 2017 • Vincent Branders, Pierre Schaus, Pierre Dupont
Two different algorithms are proposed in order to exploit the highlighted characteristics of the problem: a CP approach with a global constraint (CPGC) and mixed integer linear programming (MILP).
