prob001: car sequencing

Results

• The first set of instances contains satisfiable and infeasible instances:
  • Instance 4/72: satisfiable (Regin, Puget, 1997)
  • Instance 6/76: infeasible (Regin, Puget, 1997), upper bound of 6 constraint violations (Gottlieb, Puchta, Solnon, 2003)
  • Instance 10/93: infeasible (Regin, Puget, 1997), upper bound of 3 constraint violations (Gottlieb, Puchta, Solnon, 2003)
  • Instance 16/81: satisfiable (Gottlieb, Puchta, Solnon, 2003)
  • Instance 19/71: infeasible, lower bound of 2 constraint violations (Gent, 1998), upper bound of 2 constraint violations (Gottlieb, Puchta, Solnon, 2003)
  • Instance 21/90: no solution known, upper bound of 2 constraint violations (Gottlieb, Puchta, Solnon, 2003)
  • Instance 36/92: infeasible (Boivin, Gravel, Gagnne, 2004), upper bound of 2 constraint violations (Gottlieb, Puchta, Solnon, 2003)
  • Instance 41/66: satisfiable (Gottlieb, Puchta, Solnon, 2003)
  • Instance 26/82: satisfiable (Gottlieb, Puchta, Solnon, 2003)
• The second set contains only satisfiable instances. It is composed of seven groups, each containing 10 instances of the same utilization percentage:
  • Instances 60-01,...,60-10 have utilization percentage 60.
  • Instances 65-01,...,65-10 have utilization percentage 65.
  • Instances 70-01,...,70-10 have utilization percentage 70.
  • Instances 75-01,...,75-10 have utilization percentage 75.
  • Instances 80-01,...,80-10 have utilization percentage 80.
  • Instances 85-01,...,85-10 have utilization percentage 85.
  • Instances 90-01,...,90-10 have utilization percentage 90.

Back to CSPLib home page.