- Balanced Incomplete Block Design (BIBD):
  - problem description, references, model: https://www.csplib.org/Problems/prob028/
- Car Sequencing (CS):
  - problem description, references: https://www.csplib.org/Problems/prob001/
  - model: https://github.com/MiniZinc/minizinc-benchmarks/blob/master/carseq/carseq.mzn
- Social Golfers (SG):
  - problem description, references, model: https://www.csplib.org/Problems/prob010/
- Vessel Loading (VL):
  - problem description, references, model: https://www.csplib.org/Problems/prob008/
- Black Hole (BH):
  - problem description, references: https://www.csplib.org/Problems/prob081/
  - model: https://github.com/MiniZinc/minizinc-benchmarks/blob/master/black-hole/black-hole.mzn
- Carpet Cutting (CC):
  - problem description: https://doi.org/10.1007/978-3-642-23786-7_8
  - model: https://github.com/MiniZinc/minizinc-benchmarks/blob/master/carpet-cutting/cc_base.mzn
- Hypergraph Coloring (HC):
  - problem description: included in the paper
  - model: written by us
  - references:
    - Michael R Garey and David S Johnson. 1979. Computers and intractability. Vol. 174. freeman San Francisco, San Francisco, CA, USA.
    - László Lovász. 1973. Coverings and colorings of hypergraphs. In Proc. 4th Southeastern Conference of Combinatorics, Graph Theory, and Computing. Utilitas Mathematica Publishing, 3-12.

Note: As stated in the paper, if present, we strip any redundant constraints, symmetry-breaking constraints, and excessive documentation from the MiniZinc models of these problems.

