References

1

Laurent Michel, Pierre Schaus, and Pascal Van Hentenryck. Minicp: a lightweight solver for constraint programming. Mathematical Programming Computation, 13(1):133–184, 2021. URL: https://doi.org/10.1007/s12532-020-00190-7, doi:10.1007/s12532-020-00190-7.

2

Jean-Charles Régin, Mohamed Rezgui, and Arnaud Malapert. Embarrassingly parallel search. In International Conference on Principles and Practice of Constraint Programming, 596–610. Springer, 2013.

3

Guillaume Derval and Damien Ernst. Symbolism for modelling, reformulations, and parallelism: maxicp-modelling. In Proceedings of the 22nd Workshop on Constraint Modelling and Reformulation (ModRef 2023). 2023. URL: https://arxiv.org/abs/2308.06013.

4

OscaR Team. OscaR: scala in or. https://bitbucket.org/oscarlib/oscar, 2012.

5

Pascal Van Hentenryck and Laurent Michel. The objective-cp optimization system. In International Conference on Principles and Practice of Constraint Programming, 8–29. Springer, 2013.

6

Vianney le Clément de Saint-Marcq, Pierre Schaus, Christine Solnon, and Christophe Lecoutre. Sparse-sets for domain implementation. In CP workshop on Techniques foR Implementing Constraint programming Systems (TRICS), 1–10. 2013.

7

Jean-Charles Régin. Generalized arc consistency for global cardinality constraint. In Proceedings of the thirteenth national conference on Artificial intelligence-Volume 1, 209–215. 1996.

8

Paul Shaw. A constraint for bin packing. In International conference on principles and practice of constraint programming, 648–662. Springer, 2004.

9

Margaux Schmied and Jean-Charles Régin. Efficient implementation of the global cardinality constraint with costs. arXiv preprint arXiv:2502.02688, 2025.

10

Willem-Jan Van Hoeve, Gilles Pesant, and Louis-Martin Rousseau. On global warming: flow-based soft global constraints. Journal of Heuristics, 12(4):347–373, 2006.

11

Pierre Schaus, Pascal Van Hentenryck, and Alessandro Zanarini. Revisiting the soft global cardinality constraint. In International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, 307–312. Springer, 2010.

12

Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, and Pierre Schaus. Compact-table: efficiently filtering table constraints with reversible sparse bit-sets. In International Conference on Principles and Practice of Constraint Programming, 207–223. Springer, 2016.

13

missing journal in vilim2007global

14

Margaux Schmied, Augustin Delecluse, Jean-Charles Régin, and Pierre Schaus. The distance constraint on sequence variables. In Not yet Published, available upon request. 2026.

15

Charles Thomas and Pierre Schaus. Insertion sequence variables for hybrid routing and scheduling problems. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pages 457–474, 2020.

16

Jean-Guillaume Fages and Charles Prud'homme. Making the first solution good! In 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI), 1073–1077. IEEE, 2017.

17

Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary, and Vincent Vidal. Reasoning from last conflict(s) in constraint programming. Artificial Intelligence, 173(18):1592–1614, 2009.

18

Steven Gay, Renaud Hartert, Christophe Lecoutre, and Pierre Schaus. Conflict ordering search for scheduling problems. In International conference on principles and practice of constraint programming, 140–148. Springer, 2015.

19

Petr Vilím, Philippe Laborie, and Paul Shaw. Failure-directed search for constraint-based scheduling. In International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 437–453. Springer, 2015.

20

C. Le Pape, P. Couronne, D. Vergamini, and V. Gosselin. Time-versus-capacity compromises in project scheduling. In Proceedings of the Thirteenth Workshop of the U.K. Planning Special Interest Group. 1994.

21

William D. Harvey and Matthew L. Ginsberg. Limited discrepancy search. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), 607–613. 1995.

22

Paul Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In International conference on principles and practice of constraint programming, 417–431. Springer, 1998.

23

Pierre Schaus. Variable objective large neighborhood search: a practical approach to solve over-constrained problems. In 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, 971–978. IEEE Computer Society, 2013.

24

Philippe Laborie and Jérôme Rogerie. Reasoning with conditional time-intervals. In Proceedings of the 21st International FLAIRS Conference, 555–560. 2008.

25

missing journal in LaborieRSV09

26

Philippe Laborie, Jérôme Rogerie, Paul Shaw, and Petr Vilím. Ibm ilog cp optimizer for scheduling: 20+ years of scheduling with constraints at ibm/ilog. Constraints, 23:210–250, 2018.

27

Pierre Schaus, Charles Thomas, and Roger Kameugne. Implementing cumulative functions with generalized cumulative constraints. arXiv preprint arXiv:2410.02456, 2024. URL: https://arxiv.org/abs/2410.02456.

28

Nicolas Beldiceanu and Mats Carlsson. A new multi-resource cumulatives constraint with negative heights. In CP 2002, 63–79. Springer, 2002.

29

Augustin Delecluse, Pierre Schaus, and Pascal Van Hentenryck. Sequence variables: a constraint programming computational domain for routing and sequencing. Journal of Artificial Intelligence Research, 2026. URL: https://arxiv.org/abs/2203.11666.

30

Augustin Delecluse, Pierre Schaus, and Pascal Van Hentenryck. Sequence variables for routing problems. In Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). 2022.

31

Arnaud Malapert, Jean-Charles Régin, and Mohamed Rezgui. Embarrassingly parallel search in constraint programming. Journal of Artificial Intelligence Research, 57:421–464, 2016.

32

Pierre Schaus and others. Solving balancing and bin-packing problems with constraint programming. PhD thesis, Catholic University of Louvain, Louvain-la-Neuve, Belgium, 2009.

33

Guillaume Derval, Jean-Charles Régin, and Pierre Schaus. Improved filtering for the bin-packing with cardinality constraint. Constraints, 23(3):251–271, 2018.

34

Alessandro Zanarini, Michela Milano, and Gilles Pesant. Improved algorithm for the soft global cardinality constraint. In International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, 288–299. Springer, 2006.

35

Philip Kilby and Paul Shaw. An optimal algorithm for maximum cardinality 2-satisfiability. In Principles and Practice of Constraint Programming–CP 2006, pages 623–637. Springer, 2006.

36

OscaR Team. OscaR: Scala in OR. https://github.com/pschaus/oscar, 2012. Accessed: 2026-04-15.

37

OptalCP. OptalCP: A Constraint Programming Scheduling Engine. https://optalcp.com/, 2024. Accessed: 2026-04-15.

38

Charles Prud'homme and Jean-Guillaume Fages. Choco-solver. Journal of Open Source Software, 7(78):4708, 2022.

39

Christophe Lecoutre. Constraint Networks: Targeting Simplicity for Techniques and Algorithms. John Wiley & Sons, 2013.

40

Augustin Delecluse, Guillaume Derval, Laurent Michel, Pierre Schaus, and Pascal Van Hentenryck. A review of the constraint programming mooc on edx and minicp resources. URL: https://www.edx.org/learn/computer-programming/universite-catholique-de-louvain-constraint-programming \\ http://minicp.org.

41

MaxiCP Team. MaxiCP: A Not So Mini Constraint Programming Solver. https://github.com/aia-uclouvain/maxicp, 2024. Accessed: 2026-04-15.

42

Christophe Lecoutre. ACE: a fast multithreaded constraint solver. In Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). 2023. https://github.com/xcsp3team/ace.

43

Christian Schulte, Mikael Lagerkvist, and Guido Tack. Gecode. Software download and online material at the website: http://www.gecode.dev, pages 11–13, 2006.

44

Google. OR-Tools: Google Operations Research Tools. https://developers.google.com/optimization, 2024. Accessed: 2026-04-15.

45

Pierre Schaus. Variable objective large neighborhood search: a practical approach to solve over-constrained problems. In 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, 971–978. IEEE Computer Society, 2013.

46

Pierre Schaus and Renaud Hartert. Multi-objective large neighborhood search. In International Conference on Principles and Practice of Constraint Programming, 611–627. Springer, 2013.