id stringlengths 6 28 | domain stringclasses 7
values | variant stringclasses 5
values | size int64 3 120 | feasible bool 2
classes | optimal_value float64 10 68 ⌀ | has_objective bool 2
classes | objective_sense stringclasses 1
value | n_variables int64 4 120 | n_constraints int64 1 900 | constraint_types listlengths 1 3 | nl_description stringlengths 205 8.14k | variables listlengths 4 120 | domains stringlengths 85 4.38k | constraints stringlengths 83 36.7k | objective stringclasses 6
values | reference_witness stringlengths 41 1.63k ⌀ | file stringlengths 30 52 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
color_cycle5_k2_infeasible | graph_coloring | infeasible | 5 | false | null | false | null | 5 | 5 | [
"not_equal"
] | We must colour 5 regions, numbered n1..n5, using at most 2 colours (c1..c2).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,2), (2,3), (3,4), (4,5), (5,1).
Assign exactly one colour to each region. | [
"n1",
"n2",
"n3",
"n4",
"n5"
] | {"n1":["c1","c2"],"n2":["c1","c2"],"n3":["c1","c2"],"n4":["c1","c2"],"n5":["c1","c2"]} | [{"type":"not_equal","a":"n1","b":"n2"},{"type":"not_equal","a":"n2","b":"n3"},{"type":"not_equal","a":"n3","b":"n4"},{"type":"not_equal","a":"n4","b":"n5"},{"type":"not_equal","a":"n5","b":"n1"}] | null | null | benchmark/problems/color_cycle5_k2_infeasible.json |
color_cycle5_k3_tight | graph_coloring | tight | 5 | true | null | false | null | 5 | 5 | [
"not_equal"
] | We must colour 5 regions, numbered n1..n5, using at most 3 colours (c1..c3).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,2), (2,3), (3,4), (4,5), (5,1).
Assign exactly one colour to each region. | [
"n1",
"n2",
"n3",
"n4",
"n5"
] | {"n1":["c1","c2","c3"],"n2":["c1","c2","c3"],"n3":["c1","c2","c3"],"n4":["c1","c2","c3"],"n5":["c1","c2","c3"]} | [{"type":"not_equal","a":"n1","b":"n2"},{"type":"not_equal","a":"n2","b":"n3"},{"type":"not_equal","a":"n3","b":"n4"},{"type":"not_equal","a":"n4","b":"n5"},{"type":"not_equal","a":"n5","b":"n1"}] | null | {"n1":"c2","n5":"c3","n4":"c1","n3":"c2","n2":"c1"} | benchmark/problems/color_cycle5_k3_tight.json |
color_cycle6_k3 | graph_coloring | feasible | 6 | true | null | false | null | 6 | 6 | [
"not_equal"
] | We must colour 6 regions, numbered n1..n6, using at most 3 colours (c1..c3).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,2), (2,3), (3,4), (4,5), (5,6), (6,1).
Assign exactly one colour to each region. | [
"n1",
"n2",
"n3",
"n4",
"n5",
"n6"
] | {"n1":["c1","c2","c3"],"n2":["c1","c2","c3"],"n3":["c1","c2","c3"],"n4":["c1","c2","c3"],"n5":["c1","c2","c3"],"n6":["c1","c2","c3"]} | [{"type":"not_equal","a":"n1","b":"n2"},{"type":"not_equal","a":"n2","b":"n3"},{"type":"not_equal","a":"n3","b":"n4"},{"type":"not_equal","a":"n4","b":"n5"},{"type":"not_equal","a":"n5","b":"n6"},{"type":"not_equal","a":"n6","b":"n1"}] | null | {"n1":"c2","n6":"c3","n5":"c2","n4":"c1","n3":"c2","n2":"c1"} | benchmark/problems/color_cycle6_k3.json |
color_cycle8_k3 | graph_coloring | feasible | 8 | true | null | false | null | 8 | 8 | [
"not_equal"
] | We must colour 8 regions, numbered n1..n8, using at most 3 colours (c1..c3).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,2), (2,3), (3,4), (4,5), (5,6), (6,7), (7,8), (8,1).
Assign exactly one colour to each region. | [
"n1",
"n2",
"n3",
"n4",
"n5",
"n6",
"n7",
"n8"
] | {"n1":["c1","c2","c3"],"n2":["c1","c2","c3"],"n3":["c1","c2","c3"],"n4":["c1","c2","c3"],"n5":["c1","c2","c3"],"n6":["c1","c2","c3"],"n7":["c1","c2","c3"],"n8":["c1","c2","c3"]} | [{"type":"not_equal","a":"n1","b":"n2"},{"type":"not_equal","a":"n2","b":"n3"},{"type":"not_equal","a":"n3","b":"n4"},{"type":"not_equal","a":"n4","b":"n5"},{"type":"not_equal","a":"n5","b":"n6"},{"type":"not_equal","a":"n6","b":"n7"},{"type":"not_equal","a":"n7","b":"n8"},{"type":"not_equal","a":"n8","b":"n1"}] | null | {"n1":"c2","n8":"c3","n7":"c2","n6":"c1","n5":"c2","n4":"c1","n3":"c2","n2":"c1"} | benchmark/problems/color_cycle8_k3.json |
color_k4_k3_infeasible | graph_coloring | infeasible | 4 | false | null | false | null | 4 | 6 | [
"not_equal"
] | We must colour 4 regions, numbered n1..n4, using at most 3 colours (c1..c3).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,2), (1,3), (1,4), (2,3), (2,4), (3,4).
Assign exactly one colour to each region. | [
"n1",
"n2",
"n3",
"n4"
] | {"n1":["c1","c2","c3"],"n2":["c1","c2","c3"],"n3":["c1","c2","c3"],"n4":["c1","c2","c3"]} | [{"type":"not_equal","a":"n1","b":"n2"},{"type":"not_equal","a":"n1","b":"n3"},{"type":"not_equal","a":"n1","b":"n4"},{"type":"not_equal","a":"n2","b":"n3"},{"type":"not_equal","a":"n2","b":"n4"},{"type":"not_equal","a":"n3","b":"n4"}] | null | null | benchmark/problems/color_k4_k3_infeasible.json |
color_k4_k4_tight | graph_coloring | tight | 4 | true | null | false | null | 4 | 6 | [
"not_equal"
] | We must colour 4 regions, numbered n1..n4, using at most 4 colours (c1..c4).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,2), (1,3), (1,4), (2,3), (2,4), (3,4).
Assign exactly one colour to each region. | [
"n1",
"n2",
"n3",
"n4"
] | {"n1":["c1","c2","c3","c4"],"n2":["c1","c2","c3","c4"],"n3":["c1","c2","c3","c4"],"n4":["c1","c2","c3","c4"]} | [{"type":"not_equal","a":"n1","b":"n2"},{"type":"not_equal","a":"n1","b":"n3"},{"type":"not_equal","a":"n1","b":"n4"},{"type":"not_equal","a":"n2","b":"n3"},{"type":"not_equal","a":"n2","b":"n4"},{"type":"not_equal","a":"n3","b":"n4"}] | null | {"n4":"c2","n3":"c3","n2":"c1","n1":"c4"} | benchmark/problems/color_k4_k4_tight.json |
color_k5_k4_infeasible | graph_coloring | infeasible | 5 | false | null | false | null | 5 | 10 | [
"not_equal"
] | We must colour 5 regions, numbered n1..n5, using at most 4 colours (c1..c4).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,2), (1,3), (1,4), (1,5), (2,3), (2,4), (2,5), (3,4), (3,5), (4,5).
Assign exactly one colour to each region. | [
"n1",
"n2",
"n3",
"n4",
"n5"
] | {"n1":["c1","c2","c3","c4"],"n2":["c1","c2","c3","c4"],"n3":["c1","c2","c3","c4"],"n4":["c1","c2","c3","c4"],"n5":["c1","c2","c3","c4"]} | [{"type":"not_equal","a":"n1","b":"n2"},{"type":"not_equal","a":"n1","b":"n3"},{"type":"not_equal","a":"n1","b":"n4"},{"type":"not_equal","a":"n1","b":"n5"},{"type":"not_equal","a":"n2","b":"n3"},{"type":"not_equal","a":"n2","b":"n4"},{"type":"not_equal","a":"n2","b":"n5"},{"type":"not_equal","a":"n3","b":"n4"},{"type"... | null | null | benchmark/problems/color_k5_k4_infeasible.json |
color_k5_k5_tight | graph_coloring | tight | 5 | true | null | false | null | 5 | 10 | [
"not_equal"
] | We must colour 5 regions, numbered n1..n5, using at most 5 colours (c1..c5).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,2), (1,3), (1,4), (1,5), (2,3), (2,4), (2,5), (3,4), (3,5), (4,5).
Assign exactly one colour to each region. | [
"n1",
"n2",
"n3",
"n4",
"n5"
] | {"n1":["c1","c2","c3","c4","c5"],"n2":["c1","c2","c3","c4","c5"],"n3":["c1","c2","c3","c4","c5"],"n4":["c1","c2","c3","c4","c5"],"n5":["c1","c2","c3","c4","c5"]} | [{"type":"not_equal","a":"n1","b":"n2"},{"type":"not_equal","a":"n1","b":"n3"},{"type":"not_equal","a":"n1","b":"n4"},{"type":"not_equal","a":"n1","b":"n5"},{"type":"not_equal","a":"n2","b":"n3"},{"type":"not_equal","a":"n2","b":"n4"},{"type":"not_equal","a":"n2","b":"n5"},{"type":"not_equal","a":"n3","b":"n4"},{"type"... | null | {"n5":"c5","n4":"c4","n3":"c3","n2":"c2","n1":"c1"} | benchmark/problems/color_k5_k5_tight.json |
color_path5_k3 | graph_coloring | feasible | 5 | true | null | false | null | 5 | 4 | [
"not_equal"
] | We must colour 5 regions, numbered n1..n5, using at most 3 colours (c1..c3).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,2), (2,3), (3,4), (4,5).
Assign exactly one colour to each region. | [
"n1",
"n2",
"n3",
"n4",
"n5"
] | {"n1":["c1","c2","c3"],"n2":["c1","c2","c3"],"n3":["c1","c2","c3"],"n4":["c1","c2","c3"],"n5":["c1","c2","c3"]} | [{"type":"not_equal","a":"n1","b":"n2"},{"type":"not_equal","a":"n2","b":"n3"},{"type":"not_equal","a":"n3","b":"n4"},{"type":"not_equal","a":"n4","b":"n5"}] | null | {"n5":"c2","n4":"c3","n3":"c1","n2":"c3","n1":"c2"} | benchmark/problems/color_path5_k3.json |
color_star7_k3 | graph_coloring | feasible | 7 | true | null | false | null | 7 | 6 | [
"not_equal"
] | We must colour 7 regions, numbered n1..n7, using at most 3 colours (c1..c3).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,2), (1,3), (1,4), (1,5), (1,6), (1,7).
Assign exactly one colour to each region. | [
"n1",
"n2",
"n3",
"n4",
"n5",
"n6",
"n7"
] | {"n1":["c1","c2","c3"],"n2":["c1","c2","c3"],"n3":["c1","c2","c3"],"n4":["c1","c2","c3"],"n5":["c1","c2","c3"],"n6":["c1","c2","c3"],"n7":["c1","c2","c3"]} | [{"type":"not_equal","a":"n1","b":"n2"},{"type":"not_equal","a":"n1","b":"n3"},{"type":"not_equal","a":"n1","b":"n4"},{"type":"not_equal","a":"n1","b":"n5"},{"type":"not_equal","a":"n1","b":"n6"},{"type":"not_equal","a":"n1","b":"n7"}] | null | {"n7":"c2","n1":"c3","n6":"c1","n5":"c1","n4":"c1","n3":"c1","n2":"c1"} | benchmark/problems/color_star7_k3.json |
color_wheel5_k3_infeasible | graph_coloring | infeasible | 6 | false | null | false | null | 6 | 10 | [
"not_equal"
] | We must colour 6 regions, numbered n1..n6, using at most 3 colours (c1..c3).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,2), (2,3), (3,4), (4,5), (5,1), (6,1), (6,2), (6,3), (6,4), (6,5).
Assign exactly one colour to each region. | [
"n1",
"n2",
"n3",
"n4",
"n5",
"n6"
] | {"n1":["c1","c2","c3"],"n2":["c1","c2","c3"],"n3":["c1","c2","c3"],"n4":["c1","c2","c3"],"n5":["c1","c2","c3"],"n6":["c1","c2","c3"]} | [{"type":"not_equal","a":"n1","b":"n2"},{"type":"not_equal","a":"n2","b":"n3"},{"type":"not_equal","a":"n3","b":"n4"},{"type":"not_equal","a":"n4","b":"n5"},{"type":"not_equal","a":"n5","b":"n1"},{"type":"not_equal","a":"n6","b":"n1"},{"type":"not_equal","a":"n6","b":"n2"},{"type":"not_equal","a":"n6","b":"n3"},{"type"... | null | null | benchmark/problems/color_wheel5_k3_infeasible.json |
color_wheel5_k4_tight | graph_coloring | tight | 6 | true | null | false | null | 6 | 10 | [
"not_equal"
] | We must colour 6 regions, numbered n1..n6, using at most 4 colours (c1..c4).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,2), (2,3), (3,4), (4,5), (5,1), (6,1), (6,2), (6,3), (6,4), (6,5).
Assign exactly one colour to each region. | [
"n1",
"n2",
"n3",
"n4",
"n5",
"n6"
] | {"n1":["c1","c2","c3","c4"],"n2":["c1","c2","c3","c4"],"n3":["c1","c2","c3","c4"],"n4":["c1","c2","c3","c4"],"n5":["c1","c2","c3","c4"],"n6":["c1","c2","c3","c4"]} | [{"type":"not_equal","a":"n1","b":"n2"},{"type":"not_equal","a":"n2","b":"n3"},{"type":"not_equal","a":"n3","b":"n4"},{"type":"not_equal","a":"n4","b":"n5"},{"type":"not_equal","a":"n5","b":"n1"},{"type":"not_equal","a":"n6","b":"n1"},{"type":"not_equal","a":"n6","b":"n2"},{"type":"not_equal","a":"n6","b":"n3"},{"type"... | null | {"n5":"c2","n6":"c3","n4":"c1","n3":"c4","n2":"c1","n1":"c4"} | benchmark/problems/color_wheel5_k4_tight.json |
knap4_c10 | knapsack | feasible | 4 | true | 19 | true | max | 4 | 1 | [
"weighted_capacity"
] | A knapsack holds at most 10 units of weight. Choose a subset of the following items
to put 'in' the knapsack (the rest stay 'out') so the total weight is within 10 and
the total value is as large as possible.
Items: item1 (weight 5, value 10); item2 (weight 4, value 7); item3 (weight 6, value 12); item4 (weight 2, valu... | [
"item1",
"item2",
"item3",
"item4"
] | {"item1":["in","out"],"item2":["in","out"],"item3":["in","out"],"item4":["in","out"]} | [{"type":"weighted_capacity","weights":{"item1":5,"item2":4,"item3":6,"item4":2},"selected_value":"in","bound":10}] | {"sense":"max","weights":{"item1":{"in":10,"out":0},"item2":{"in":7,"out":0},"item3":{"in":12,"out":0},"item4":{"in":3,"out":0}}} | {"item1":"out","item2":"in","item3":"in","item4":"out"} | benchmark/problems/knap4_c10.json |
knap4_c6_tight | knapsack | tight | 4 | true | 12 | true | max | 4 | 1 | [
"weighted_capacity"
] | A knapsack holds at most 6 units of weight. Choose a subset of the following items
to put 'in' the knapsack (the rest stay 'out') so the total weight is within 6 and
the total value is as large as possible.
Items: item1 (weight 5, value 10); item2 (weight 4, value 7); item3 (weight 6, value 12); item4 (weight 2, value ... | [
"item1",
"item2",
"item3",
"item4"
] | {"item1":["in","out"],"item2":["in","out"],"item3":["in","out"],"item4":["in","out"]} | [{"type":"weighted_capacity","weights":{"item1":5,"item2":4,"item3":6,"item4":2},"selected_value":"in","bound":6}] | {"sense":"max","weights":{"item1":{"in":10,"out":0},"item2":{"in":7,"out":0},"item3":{"in":12,"out":0},"item4":{"in":3,"out":0}}} | {"item1":"out","item2":"out","item3":"in","item4":"out"} | benchmark/problems/knap4_c6_tight.json |
knap5_c14 | knapsack | feasible | 5 | true | 18 | true | max | 5 | 1 | [
"weighted_capacity"
] | A knapsack holds at most 14 units of weight. Choose a subset of the following items
to put 'in' the knapsack (the rest stay 'out') so the total weight is within 14 and
the total value is as large as possible.
Items: item1 (weight 3, value 4); item2 (weight 5, value 6); item3 (weight 7, value 9); item4 (weight 2, value ... | [
"item1",
"item2",
"item3",
"item4",
"item5"
] | {"item1":["in","out"],"item2":["in","out"],"item3":["in","out"],"item4":["in","out"],"item5":["in","out"]} | [{"type":"weighted_capacity","weights":{"item1":3,"item2":5,"item3":7,"item4":2,"item5":4},"selected_value":"in","bound":14}] | {"sense":"max","weights":{"item1":{"in":4,"out":0},"item2":{"in":6,"out":0},"item3":{"in":9,"out":0},"item4":{"in":2,"out":0},"item5":{"in":5,"out":0}}} | {"item1":"in","item2":"out","item3":"in","item4":"out","item5":"in"} | benchmark/problems/knap5_c14.json |
knap5_c8_tight | knapsack | tight | 5 | true | 10 | true | max | 5 | 1 | [
"weighted_capacity"
] | A knapsack holds at most 8 units of weight. Choose a subset of the following items
to put 'in' the knapsack (the rest stay 'out') so the total weight is within 8 and
the total value is as large as possible.
Items: item1 (weight 3, value 4); item2 (weight 5, value 6); item3 (weight 7, value 9); item4 (weight 2, value 2)... | [
"item1",
"item2",
"item3",
"item4",
"item5"
] | {"item1":["in","out"],"item2":["in","out"],"item3":["in","out"],"item4":["in","out"],"item5":["in","out"]} | [{"type":"weighted_capacity","weights":{"item1":3,"item2":5,"item3":7,"item4":2,"item5":4},"selected_value":"in","bound":8}] | {"sense":"max","weights":{"item1":{"in":4,"out":0},"item2":{"in":6,"out":0},"item3":{"in":9,"out":0},"item4":{"in":2,"out":0},"item5":{"in":5,"out":0}}} | {"item1":"in","item2":"in","item3":"out","item4":"out","item5":"out"} | benchmark/problems/knap5_c8_tight.json |
knap6_c12_tight | knapsack | tight | 6 | true | 19 | true | max | 6 | 1 | [
"weighted_capacity"
] | A knapsack holds at most 12 units of weight. Choose a subset of the following items
to put 'in' the knapsack (the rest stay 'out') so the total weight is within 12 and
the total value is as large as possible.
Items: item1 (weight 6, value 10); item2 (weight 8, value 13); item3 (weight 3, value 4); item4 (weight 9, valu... | [
"item1",
"item2",
"item3",
"item4",
"item5",
"item6"
] | {"item1":["in","out"],"item2":["in","out"],"item3":["in","out"],"item4":["in","out"],"item5":["in","out"],"item6":["in","out"]} | [{"type":"weighted_capacity","weights":{"item1":6,"item2":8,"item3":3,"item4":9,"item5":5,"item6":4},"selected_value":"in","bound":12}] | {"sense":"max","weights":{"item1":{"in":10,"out":0},"item2":{"in":13,"out":0},"item3":{"in":4,"out":0},"item4":{"in":14,"out":0},"item5":{"in":7,"out":0},"item6":{"in":6,"out":0}}} | {"item1":"out","item2":"in","item3":"out","item4":"out","item5":"out","item6":"in"} | benchmark/problems/knap6_c12_tight.json |
knap6_c20 | knapsack | feasible | 6 | true | 31 | true | max | 6 | 1 | [
"weighted_capacity"
] | A knapsack holds at most 20 units of weight. Choose a subset of the following items
to put 'in' the knapsack (the rest stay 'out') so the total weight is within 20 and
the total value is as large as possible.
Items: item1 (weight 6, value 10); item2 (weight 8, value 13); item3 (weight 3, value 4); item4 (weight 9, valu... | [
"item1",
"item2",
"item3",
"item4",
"item5",
"item6"
] | {"item1":["in","out"],"item2":["in","out"],"item3":["in","out"],"item4":["in","out"],"item5":["in","out"],"item6":["in","out"]} | [{"type":"weighted_capacity","weights":{"item1":6,"item2":8,"item3":3,"item4":9,"item5":5,"item6":4},"selected_value":"in","bound":20}] | {"sense":"max","weights":{"item1":{"in":10,"out":0},"item2":{"in":13,"out":0},"item3":{"in":4,"out":0},"item4":{"in":14,"out":0},"item5":{"in":7,"out":0},"item6":{"in":6,"out":0}}} | {"item1":"out","item2":"in","item3":"in","item4":"in","item5":"out","item6":"out"} | benchmark/problems/knap6_c20.json |
knap7_c14_tight | knapsack | tight | 7 | true | 23 | true | max | 7 | 1 | [
"weighted_capacity"
] | A knapsack holds at most 14 units of weight. Choose a subset of the following items
to put 'in' the knapsack (the rest stay 'out') so the total weight is within 14 and
the total value is as large as possible.
Items: item1 (weight 7, value 12); item2 (weight 3, value 5); item3 (weight 9, value 15); item4 (weight 5, valu... | [
"item1",
"item2",
"item3",
"item4",
"item5",
"item6",
"item7"
] | {"item1":["in","out"],"item2":["in","out"],"item3":["in","out"],"item4":["in","out"],"item5":["in","out"],"item6":["in","out"],"item7":["in","out"]} | [{"type":"weighted_capacity","weights":{"item1":7,"item2":3,"item3":9,"item4":5,"item5":6,"item6":2,"item7":8},"selected_value":"in","bound":14}] | {"sense":"max","weights":{"item1":{"in":12,"out":0},"item2":{"in":5,"out":0},"item3":{"in":15,"out":0},"item4":{"in":8,"out":0},"item5":{"in":10,"out":0},"item6":{"in":3,"out":0},"item7":{"in":13,"out":0}}} | {"item1":"out","item2":"out","item3":"out","item4":"out","item5":"in","item6":"out","item7":"in"} | benchmark/problems/knap7_c14_tight.json |
knap7_c25 | knapsack | feasible | 7 | true | 42 | true | max | 7 | 1 | [
"weighted_capacity"
] | A knapsack holds at most 25 units of weight. Choose a subset of the following items
to put 'in' the knapsack (the rest stay 'out') so the total weight is within 25 and
the total value is as large as possible.
Items: item1 (weight 7, value 12); item2 (weight 3, value 5); item3 (weight 9, value 15); item4 (weight 5, valu... | [
"item1",
"item2",
"item3",
"item4",
"item5",
"item6",
"item7"
] | {"item1":["in","out"],"item2":["in","out"],"item3":["in","out"],"item4":["in","out"],"item5":["in","out"],"item6":["in","out"],"item7":["in","out"]} | [{"type":"weighted_capacity","weights":{"item1":7,"item2":3,"item3":9,"item4":5,"item5":6,"item6":2,"item7":8},"selected_value":"in","bound":25}] | {"sense":"max","weights":{"item1":{"in":12,"out":0},"item2":{"in":5,"out":0},"item3":{"in":15,"out":0},"item4":{"in":8,"out":0},"item5":{"in":10,"out":0},"item6":{"in":3,"out":0},"item7":{"in":13,"out":0}}} | {"item1":"in","item2":"in","item3":"in","item4":"out","item5":"in","item6":"out","item7":"out"} | benchmark/problems/knap7_c25.json |
knap8_c30 | knapsack | feasible | 8 | true | 50 | true | max | 8 | 1 | [
"weighted_capacity"
] | A knapsack holds at most 30 units of weight. Choose a subset of the following items
to put 'in' the knapsack (the rest stay 'out') so the total weight is within 30 and
the total value is as large as possible.
Items: item1 (weight 7, value 12); item2 (weight 3, value 5); item3 (weight 9, value 15); item4 (weight 5, valu... | [
"item1",
"item2",
"item3",
"item4",
"item5",
"item6",
"item7",
"item8"
] | {"item1":["in","out"],"item2":["in","out"],"item3":["in","out"],"item4":["in","out"],"item5":["in","out"],"item6":["in","out"],"item7":["in","out"],"item8":["in","out"]} | [{"type":"weighted_capacity","weights":{"item1":7,"item2":3,"item3":9,"item4":5,"item5":6,"item6":2,"item7":8,"item8":4},"selected_value":"in","bound":30}] | {"sense":"max","weights":{"item1":{"in":12,"out":0},"item2":{"in":5,"out":0},"item3":{"in":15,"out":0},"item4":{"in":8,"out":0},"item5":{"in":10,"out":0},"item6":{"in":3,"out":0},"item7":{"in":13,"out":0},"item8":{"in":6,"out":0}}} | {"item1":"in","item2":"out","item3":"in","item4":"out","item5":"in","item6":"out","item7":"in","item8":"out"} | benchmark/problems/knap8_c30.json |
latin3 | latin_square | feasible | 3 | true | null | false | null | 9 | 6 | [
"all_different"
] | Fill an 3x3 grid (cell r<row>c<col>) with symbols d1..d3 so that every row contains
all 3 symbols once and every column contains all 3 symbols once (a Latin square).
Assign exactly one symbol to each cell. | [
"r1c1",
"r1c2",
"r1c3",
"r2c1",
"r2c2",
"r2c3",
"r3c1",
"r3c2",
"r3c3"
] | {"r1c1":["d1","d2","d3"],"r1c2":["d1","d2","d3"],"r1c3":["d1","d2","d3"],"r2c1":["d1","d2","d3"],"r2c2":["d1","d2","d3"],"r2c3":["d1","d2","d3"],"r3c1":["d1","d2","d3"],"r3c2":["d1","d2","d3"],"r3c3":["d1","d2","d3"]} | [{"type":"all_different","vars":["r1c1","r1c2","r1c3"]},{"type":"all_different","vars":["r2c1","r2c2","r2c3"]},{"type":"all_different","vars":["r3c1","r3c2","r3c3"]},{"type":"all_different","vars":["r1c1","r2c1","r3c1"]},{"type":"all_different","vars":["r1c2","r2c2","r3c2"]},{"type":"all_different","vars":["r1c3","r2c3... | null | {"r3c3":"d2","r2c3":"d3","r1c3":"d1","r3c2":"d3","r2c2":"d1","r1c2":"d2","r3c1":"d1","r2c1":"d2","r1c1":"d3"} | benchmark/problems/latin3.json |
latin4 | latin_square | feasible | 4 | true | null | false | null | 16 | 8 | [
"all_different"
] | Fill an 4x4 grid (cell r<row>c<col>) with symbols d1..d4 so that every row contains
all 4 symbols once and every column contains all 4 symbols once (a Latin square).
Assign exactly one symbol to each cell. | [
"r1c1",
"r1c2",
"r1c3",
"r1c4",
"r2c1",
"r2c2",
"r2c3",
"r2c4",
"r3c1",
"r3c2",
"r3c3",
"r3c4",
"r4c1",
"r4c2",
"r4c3",
"r4c4"
] | {"r1c1":["d1","d2","d3","d4"],"r1c2":["d1","d2","d3","d4"],"r1c3":["d1","d2","d3","d4"],"r1c4":["d1","d2","d3","d4"],"r2c1":["d1","d2","d3","d4"],"r2c2":["d1","d2","d3","d4"],"r2c3":["d1","d2","d3","d4"],"r2c4":["d1","d2","d3","d4"],"r3c1":["d1","d2","d3","d4"],"r3c2":["d1","d2","d3","d4"],"r3c3":["d1","d2","d3","d4"],... | [{"type":"all_different","vars":["r1c1","r1c2","r1c3","r1c4"]},{"type":"all_different","vars":["r2c1","r2c2","r2c3","r2c4"]},{"type":"all_different","vars":["r3c1","r3c2","r3c3","r3c4"]},{"type":"all_different","vars":["r4c1","r4c2","r4c3","r4c4"]},{"type":"all_different","vars":["r1c1","r2c1","r3c1","r4c1"]},{"type":"... | null | {"r4c4":"d4","r3c4":"d3","r2c4":"d2","r1c4":"d1","r4c3":"d2","r3c3":"d1","r2c3":"d4","r1c3":"d3","r4c2":"d1","r3c2":"d4","r2c2":"d3","r1c2":"d2","r4c1":"d3","r3c1":"d2","r2c1":"d1","r1c1":"d4"} | benchmark/problems/latin4.json |
latin5 | latin_square | tight | 5 | true | null | false | null | 25 | 10 | [
"all_different"
] | Fill an 5x5 grid (cell r<row>c<col>) with symbols d1..d5 so that every row contains
all 5 symbols once and every column contains all 5 symbols once (a Latin square).
Assign exactly one symbol to each cell. | [
"r1c1",
"r1c2",
"r1c3",
"r1c4",
"r1c5",
"r2c1",
"r2c2",
"r2c3",
"r2c4",
"r2c5",
"r3c1",
"r3c2",
"r3c3",
"r3c4",
"r3c5",
"r4c1",
"r4c2",
"r4c3",
"r4c4",
"r4c5",
"r5c1",
"r5c2",
"r5c3",
"r5c4",
"r5c5"
] | {"r1c1":["d1","d2","d3","d4","d5"],"r1c2":["d1","d2","d3","d4","d5"],"r1c3":["d1","d2","d3","d4","d5"],"r1c4":["d1","d2","d3","d4","d5"],"r1c5":["d1","d2","d3","d4","d5"],"r2c1":["d1","d2","d3","d4","d5"],"r2c2":["d1","d2","d3","d4","d5"],"r2c3":["d1","d2","d3","d4","d5"],"r2c4":["d1","d2","d3","d4","d5"],"r2c5":["d1",... | [{"type":"all_different","vars":["r1c1","r1c2","r1c3","r1c4","r1c5"]},{"type":"all_different","vars":["r2c1","r2c2","r2c3","r2c4","r2c5"]},{"type":"all_different","vars":["r3c1","r3c2","r3c3","r3c4","r3c5"]},{"type":"all_different","vars":["r4c1","r4c2","r4c3","r4c4","r4c5"]},{"type":"all_different","vars":["r5c1","r5c... | null | {"r5c5":"d4","r4c5":"d2","r3c5":"d1","r2c5":"d3","r1c5":"d5","r5c4":"d1","r4c4":"d3","r3c4":"d2","r2c4":"d5","r1c4":"d4","r5c3":"d2","r4c3":"d1","r3c3":"d5","r2c3":"d4","r1c3":"d3","r5c2":"d3","r4c2":"d5","r3c2":"d4","r2c2":"d1","r1c2":"d2","r5c1":"d5","r4c1":"d4","r3c1":"d3","r2c1":"d2","r1c1":"d1"} | benchmark/problems/latin5.json |
sched3w3d_infeasible | scheduling | infeasible | 9 | false | null | false | null | 9 | 6 | [
"capacity",
"min_count"
] | Build a 3-day duty roster for 3 workers (w1..w3). For each worker
and each day decide 'on' or 'off' (variable w<worker>_d<day>). At least 3 workers
must be 'on' each day. No worker may work more than 2 days in total. | [
"w1_d1",
"w2_d1",
"w3_d1",
"w1_d2",
"w2_d2",
"w3_d2",
"w1_d3",
"w2_d3",
"w3_d3"
] | {"w1_d1":["on","off"],"w2_d1":["on","off"],"w3_d1":["on","off"],"w1_d2":["on","off"],"w2_d2":["on","off"],"w3_d2":["on","off"],"w1_d3":["on","off"],"w2_d3":["on","off"],"w3_d3":["on","off"]} | [{"type":"min_count","value":"on","min":3,"vars":["w1_d1","w2_d1","w3_d1"]},{"type":"min_count","value":"on","min":3,"vars":["w1_d2","w2_d2","w3_d2"]},{"type":"min_count","value":"on","min":3,"vars":["w1_d3","w2_d3","w3_d3"]},{"type":"capacity","value":"on","max":2,"vars":["w1_d1","w1_d2","w1_d3"]},{"type":"capacity","... | null | null | benchmark/problems/sched3w3d_infeasible.json |
sched3w3d_tight | scheduling | tight | 9 | true | null | false | null | 9 | 6 | [
"capacity",
"min_count"
] | Build a 3-day duty roster for 3 workers (w1..w3). For each worker
and each day decide 'on' or 'off' (variable w<worker>_d<day>). At least 2 workers
must be 'on' each day. No worker may work more than 2 days in total. | [
"w1_d1",
"w2_d1",
"w3_d1",
"w1_d2",
"w2_d2",
"w3_d2",
"w1_d3",
"w2_d3",
"w3_d3"
] | {"w1_d1":["on","off"],"w2_d1":["on","off"],"w3_d1":["on","off"],"w1_d2":["on","off"],"w2_d2":["on","off"],"w3_d2":["on","off"],"w1_d3":["on","off"],"w2_d3":["on","off"],"w3_d3":["on","off"]} | [{"type":"min_count","value":"on","min":2,"vars":["w1_d1","w2_d1","w3_d1"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d2","w2_d2","w3_d2"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d3","w2_d3","w3_d3"]},{"type":"capacity","value":"on","max":2,"vars":["w1_d1","w1_d2","w1_d3"]},{"type":"capacity","... | null | {"w1_d1":"on","w2_d1":"on","w3_d1":"off","w1_d2":"off","w2_d2":"on","w3_d2":"on","w1_d3":"on","w2_d3":"off","w3_d3":"on"} | benchmark/problems/sched3w3d_tight.json |
sched4w3d | scheduling | feasible | 12 | true | null | false | null | 12 | 7 | [
"capacity",
"min_count"
] | Build a 3-day duty roster for 4 workers (w1..w4). For each worker
and each day decide 'on' or 'off' (variable w<worker>_d<day>). At least 2 workers
must be 'on' each day. No worker may work more than 3 days in total. | [
"w1_d1",
"w2_d1",
"w3_d1",
"w4_d1",
"w1_d2",
"w2_d2",
"w3_d2",
"w4_d2",
"w1_d3",
"w2_d3",
"w3_d3",
"w4_d3"
] | {"w1_d1":["on","off"],"w2_d1":["on","off"],"w3_d1":["on","off"],"w4_d1":["on","off"],"w1_d2":["on","off"],"w2_d2":["on","off"],"w3_d2":["on","off"],"w4_d2":["on","off"],"w1_d3":["on","off"],"w2_d3":["on","off"],"w3_d3":["on","off"],"w4_d3":["on","off"]} | [{"type":"min_count","value":"on","min":2,"vars":["w1_d1","w2_d1","w3_d1","w4_d1"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d2","w2_d2","w3_d2","w4_d2"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d3","w2_d3","w3_d3","w4_d3"]},{"type":"capacity","value":"on","max":3,"vars":["w1_d1","w1_d2","w1_d3... | null | {"w1_d1":"off","w2_d1":"off","w3_d1":"on","w4_d1":"on","w1_d2":"off","w2_d2":"on","w3_d2":"on","w4_d2":"off","w1_d3":"off","w2_d3":"off","w3_d3":"on","w4_d3":"on"} | benchmark/problems/sched4w3d.json |
sched4w4d_infeasible | scheduling | infeasible | 16 | false | null | false | null | 16 | 8 | [
"capacity",
"min_count"
] | Build a 4-day duty roster for 4 workers (w1..w4). For each worker
and each day decide 'on' or 'off' (variable w<worker>_d<day>). At least 3 workers
must be 'on' each day. No worker may work more than 2 days in total. | [
"w1_d1",
"w2_d1",
"w3_d1",
"w4_d1",
"w1_d2",
"w2_d2",
"w3_d2",
"w4_d2",
"w1_d3",
"w2_d3",
"w3_d3",
"w4_d3",
"w1_d4",
"w2_d4",
"w3_d4",
"w4_d4"
] | {"w1_d1":["on","off"],"w2_d1":["on","off"],"w3_d1":["on","off"],"w4_d1":["on","off"],"w1_d2":["on","off"],"w2_d2":["on","off"],"w3_d2":["on","off"],"w4_d2":["on","off"],"w1_d3":["on","off"],"w2_d3":["on","off"],"w3_d3":["on","off"],"w4_d3":["on","off"],"w1_d4":["on","off"],"w2_d4":["on","off"],"w3_d4":["on","off"],"w4_... | [{"type":"min_count","value":"on","min":3,"vars":["w1_d1","w2_d1","w3_d1","w4_d1"]},{"type":"min_count","value":"on","min":3,"vars":["w1_d2","w2_d2","w3_d2","w4_d2"]},{"type":"min_count","value":"on","min":3,"vars":["w1_d3","w2_d3","w3_d3","w4_d3"]},{"type":"min_count","value":"on","min":3,"vars":["w1_d4","w2_d4","w3_d... | null | null | benchmark/problems/sched4w4d_infeasible.json |
sched4w4d_tight | scheduling | tight | 16 | true | null | false | null | 16 | 8 | [
"capacity",
"min_count"
] | Build a 4-day duty roster for 4 workers (w1..w4). For each worker
and each day decide 'on' or 'off' (variable w<worker>_d<day>). At least 2 workers
must be 'on' each day. No worker may work more than 2 days in total. | [
"w1_d1",
"w2_d1",
"w3_d1",
"w4_d1",
"w1_d2",
"w2_d2",
"w3_d2",
"w4_d2",
"w1_d3",
"w2_d3",
"w3_d3",
"w4_d3",
"w1_d4",
"w2_d4",
"w3_d4",
"w4_d4"
] | {"w1_d1":["on","off"],"w2_d1":["on","off"],"w3_d1":["on","off"],"w4_d1":["on","off"],"w1_d2":["on","off"],"w2_d2":["on","off"],"w3_d2":["on","off"],"w4_d2":["on","off"],"w1_d3":["on","off"],"w2_d3":["on","off"],"w3_d3":["on","off"],"w4_d3":["on","off"],"w1_d4":["on","off"],"w2_d4":["on","off"],"w3_d4":["on","off"],"w4_... | [{"type":"min_count","value":"on","min":2,"vars":["w1_d1","w2_d1","w3_d1","w4_d1"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d2","w2_d2","w3_d2","w4_d2"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d3","w2_d3","w3_d3","w4_d3"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d4","w2_d4","w3_d... | null | {"w1_d1":"on","w2_d1":"off","w3_d1":"on","w4_d1":"off","w1_d2":"on","w2_d2":"off","w3_d2":"on","w4_d2":"off","w1_d3":"off","w2_d3":"on","w3_d3":"off","w4_d3":"on","w1_d4":"off","w2_d4":"on","w3_d4":"off","w4_d4":"on"} | benchmark/problems/sched4w4d_tight.json |
sched5w4d | scheduling | feasible | 20 | true | null | false | null | 20 | 9 | [
"capacity",
"min_count"
] | Build a 4-day duty roster for 5 workers (w1..w5). For each worker
and each day decide 'on' or 'off' (variable w<worker>_d<day>). At least 2 workers
must be 'on' each day. No worker may work more than 3 days in total. | [
"w1_d1",
"w2_d1",
"w3_d1",
"w4_d1",
"w5_d1",
"w1_d2",
"w2_d2",
"w3_d2",
"w4_d2",
"w5_d2",
"w1_d3",
"w2_d3",
"w3_d3",
"w4_d3",
"w5_d3",
"w1_d4",
"w2_d4",
"w3_d4",
"w4_d4",
"w5_d4"
] | {"w1_d1":["on","off"],"w2_d1":["on","off"],"w3_d1":["on","off"],"w4_d1":["on","off"],"w5_d1":["on","off"],"w1_d2":["on","off"],"w2_d2":["on","off"],"w3_d2":["on","off"],"w4_d2":["on","off"],"w5_d2":["on","off"],"w1_d3":["on","off"],"w2_d3":["on","off"],"w3_d3":["on","off"],"w4_d3":["on","off"],"w5_d3":["on","off"],"w1_... | [{"type":"min_count","value":"on","min":2,"vars":["w1_d1","w2_d1","w3_d1","w4_d1","w5_d1"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d2","w2_d2","w3_d2","w4_d2","w5_d2"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d3","w2_d3","w3_d3","w4_d3","w5_d3"]},{"type":"min_count","value":"on","min":2,"vars... | null | {"w1_d1":"off","w2_d1":"on","w3_d1":"off","w4_d1":"on","w5_d1":"off","w1_d2":"off","w2_d2":"on","w3_d2":"off","w4_d2":"on","w5_d2":"off","w1_d3":"off","w2_d3":"on","w3_d3":"off","w4_d3":"on","w5_d3":"off","w1_d4":"on","w2_d4":"off","w3_d4":"on","w4_d4":"off","w5_d4":"off"} | benchmark/problems/sched5w4d.json |
sched5w5d | scheduling | feasible | 25 | true | null | false | null | 25 | 10 | [
"capacity",
"min_count"
] | Build a 5-day duty roster for 5 workers (w1..w5). For each worker
and each day decide 'on' or 'off' (variable w<worker>_d<day>). At least 2 workers
must be 'on' each day. No worker may work more than 3 days in total. | [
"w1_d1",
"w2_d1",
"w3_d1",
"w4_d1",
"w5_d1",
"w1_d2",
"w2_d2",
"w3_d2",
"w4_d2",
"w5_d2",
"w1_d3",
"w2_d3",
"w3_d3",
"w4_d3",
"w5_d3",
"w1_d4",
"w2_d4",
"w3_d4",
"w4_d4",
"w5_d4",
"w1_d5",
"w2_d5",
"w3_d5",
"w4_d5",
"w5_d5"
] | {"w1_d1":["on","off"],"w2_d1":["on","off"],"w3_d1":["on","off"],"w4_d1":["on","off"],"w5_d1":["on","off"],"w1_d2":["on","off"],"w2_d2":["on","off"],"w3_d2":["on","off"],"w4_d2":["on","off"],"w5_d2":["on","off"],"w1_d3":["on","off"],"w2_d3":["on","off"],"w3_d3":["on","off"],"w4_d3":["on","off"],"w5_d3":["on","off"],"w1_... | [{"type":"min_count","value":"on","min":2,"vars":["w1_d1","w2_d1","w3_d1","w4_d1","w5_d1"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d2","w2_d2","w3_d2","w4_d2","w5_d2"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d3","w2_d3","w3_d3","w4_d3","w5_d3"]},{"type":"min_count","value":"on","min":2,"vars... | null | {"w1_d1":"on","w2_d1":"off","w3_d1":"off","w4_d1":"on","w5_d1":"off","w1_d2":"on","w2_d2":"off","w3_d2":"off","w4_d2":"on","w5_d2":"off","w1_d3":"off","w2_d3":"off","w3_d3":"on","w4_d3":"off","w5_d3":"on","w1_d4":"on","w2_d4":"off","w3_d4":"on","w4_d4":"off","w5_d4":"off","w1_d5":"off","w2_d5":"on","w3_d5":"off","w4_d5... | benchmark/problems/sched5w5d.json |
sched6w5d | scheduling | feasible | 30 | true | null | false | null | 30 | 11 | [
"capacity",
"min_count"
] | Build a 5-day duty roster for 6 workers (w1..w6). For each worker
and each day decide 'on' or 'off' (variable w<worker>_d<day>). At least 2 workers
must be 'on' each day. No worker may work more than 4 days in total. | [
"w1_d1",
"w2_d1",
"w3_d1",
"w4_d1",
"w5_d1",
"w6_d1",
"w1_d2",
"w2_d2",
"w3_d2",
"w4_d2",
"w5_d2",
"w6_d2",
"w1_d3",
"w2_d3",
"w3_d3",
"w4_d3",
"w5_d3",
"w6_d3",
"w1_d4",
"w2_d4",
"w3_d4",
"w4_d4",
"w5_d4",
"w6_d4",
"w1_d5",
"w2_d5",
"w3_d5",
"w4_d5",
"w5_d5",... | {"w1_d1":["on","off"],"w2_d1":["on","off"],"w3_d1":["on","off"],"w4_d1":["on","off"],"w5_d1":["on","off"],"w6_d1":["on","off"],"w1_d2":["on","off"],"w2_d2":["on","off"],"w3_d2":["on","off"],"w4_d2":["on","off"],"w5_d2":["on","off"],"w6_d2":["on","off"],"w1_d3":["on","off"],"w2_d3":["on","off"],"w3_d3":["on","off"],"w4_... | [{"type":"min_count","value":"on","min":2,"vars":["w1_d1","w2_d1","w3_d1","w4_d1","w5_d1","w6_d1"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d2","w2_d2","w3_d2","w4_d2","w5_d2","w6_d2"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d3","w2_d3","w3_d3","w4_d3","w5_d3","w6_d3"]},{"type":"min_count","v... | null | {"w1_d1":"on","w2_d1":"off","w3_d1":"off","w4_d1":"off","w5_d1":"on","w6_d1":"off","w1_d2":"on","w2_d2":"off","w3_d2":"off","w4_d2":"off","w5_d2":"on","w6_d2":"off","w1_d3":"on","w2_d3":"off","w3_d3":"off","w4_d3":"on","w5_d3":"off","w6_d3":"off","w1_d4":"on","w2_d4":"off","w3_d4":"off","w4_d4":"on","w5_d4":"off","w6_d... | benchmark/problems/sched6w5d.json |
seat10_2x5_tight | seating | tight | 10 | true | null | false | null | 10 | 5 | [
"capacity",
"equal",
"not_equal"
] | Seat 10 guests (g1..g10) at tables ['t1', 't2'], each seating at most 5.
These pairs must sit at the SAME table: (g1,g2), (g3,g4). These pairs must sit at DIFFERENT
tables: (g1,g5). Assign every guest to exactly one table. | [
"g1",
"g2",
"g3",
"g4",
"g5",
"g6",
"g7",
"g8",
"g9",
"g10"
] | {"g1":["t1","t2"],"g2":["t1","t2"],"g3":["t1","t2"],"g4":["t1","t2"],"g5":["t1","t2"],"g6":["t1","t2"],"g7":["t1","t2"],"g8":["t1","t2"],"g9":["t1","t2"],"g10":["t1","t2"]} | [{"type":"capacity","value":"t1","max":5},{"type":"capacity","value":"t2","max":5},{"type":"equal","a":"g1","b":"g2"},{"type":"equal","a":"g3","b":"g4"},{"type":"not_equal","a":"g1","b":"g5"}] | null | {"g5":"t1","g1":"t2","g4":"t2","g3":"t2","g2":"t2","g6":"t1","g7":"t1","g8":"t2","g9":"t1","g10":"t1"} | benchmark/problems/seat10_2x5_tight.json |
seat12_3x4 | seating | feasible | 12 | true | null | false | null | 12 | 6 | [
"capacity",
"equal",
"not_equal"
] | Seat 12 guests (g1..g12) at tables ['t1', 't2', 't3'], each seating at most 4.
These pairs must sit at the SAME table: (g1,g2), (g3,g4). These pairs must sit at DIFFERENT
tables: (g1,g5). Assign every guest to exactly one table. | [
"g1",
"g2",
"g3",
"g4",
"g5",
"g6",
"g7",
"g8",
"g9",
"g10",
"g11",
"g12"
] | {"g1":["t1","t2","t3"],"g2":["t1","t2","t3"],"g3":["t1","t2","t3"],"g4":["t1","t2","t3"],"g5":["t1","t2","t3"],"g6":["t1","t2","t3"],"g7":["t1","t2","t3"],"g8":["t1","t2","t3"],"g9":["t1","t2","t3"],"g10":["t1","t2","t3"],"g11":["t1","t2","t3"],"g12":["t1","t2","t3"]} | [{"type":"capacity","value":"t1","max":4},{"type":"capacity","value":"t2","max":4},{"type":"capacity","value":"t3","max":4},{"type":"equal","a":"g1","b":"g2"},{"type":"equal","a":"g3","b":"g4"},{"type":"not_equal","a":"g1","b":"g5"}] | null | {"g5":"t2","g1":"t3","g4":"t1","g3":"t1","g2":"t3","g6":"t3","g7":"t2","g8":"t3","g9":"t1","g10":"t2","g11":"t1","g12":"t2"} | benchmark/problems/seat12_3x4.json |
seat5_2x4_infeasible | seating | infeasible | 5 | false | null | false | null | 5 | 5 | [
"capacity",
"not_equal"
] | Seat 5 guests (g1..g5) at tables ['t1', 't2'], each seating at most 4.
These pairs must sit at the SAME table: none. These pairs must sit at DIFFERENT
tables: (g1,g2), (g2,g3), (g1,g3). Assign every guest to exactly one table. | [
"g1",
"g2",
"g3",
"g4",
"g5"
] | {"g1":["t1","t2"],"g2":["t1","t2"],"g3":["t1","t2"],"g4":["t1","t2"],"g5":["t1","t2"]} | [{"type":"capacity","value":"t1","max":4},{"type":"capacity","value":"t2","max":4},{"type":"not_equal","a":"g1","b":"g2"},{"type":"not_equal","a":"g2","b":"g3"},{"type":"not_equal","a":"g1","b":"g3"}] | null | null | benchmark/problems/seat5_2x4_infeasible.json |
seat6_2x3_tight | seating | tight | 6 | true | null | false | null | 6 | 5 | [
"capacity",
"equal",
"not_equal"
] | Seat 6 guests (g1..g6) at tables ['t1', 't2'], each seating at most 3.
These pairs must sit at the SAME table: (g1,g2), (g3,g4). These pairs must sit at DIFFERENT
tables: (g1,g5). Assign every guest to exactly one table. | [
"g1",
"g2",
"g3",
"g4",
"g5",
"g6"
] | {"g1":["t1","t2"],"g2":["t1","t2"],"g3":["t1","t2"],"g4":["t1","t2"],"g5":["t1","t2"],"g6":["t1","t2"]} | [{"type":"capacity","value":"t1","max":3},{"type":"capacity","value":"t2","max":3},{"type":"equal","a":"g1","b":"g2"},{"type":"equal","a":"g3","b":"g4"},{"type":"not_equal","a":"g1","b":"g5"}] | null | {"g5":"t1","g1":"t2","g4":"t1","g3":"t1","g2":"t2","g6":"t2"} | benchmark/problems/seat6_2x3_tight.json |
seat7_2x3_infeasible | seating | infeasible | 7 | false | null | false | null | 7 | 2 | [
"capacity"
] | Seat 7 guests (g1..g7) at tables ['t1', 't2'], each seating at most 3.
These pairs must sit at the SAME table: none. These pairs must sit at DIFFERENT
tables: none. Assign every guest to exactly one table. | [
"g1",
"g2",
"g3",
"g4",
"g5",
"g6",
"g7"
] | {"g1":["t1","t2"],"g2":["t1","t2"],"g3":["t1","t2"],"g4":["t1","t2"],"g5":["t1","t2"],"g6":["t1","t2"],"g7":["t1","t2"]} | [{"type":"capacity","value":"t1","max":3},{"type":"capacity","value":"t2","max":3}] | null | null | benchmark/problems/seat7_2x3_infeasible.json |
seat8_2x4 | seating | feasible | 8 | true | null | false | null | 8 | 4 | [
"capacity",
"equal",
"not_equal"
] | Seat 8 guests (g1..g8) at tables ['t1', 't2'], each seating at most 4.
These pairs must sit at the SAME table: (g1,g2). These pairs must sit at DIFFERENT
tables: (g3,g4). Assign every guest to exactly one table. | [
"g1",
"g2",
"g3",
"g4",
"g5",
"g6",
"g7",
"g8"
] | {"g1":["t1","t2"],"g2":["t1","t2"],"g3":["t1","t2"],"g4":["t1","t2"],"g5":["t1","t2"],"g6":["t1","t2"],"g7":["t1","t2"],"g8":["t1","t2"]} | [{"type":"capacity","value":"t1","max":4},{"type":"capacity","value":"t2","max":4},{"type":"equal","a":"g1","b":"g2"},{"type":"not_equal","a":"g3","b":"g4"}] | null | {"g4":"t2","g3":"t1","g2":"t2","g1":"t2","g5":"t1","g6":"t1","g7":"t2","g8":"t1"} | benchmark/problems/seat8_2x4.json |
seat9_3x3 | seating | feasible | 9 | true | null | false | null | 9 | 6 | [
"capacity",
"equal",
"not_equal"
] | Seat 9 guests (g1..g9) at tables ['t1', 't2', 't3'], each seating at most 3.
These pairs must sit at the SAME table: (g1,g2), (g4,g5). These pairs must sit at DIFFERENT
tables: (g1,g3). Assign every guest to exactly one table. | [
"g1",
"g2",
"g3",
"g4",
"g5",
"g6",
"g7",
"g8",
"g9"
] | {"g1":["t1","t2","t3"],"g2":["t1","t2","t3"],"g3":["t1","t2","t3"],"g4":["t1","t2","t3"],"g5":["t1","t2","t3"],"g6":["t1","t2","t3"],"g7":["t1","t2","t3"],"g8":["t1","t2","t3"],"g9":["t1","t2","t3"]} | [{"type":"capacity","value":"t1","max":3},{"type":"capacity","value":"t2","max":3},{"type":"capacity","value":"t3","max":3},{"type":"equal","a":"g1","b":"g2"},{"type":"equal","a":"g4","b":"g5"},{"type":"not_equal","a":"g1","b":"g3"}] | null | {"g3":"t2","g1":"t3","g5":"t1","g4":"t1","g2":"t3","g6":"t2","g7":"t3","g8":"t1","g9":"t2"} | benchmark/problems/seat9_3x3.json |
stress_color20_k3_infeasible | graph_coloring | infeasible | 20 | false | null | false | null | 20 | 22 | [
"not_equal"
] | We must colour 20 regions, numbered n1..n20, using at most 3 colours (c1..c3).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,2), (1,3), (1,4), (2,3), (2,4), (3,4), (4,5), (5,6), (6,7), (7,8), (8,9), (9,10), (10,11), (11,12), (12,13), (13,14), (14,15), (15,16), (16,17... | [
"n1",
"n2",
"n3",
"n4",
"n5",
"n6",
"n7",
"n8",
"n9",
"n10",
"n11",
"n12",
"n13",
"n14",
"n15",
"n16",
"n17",
"n18",
"n19",
"n20"
] | {"n1":["c1","c2","c3"],"n2":["c1","c2","c3"],"n3":["c1","c2","c3"],"n4":["c1","c2","c3"],"n5":["c1","c2","c3"],"n6":["c1","c2","c3"],"n7":["c1","c2","c3"],"n8":["c1","c2","c3"],"n9":["c1","c2","c3"],"n10":["c1","c2","c3"],"n11":["c1","c2","c3"],"n12":["c1","c2","c3"],"n13":["c1","c2","c3"],"n14":["c1","c2","c3"],"n15":... | [{"type":"not_equal","a":"n1","b":"n2"},{"type":"not_equal","a":"n1","b":"n3"},{"type":"not_equal","a":"n1","b":"n4"},{"type":"not_equal","a":"n2","b":"n3"},{"type":"not_equal","a":"n2","b":"n4"},{"type":"not_equal","a":"n3","b":"n4"},{"type":"not_equal","a":"n4","b":"n5"},{"type":"not_equal","a":"n5","b":"n6"},{"type"... | null | null | benchmark/problems/stress_color20_k3_infeasible.json |
stress_color_g3x7_k3 | graph_coloring | stress | 21 | true | null | false | null | 21 | 73 | [
"not_equal"
] | We must colour 21 regions, numbered n1..n21, using at most 3 colours (c1..c3).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,9), (1,11), (1,13), (1,15), (1,17), (1,19), (1,21), (2,9), (2,11), (2,13), (2,15), (2,17), (2,19), (2,21), (3,9), (3,11), (3,13), (3,15), (3,1... | [
"n1",
"n2",
"n3",
"n4",
"n5",
"n6",
"n7",
"n8",
"n9",
"n10",
"n11",
"n12",
"n13",
"n14",
"n15",
"n16",
"n17",
"n18",
"n19",
"n20",
"n21"
] | {"n1":["c1","c2","c3"],"n2":["c1","c2","c3"],"n3":["c1","c2","c3"],"n4":["c1","c2","c3"],"n5":["c1","c2","c3"],"n6":["c1","c2","c3"],"n7":["c1","c2","c3"],"n8":["c1","c2","c3"],"n9":["c1","c2","c3"],"n10":["c1","c2","c3"],"n11":["c1","c2","c3"],"n12":["c1","c2","c3"],"n13":["c1","c2","c3"],"n14":["c1","c2","c3"],"n15":... | [{"type":"not_equal","a":"n1","b":"n9"},{"type":"not_equal","a":"n1","b":"n11"},{"type":"not_equal","a":"n1","b":"n13"},{"type":"not_equal","a":"n1","b":"n15"},{"type":"not_equal","a":"n1","b":"n17"},{"type":"not_equal","a":"n1","b":"n19"},{"type":"not_equal","a":"n1","b":"n21"},{"type":"not_equal","a":"n2","b":"n9"},{... | null | {"n20":"c2","n14":"c3","n18":"c1","n16":"c2","n21":"c1","n13":"c3","n19":"c1","n17":"c1","n15":"c1","n12":"c3","n11":"c3","n10":"c3","n9":"c3","n8":"c3","n7":"c2","n6":"c2","n5":"c2","n4":"c2","n3":"c2","n2":"c2","n1":"c2"} | benchmark/problems/stress_color_g3x7_k3.json |
stress_color_g3x9_k3 | graph_coloring | stress | 27 | true | null | false | null | 27 | 81 | [
"not_equal"
] | We must colour 27 regions, numbered n1..n27, using at most 3 colours (c1..c3).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,12), (1,15), (1,18), (1,21), (1,24), (1,27), (2,12), (2,15), (2,18), (2,21), (2,24), (2,27), (3,12), (3,15), (3,18), (3,21), (3,24), (3,27), (... | [
"n1",
"n2",
"n3",
"n4",
"n5",
"n6",
"n7",
"n8",
"n9",
"n10",
"n11",
"n12",
"n13",
"n14",
"n15",
"n16",
"n17",
"n18",
"n19",
"n20",
"n21",
"n22",
"n23",
"n24",
"n25",
"n26",
"n27"
] | {"n1":["c1","c2","c3"],"n2":["c1","c2","c3"],"n3":["c1","c2","c3"],"n4":["c1","c2","c3"],"n5":["c1","c2","c3"],"n6":["c1","c2","c3"],"n7":["c1","c2","c3"],"n8":["c1","c2","c3"],"n9":["c1","c2","c3"],"n10":["c1","c2","c3"],"n11":["c1","c2","c3"],"n12":["c1","c2","c3"],"n13":["c1","c2","c3"],"n14":["c1","c2","c3"],"n15":... | [{"type":"not_equal","a":"n1","b":"n12"},{"type":"not_equal","a":"n1","b":"n15"},{"type":"not_equal","a":"n1","b":"n18"},{"type":"not_equal","a":"n1","b":"n21"},{"type":"not_equal","a":"n1","b":"n24"},{"type":"not_equal","a":"n1","b":"n27"},{"type":"not_equal","a":"n2","b":"n12"},{"type":"not_equal","a":"n2","b":"n15"}... | null | {"n27":"c2","n18":"c3","n24":"c2","n21":"c2","n17":"c3","n16":"c3","n15":"c3","n14":"c3","n13":"c1","n12":"c3","n11":"c1","n10":"c3","n9":"c1","n8":"c1","n7":"c1","n6":"c1","n5":"c1","n4":"c1","n3":"c1","n2":"c1","n1":"c1","n26":"c2","n25":"c3","n23":"c2","n22":"c1","n20":"c1","n19":"c1"} | benchmark/problems/stress_color_g3x9_k3.json |
stress_color_g4x6_k4 | graph_coloring | stress | 24 | true | null | false | null | 24 | 72 | [
"not_equal"
] | We must colour 24 regions, numbered n1..n24, using at most 4 colours (c1..c4).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,9), (1,12), (1,15), (1,18), (1,21), (1,24), (2,9), (2,12), (2,15), (2,18), (2,21), (2,24), (3,9), (3,12), (3,15), (3,18), (3,21), (3,24), (4,9... | [
"n1",
"n2",
"n3",
"n4",
"n5",
"n6",
"n7",
"n8",
"n9",
"n10",
"n11",
"n12",
"n13",
"n14",
"n15",
"n16",
"n17",
"n18",
"n19",
"n20",
"n21",
"n22",
"n23",
"n24"
] | {"n1":["c1","c2","c3","c4"],"n2":["c1","c2","c3","c4"],"n3":["c1","c2","c3","c4"],"n4":["c1","c2","c3","c4"],"n5":["c1","c2","c3","c4"],"n6":["c1","c2","c3","c4"],"n7":["c1","c2","c3","c4"],"n8":["c1","c2","c3","c4"],"n9":["c1","c2","c3","c4"],"n10":["c1","c2","c3","c4"],"n11":["c1","c2","c3","c4"],"n12":["c1","c2","c3... | [{"type":"not_equal","a":"n1","b":"n9"},{"type":"not_equal","a":"n1","b":"n12"},{"type":"not_equal","a":"n1","b":"n15"},{"type":"not_equal","a":"n1","b":"n18"},{"type":"not_equal","a":"n1","b":"n21"},{"type":"not_equal","a":"n1","b":"n24"},{"type":"not_equal","a":"n2","b":"n9"},{"type":"not_equal","a":"n2","b":"n12"},{... | null | {"n24":"c4","n18":"c3","n21":"c4","n17":"c1","n16":"c2","n15":"c3","n14":"c2","n13":"c2","n12":"c2","n11":"c2","n10":"c2","n9":"c2","n8":"c2","n7":"c2","n6":"c1","n5":"c1","n4":"c1","n3":"c1","n2":"c1","n1":"c1","n23":"c1","n22":"c3","n20":"c4","n19":"c2"} | benchmark/problems/stress_color_g4x6_k4.json |
stress_knap18_c30 | knapsack | stress | 18 | true | 51 | true | max | 18 | 1 | [
"weighted_capacity"
] | A knapsack holds at most 30 units of weight. Choose a subset of the following items
to put 'in' the knapsack (the rest stay 'out') so the total weight is within 30 and
the total value is as large as possible.
Items: item1 (weight 7, value 12); item2 (weight 3, value 5); item3 (weight 9, value 15); item4 (weight 5, valu... | [
"item1",
"item2",
"item3",
"item4",
"item5",
"item6",
"item7",
"item8",
"item9",
"item10",
"item11",
"item12",
"item13",
"item14",
"item15",
"item16",
"item17",
"item18"
] | {"item1":["in","out"],"item2":["in","out"],"item3":["in","out"],"item4":["in","out"],"item5":["in","out"],"item6":["in","out"],"item7":["in","out"],"item8":["in","out"],"item9":["in","out"],"item10":["in","out"],"item11":["in","out"],"item12":["in","out"],"item13":["in","out"],"item14":["in","out"],"item15":["in","out"... | [{"type":"weighted_capacity","weights":{"item1":7,"item2":3,"item3":9,"item4":5,"item5":6,"item6":2,"item7":8,"item8":4,"item9":7,"item10":3,"item11":5,"item12":9,"item13":2,"item14":6,"item15":8,"item16":4,"item17":5,"item18":7},"selected_value":"in","bound":30}] | {"sense":"max","weights":{"item1":{"in":12,"out":0},"item2":{"in":5,"out":0},"item3":{"in":15,"out":0},"item4":{"in":8,"out":0},"item5":{"in":10,"out":0},"item6":{"in":3,"out":0},"item7":{"in":13,"out":0},"item8":{"in":6,"out":0},"item9":{"in":11,"out":0},"item10":{"in":4,"out":0},"item11":{"in":9,"out":0},"item12":{"i... | {"item1":"in","item2":"in","item3":"in","item4":"out","item5":"out","item6":"out","item7":"out","item8":"out","item9":"out","item10":"out","item11":"in","item12":"out","item13":"out","item14":"in","item15":"out","item16":"out","item17":"out","item18":"out"} | benchmark/problems/stress_knap18_c30.json |
stress_knap18_c40 | knapsack | stress | 18 | true | 68 | true | max | 18 | 1 | [
"weighted_capacity"
] | A knapsack holds at most 40 units of weight. Choose a subset of the following items
to put 'in' the knapsack (the rest stay 'out') so the total weight is within 40 and
the total value is as large as possible.
Items: item1 (weight 7, value 12); item2 (weight 3, value 5); item3 (weight 9, value 15); item4 (weight 5, valu... | [
"item1",
"item2",
"item3",
"item4",
"item5",
"item6",
"item7",
"item8",
"item9",
"item10",
"item11",
"item12",
"item13",
"item14",
"item15",
"item16",
"item17",
"item18"
] | {"item1":["in","out"],"item2":["in","out"],"item3":["in","out"],"item4":["in","out"],"item5":["in","out"],"item6":["in","out"],"item7":["in","out"],"item8":["in","out"],"item9":["in","out"],"item10":["in","out"],"item11":["in","out"],"item12":["in","out"],"item13":["in","out"],"item14":["in","out"],"item15":["in","out"... | [{"type":"weighted_capacity","weights":{"item1":7,"item2":3,"item3":9,"item4":5,"item5":6,"item6":2,"item7":8,"item8":4,"item9":7,"item10":3,"item11":5,"item12":9,"item13":2,"item14":6,"item15":8,"item16":4,"item17":5,"item18":7},"selected_value":"in","bound":40}] | {"sense":"max","weights":{"item1":{"in":12,"out":0},"item2":{"in":5,"out":0},"item3":{"in":15,"out":0},"item4":{"in":8,"out":0},"item5":{"in":10,"out":0},"item6":{"in":3,"out":0},"item7":{"in":13,"out":0},"item8":{"in":6,"out":0},"item9":{"in":11,"out":0},"item10":{"in":4,"out":0},"item11":{"in":9,"out":0},"item12":{"i... | {"item1":"in","item2":"in","item3":"in","item4":"out","item5":"in","item6":"out","item7":"out","item8":"out","item9":"out","item10":"out","item11":"in","item12":"out","item13":"out","item14":"in","item15":"out","item16":"in","item17":"out","item18":"out"} | benchmark/problems/stress_knap18_c40.json |
stress_latin6 | latin_square | stress | 6 | true | null | false | null | 36 | 12 | [
"all_different"
] | Fill an 6x6 grid (cell r<row>c<col>) with symbols d1..d6 so that every row contains
all 6 symbols once and every column contains all 6 symbols once (a Latin square).
Assign exactly one symbol to each cell. | [
"r1c1",
"r1c2",
"r1c3",
"r1c4",
"r1c5",
"r1c6",
"r2c1",
"r2c2",
"r2c3",
"r2c4",
"r2c5",
"r2c6",
"r3c1",
"r3c2",
"r3c3",
"r3c4",
"r3c5",
"r3c6",
"r4c1",
"r4c2",
"r4c3",
"r4c4",
"r4c5",
"r4c6",
"r5c1",
"r5c2",
"r5c3",
"r5c4",
"r5c5",
"r5c6",
"r6c1",
"r6c2"... | {"r1c1":["d1","d2","d3","d4","d5","d6"],"r1c2":["d1","d2","d3","d4","d5","d6"],"r1c3":["d1","d2","d3","d4","d5","d6"],"r1c4":["d1","d2","d3","d4","d5","d6"],"r1c5":["d1","d2","d3","d4","d5","d6"],"r1c6":["d1","d2","d3","d4","d5","d6"],"r2c1":["d1","d2","d3","d4","d5","d6"],"r2c2":["d1","d2","d3","d4","d5","d6"],"r2c3":... | [{"type":"all_different","vars":["r1c1","r1c2","r1c3","r1c4","r1c5","r1c6"]},{"type":"all_different","vars":["r2c1","r2c2","r2c3","r2c4","r2c5","r2c6"]},{"type":"all_different","vars":["r3c1","r3c2","r3c3","r3c4","r3c5","r3c6"]},{"type":"all_different","vars":["r4c1","r4c2","r4c3","r4c4","r4c5","r4c6"]},{"type":"all_di... | null | {"r6c6":"d3","r5c6":"d4","r4c6":"d1","r3c6":"d2","r2c6":"d6","r1c6":"d5","r6c5":"d4","r5c5":"d1","r4c5":"d2","r3c5":"d5","r2c5":"d3","r1c5":"d6","r6c4":"d2","r5c4":"d3","r4c4":"d6","r3c4":"d1","r2c4":"d5","r1c4":"d4","r6c3":"d1","r5c3":"d2","r4c3":"d5","r3c3":"d6","r2c3":"d4","r1c3":"d3","r6c2":"d5","r5c2":"d6","r4c2":... | benchmark/problems/stress_latin6.json |
stress_sched7w6d | scheduling | stress | 42 | true | null | false | null | 42 | 13 | [
"capacity",
"min_count"
] | Build a 6-day duty roster for 7 workers (w1..w7). For each worker
and each day decide 'on' or 'off' (variable w<worker>_d<day>). At least 3 workers
must be 'on' each day. No worker may work more than 4 days in total. | [
"w1_d1",
"w2_d1",
"w3_d1",
"w4_d1",
"w5_d1",
"w6_d1",
"w7_d1",
"w1_d2",
"w2_d2",
"w3_d2",
"w4_d2",
"w5_d2",
"w6_d2",
"w7_d2",
"w1_d3",
"w2_d3",
"w3_d3",
"w4_d3",
"w5_d3",
"w6_d3",
"w7_d3",
"w1_d4",
"w2_d4",
"w3_d4",
"w4_d4",
"w5_d4",
"w6_d4",
"w7_d4",
"w1_d5",... | {"w1_d1":["on","off"],"w2_d1":["on","off"],"w3_d1":["on","off"],"w4_d1":["on","off"],"w5_d1":["on","off"],"w6_d1":["on","off"],"w7_d1":["on","off"],"w1_d2":["on","off"],"w2_d2":["on","off"],"w3_d2":["on","off"],"w4_d2":["on","off"],"w5_d2":["on","off"],"w6_d2":["on","off"],"w7_d2":["on","off"],"w1_d3":["on","off"],"w2_... | [{"type":"min_count","value":"on","min":3,"vars":["w1_d1","w2_d1","w3_d1","w4_d1","w5_d1","w6_d1","w7_d1"]},{"type":"min_count","value":"on","min":3,"vars":["w1_d2","w2_d2","w3_d2","w4_d2","w5_d2","w6_d2","w7_d2"]},{"type":"min_count","value":"on","min":3,"vars":["w1_d3","w2_d3","w3_d3","w4_d3","w5_d3","w6_d3","w7_d3"]... | null | {"w1_d1":"on","w2_d1":"off","w3_d1":"on","w4_d1":"on","w5_d1":"off","w6_d1":"off","w7_d1":"off","w1_d2":"on","w2_d2":"on","w3_d2":"off","w4_d2":"off","w5_d2":"on","w6_d2":"off","w7_d2":"off","w1_d3":"off","w2_d3":"on","w3_d3":"off","w4_d3":"off","w5_d3":"off","w6_d3":"on","w7_d3":"on","w1_d4":"off","w2_d4":"off","w3_d4... | benchmark/problems/stress_sched7w6d.json |
stress_sched8w7d | scheduling | stress | 56 | true | null | false | null | 56 | 15 | [
"capacity",
"min_count"
] | Build a 7-day duty roster for 8 workers (w1..w8). For each worker
and each day decide 'on' or 'off' (variable w<worker>_d<day>). At least 3 workers
must be 'on' each day. No worker may work more than 5 days in total. | [
"w1_d1",
"w2_d1",
"w3_d1",
"w4_d1",
"w5_d1",
"w6_d1",
"w7_d1",
"w8_d1",
"w1_d2",
"w2_d2",
"w3_d2",
"w4_d2",
"w5_d2",
"w6_d2",
"w7_d2",
"w8_d2",
"w1_d3",
"w2_d3",
"w3_d3",
"w4_d3",
"w5_d3",
"w6_d3",
"w7_d3",
"w8_d3",
"w1_d4",
"w2_d4",
"w3_d4",
"w4_d4",
"w5_d4",... | {"w1_d1":["on","off"],"w2_d1":["on","off"],"w3_d1":["on","off"],"w4_d1":["on","off"],"w5_d1":["on","off"],"w6_d1":["on","off"],"w7_d1":["on","off"],"w8_d1":["on","off"],"w1_d2":["on","off"],"w2_d2":["on","off"],"w3_d2":["on","off"],"w4_d2":["on","off"],"w5_d2":["on","off"],"w6_d2":["on","off"],"w7_d2":["on","off"],"w8_... | [{"type":"min_count","value":"on","min":3,"vars":["w1_d1","w2_d1","w3_d1","w4_d1","w5_d1","w6_d1","w7_d1","w8_d1"]},{"type":"min_count","value":"on","min":3,"vars":["w1_d2","w2_d2","w3_d2","w4_d2","w5_d2","w6_d2","w7_d2","w8_d2"]},{"type":"min_count","value":"on","min":3,"vars":["w1_d3","w2_d3","w3_d3","w4_d3","w5_d3",... | null | {"w1_d1":"on","w2_d1":"on","w3_d1":"on","w4_d1":"on","w5_d1":"on","w6_d1":"on","w7_d1":"off","w8_d1":"on","w1_d2":"on","w2_d2":"off","w3_d2":"on","w4_d2":"on","w5_d2":"on","w6_d2":"on","w7_d2":"on","w8_d2":"on","w1_d3":"on","w2_d3":"on","w3_d3":"on","w4_d3":"off","w5_d3":"on","w6_d3":"on","w7_d3":"on","w8_d3":"off","w1... | benchmark/problems/stress_sched8w7d.json |
stress_seat20_5x4 | seating | stress | 20 | true | null | false | null | 20 | 10 | [
"capacity",
"equal",
"not_equal"
] | Seat 20 guests (g1..g20) at tables ['t1', 't2', 't3', 't4', 't5'], each seating at most 4.
These pairs must sit at the SAME table: (g1,g2), (g3,g4), (g5,g6). These pairs must sit at DIFFERENT
tables: (g1,g7), (g2,g8). Assign every guest to exactly one table. | [
"g1",
"g2",
"g3",
"g4",
"g5",
"g6",
"g7",
"g8",
"g9",
"g10",
"g11",
"g12",
"g13",
"g14",
"g15",
"g16",
"g17",
"g18",
"g19",
"g20"
] | {"g1":["t1","t2","t3","t4","t5"],"g2":["t1","t2","t3","t4","t5"],"g3":["t1","t2","t3","t4","t5"],"g4":["t1","t2","t3","t4","t5"],"g5":["t1","t2","t3","t4","t5"],"g6":["t1","t2","t3","t4","t5"],"g7":["t1","t2","t3","t4","t5"],"g8":["t1","t2","t3","t4","t5"],"g9":["t1","t2","t3","t4","t5"],"g10":["t1","t2","t3","t4","t5"... | [{"type":"capacity","value":"t1","max":4},{"type":"capacity","value":"t2","max":4},{"type":"capacity","value":"t3","max":4},{"type":"capacity","value":"t4","max":4},{"type":"capacity","value":"t5","max":4},{"type":"equal","a":"g1","b":"g2"},{"type":"equal","a":"g3","b":"g4"},{"type":"equal","a":"g5","b":"g6"},{"type":"... | null | {"g8":"t1","g2":"t3","g7":"t2","g1":"t3","g6":"t3","g5":"t3","g4":"t2","g3":"t2","g9":"t1","g10":"t4","g11":"t4","g12":"t1","g13":"t4","g14":"t4","g15":"t1","g16":"t5","g17":"t2","g18":"t5","g19":"t5","g20":"t5"} | benchmark/problems/stress_seat20_5x4.json |
stress_team18_3x6 | team_assignment | stress | 18 | true | null | false | null | 18 | 7 | [
"capacity",
"not_equal"
] | Assign 18 people (p1..p18) to the teams ['alpha', 'beta', 'gamma']. Each team can hold at
most 6 people. The following pairs must NOT be on the same team: (p1,p2), (p3,p4), (p5,p6), (p7,p8).
Forbidden person/team placements: none. Give each person exactly one team. | [
"p1",
"p2",
"p3",
"p4",
"p5",
"p6",
"p7",
"p8",
"p9",
"p10",
"p11",
"p12",
"p13",
"p14",
"p15",
"p16",
"p17",
"p18"
] | {"p1":["alpha","beta","gamma"],"p2":["alpha","beta","gamma"],"p3":["alpha","beta","gamma"],"p4":["alpha","beta","gamma"],"p5":["alpha","beta","gamma"],"p6":["alpha","beta","gamma"],"p7":["alpha","beta","gamma"],"p8":["alpha","beta","gamma"],"p9":["alpha","beta","gamma"],"p10":["alpha","beta","gamma"],"p11":["alpha","be... | [{"type":"capacity","value":"alpha","max":6},{"type":"capacity","value":"beta","max":6},{"type":"capacity","value":"gamma","max":6},{"type":"not_equal","a":"p1","b":"p2"},{"type":"not_equal","a":"p3","b":"p4"},{"type":"not_equal","a":"p5","b":"p6"},{"type":"not_equal","a":"p7","b":"p8"}] | null | {"p8":"beta","p7":"gamma","p6":"alpha","p5":"gamma","p4":"beta","p3":"alpha","p2":"gamma","p1":"beta","p9":"beta","p10":"alpha","p11":"beta","p12":"beta","p13":"alpha","p14":"alpha","p15":"alpha","p16":"gamma","p17":"gamma","p18":"gamma"} | benchmark/problems/stress_team18_3x6.json |
stress_tt12_5slot | timetabling | stress | 12 | true | null | false | null | 12 | 14 | [
"not_equal"
] | Schedule 12 courses (course1..course12) into time slots ['s1', 's2', 's3', 's4', 's5'].
Courses that share students or a room cannot be in the same slot. Conflicting pairs:
(course1,course2), (course2,course3), (course3,course4), (course4,course5), (course5,course6), (course6,course7), (course7,course8), (course8,cours... | [
"course1",
"course2",
"course3",
"course4",
"course5",
"course6",
"course7",
"course8",
"course9",
"course10",
"course11",
"course12"
] | {"course1":["s1","s2","s3","s4","s5"],"course2":["s1","s2","s3","s4","s5"],"course3":["s1","s2","s3","s4","s5"],"course4":["s1","s2","s3","s4","s5"],"course5":["s1","s2","s3","s4","s5"],"course6":["s1","s2","s3","s4","s5"],"course7":["s1","s2","s3","s4","s5"],"course8":["s1","s2","s3","s4","s5"],"course9":["s1","s2","s... | [{"type":"not_equal","a":"course1","b":"course2"},{"type":"not_equal","a":"course2","b":"course3"},{"type":"not_equal","a":"course3","b":"course4"},{"type":"not_equal","a":"course4","b":"course5"},{"type":"not_equal","a":"course5","b":"course6"},{"type":"not_equal","a":"course6","b":"course7"},{"type":"not_equal","a":"... | null | {"course7":"s4","course5":"s3","course4":"s2","course2":"s1","course3":"s5","course1":"s4","course12":"s2","course11":"s4","course10":"s1","course9":"s5","course8":"s2","course6":"s2"} | benchmark/problems/stress_tt12_5slot.json |
team10_2x5 | team_assignment | feasible | 10 | true | null | false | null | 10 | 4 | [
"capacity",
"not_equal"
] | Assign 10 people (p1..p10) to the teams ['alpha', 'beta']. Each team can hold at
most 5 people. The following pairs must NOT be on the same team: (p1,p2), (p3,p4).
Forbidden person/team placements: none. Give each person exactly one team. | [
"p1",
"p2",
"p3",
"p4",
"p5",
"p6",
"p7",
"p8",
"p9",
"p10"
] | {"p1":["alpha","beta"],"p2":["alpha","beta"],"p3":["alpha","beta"],"p4":["alpha","beta"],"p5":["alpha","beta"],"p6":["alpha","beta"],"p7":["alpha","beta"],"p8":["alpha","beta"],"p9":["alpha","beta"],"p10":["alpha","beta"]} | [{"type":"capacity","value":"alpha","max":5},{"type":"capacity","value":"beta","max":5},{"type":"not_equal","a":"p1","b":"p2"},{"type":"not_equal","a":"p3","b":"p4"}] | null | {"p4":"beta","p3":"alpha","p2":"beta","p1":"alpha","p5":"beta","p6":"alpha","p7":"alpha","p8":"beta","p9":"alpha","p10":"beta"} | benchmark/problems/team10_2x5.json |
team10_3x3_infeasible | team_assignment | infeasible | 10 | false | null | false | null | 10 | 3 | [
"capacity"
] | Assign 10 people (p1..p10) to the teams ['alpha', 'beta', 'gamma']. Each team can hold at
most 3 people. The following pairs must NOT be on the same team: none.
Forbidden person/team placements: none. Give each person exactly one team. | [
"p1",
"p2",
"p3",
"p4",
"p5",
"p6",
"p7",
"p8",
"p9",
"p10"
] | {"p1":["alpha","beta","gamma"],"p2":["alpha","beta","gamma"],"p3":["alpha","beta","gamma"],"p4":["alpha","beta","gamma"],"p5":["alpha","beta","gamma"],"p6":["alpha","beta","gamma"],"p7":["alpha","beta","gamma"],"p8":["alpha","beta","gamma"],"p9":["alpha","beta","gamma"],"p10":["alpha","beta","gamma"]} | [{"type":"capacity","value":"alpha","max":3},{"type":"capacity","value":"beta","max":3},{"type":"capacity","value":"gamma","max":3}] | null | null | benchmark/problems/team10_3x3_infeasible.json |
team12_3x4 | team_assignment | feasible | 12 | true | null | false | null | 12 | 6 | [
"capacity",
"not_equal"
] | Assign 12 people (p1..p12) to the teams ['alpha', 'beta', 'gamma']. Each team can hold at
most 4 people. The following pairs must NOT be on the same team: (p1,p2), (p3,p4), (p5,p6).
Forbidden person/team placements: none. Give each person exactly one team. | [
"p1",
"p2",
"p3",
"p4",
"p5",
"p6",
"p7",
"p8",
"p9",
"p10",
"p11",
"p12"
] | {"p1":["alpha","beta","gamma"],"p2":["alpha","beta","gamma"],"p3":["alpha","beta","gamma"],"p4":["alpha","beta","gamma"],"p5":["alpha","beta","gamma"],"p6":["alpha","beta","gamma"],"p7":["alpha","beta","gamma"],"p8":["alpha","beta","gamma"],"p9":["alpha","beta","gamma"],"p10":["alpha","beta","gamma"],"p11":["alpha","be... | [{"type":"capacity","value":"alpha","max":4},{"type":"capacity","value":"beta","max":4},{"type":"capacity","value":"gamma","max":4},{"type":"not_equal","a":"p1","b":"p2"},{"type":"not_equal","a":"p3","b":"p4"},{"type":"not_equal","a":"p5","b":"p6"}] | null | {"p6":"beta","p5":"gamma","p4":"alpha","p3":"gamma","p2":"beta","p1":"alpha","p7":"beta","p8":"alpha","p9":"gamma","p10":"gamma","p11":"alpha","p12":"beta"} | benchmark/problems/team12_3x4.json |
team6_2x3 | team_assignment | feasible | 6 | true | null | false | null | 6 | 4 | [
"capacity",
"forbidden",
"not_equal"
] | Assign 6 people (p1..p6) to the teams ['alpha', 'beta']. Each team can hold at
most 3 people. The following pairs must NOT be on the same team: (p1,p2).
Forbidden person/team placements: p3!=beta. Give each person exactly one team. | [
"p1",
"p2",
"p3",
"p4",
"p5",
"p6"
] | {"p1":["alpha","beta"],"p2":["alpha","beta"],"p3":["alpha","beta"],"p4":["alpha","beta"],"p5":["alpha","beta"],"p6":["alpha","beta"]} | [{"type":"capacity","value":"alpha","max":3},{"type":"capacity","value":"beta","max":3},{"type":"not_equal","a":"p1","b":"p2"},{"type":"forbidden","var":"p3","value":"beta"}] | null | {"p3":"alpha","p2":"beta","p1":"alpha","p4":"beta","p5":"alpha","p6":"beta"} | benchmark/problems/team6_2x3.json |
team6_2x3_tight | team_assignment | tight | 6 | true | null | false | null | 6 | 4 | [
"capacity",
"not_equal"
] | Assign 6 people (p1..p6) to the teams ['alpha', 'beta']. Each team can hold at
most 3 people. The following pairs must NOT be on the same team: (p1,p2), (p3,p4).
Forbidden person/team placements: none. Give each person exactly one team. | [
"p1",
"p2",
"p3",
"p4",
"p5",
"p6"
] | {"p1":["alpha","beta"],"p2":["alpha","beta"],"p3":["alpha","beta"],"p4":["alpha","beta"],"p5":["alpha","beta"],"p6":["alpha","beta"]} | [{"type":"capacity","value":"alpha","max":3},{"type":"capacity","value":"beta","max":3},{"type":"not_equal","a":"p1","b":"p2"},{"type":"not_equal","a":"p3","b":"p4"}] | null | {"p4":"beta","p3":"alpha","p2":"beta","p1":"alpha","p5":"beta","p6":"alpha"} | benchmark/problems/team6_2x3_tight.json |
team7_2x3_infeasible | team_assignment | infeasible | 7 | false | null | false | null | 7 | 2 | [
"capacity"
] | Assign 7 people (p1..p7) to the teams ['alpha', 'beta']. Each team can hold at
most 3 people. The following pairs must NOT be on the same team: none.
Forbidden person/team placements: none. Give each person exactly one team. | [
"p1",
"p2",
"p3",
"p4",
"p5",
"p6",
"p7"
] | {"p1":["alpha","beta"],"p2":["alpha","beta"],"p3":["alpha","beta"],"p4":["alpha","beta"],"p5":["alpha","beta"],"p6":["alpha","beta"],"p7":["alpha","beta"]} | [{"type":"capacity","value":"alpha","max":3},{"type":"capacity","value":"beta","max":3}] | null | null | benchmark/problems/team7_2x3_infeasible.json |
team8_2x4_sep_infeasible | team_assignment | infeasible | 8 | false | null | false | null | 8 | 5 | [
"capacity",
"not_equal"
] | Assign 8 people (p1..p8) to the teams ['alpha', 'beta']. Each team can hold at
most 4 people. The following pairs must NOT be on the same team: (p1,p2), (p1,p3), (p2,p3).
Forbidden person/team placements: none. Give each person exactly one team. | [
"p1",
"p2",
"p3",
"p4",
"p5",
"p6",
"p7",
"p8"
] | {"p1":["alpha","beta"],"p2":["alpha","beta"],"p3":["alpha","beta"],"p4":["alpha","beta"],"p5":["alpha","beta"],"p6":["alpha","beta"],"p7":["alpha","beta"],"p8":["alpha","beta"]} | [{"type":"capacity","value":"alpha","max":4},{"type":"capacity","value":"beta","max":4},{"type":"not_equal","a":"p1","b":"p2"},{"type":"not_equal","a":"p1","b":"p3"},{"type":"not_equal","a":"p2","b":"p3"}] | null | null | benchmark/problems/team8_2x4_sep_infeasible.json |
team8_2x4_tight | team_assignment | tight | 8 | true | null | false | null | 8 | 5 | [
"capacity",
"not_equal"
] | Assign 8 people (p1..p8) to the teams ['alpha', 'beta']. Each team can hold at
most 4 people. The following pairs must NOT be on the same team: (p1,p2), (p3,p4), (p5,p6).
Forbidden person/team placements: none. Give each person exactly one team. | [
"p1",
"p2",
"p3",
"p4",
"p5",
"p6",
"p7",
"p8"
] | {"p1":["alpha","beta"],"p2":["alpha","beta"],"p3":["alpha","beta"],"p4":["alpha","beta"],"p5":["alpha","beta"],"p6":["alpha","beta"],"p7":["alpha","beta"],"p8":["alpha","beta"]} | [{"type":"capacity","value":"alpha","max":4},{"type":"capacity","value":"beta","max":4},{"type":"not_equal","a":"p1","b":"p2"},{"type":"not_equal","a":"p3","b":"p4"},{"type":"not_equal","a":"p5","b":"p6"}] | null | {"p6":"beta","p5":"alpha","p4":"beta","p3":"alpha","p2":"beta","p1":"alpha","p7":"beta","p8":"alpha"} | benchmark/problems/team8_2x4_tight.json |
team9_3x3 | team_assignment | feasible | 9 | true | null | false | null | 9 | 5 | [
"capacity",
"not_equal"
] | Assign 9 people (p1..p9) to the teams ['alpha', 'beta', 'gamma']. Each team can hold at
most 3 people. The following pairs must NOT be on the same team: (p1,p2), (p3,p4).
Forbidden person/team placements: none. Give each person exactly one team. | [
"p1",
"p2",
"p3",
"p4",
"p5",
"p6",
"p7",
"p8",
"p9"
] | {"p1":["alpha","beta","gamma"],"p2":["alpha","beta","gamma"],"p3":["alpha","beta","gamma"],"p4":["alpha","beta","gamma"],"p5":["alpha","beta","gamma"],"p6":["alpha","beta","gamma"],"p7":["alpha","beta","gamma"],"p8":["alpha","beta","gamma"],"p9":["alpha","beta","gamma"]} | [{"type":"capacity","value":"alpha","max":3},{"type":"capacity","value":"beta","max":3},{"type":"capacity","value":"gamma","max":3},{"type":"not_equal","a":"p1","b":"p2"},{"type":"not_equal","a":"p3","b":"p4"}] | null | {"p4":"beta","p3":"gamma","p2":"alpha","p1":"gamma","p5":"alpha","p6":"beta","p7":"beta","p8":"gamma","p9":"alpha"} | benchmark/problems/team9_3x3.json |
tt4_3slot_infeasible | timetabling | infeasible | 4 | false | null | false | null | 4 | 6 | [
"not_equal"
] | Schedule 4 courses (course1..course4) into time slots ['s1', 's2', 's3'].
Courses that share students or a room cannot be in the same slot. Conflicting pairs:
(course1,course2), (course1,course3), (course1,course4), (course2,course3), (course2,course4), (course3,course4). Forbidden course/slot placements: none. Give ea... | [
"course1",
"course2",
"course3",
"course4"
] | {"course1":["s1","s2","s3"],"course2":["s1","s2","s3"],"course3":["s1","s2","s3"],"course4":["s1","s2","s3"]} | [{"type":"not_equal","a":"course1","b":"course2"},{"type":"not_equal","a":"course1","b":"course3"},{"type":"not_equal","a":"course1","b":"course4"},{"type":"not_equal","a":"course2","b":"course3"},{"type":"not_equal","a":"course2","b":"course4"},{"type":"not_equal","a":"course3","b":"course4"}] | null | null | benchmark/problems/tt4_3slot_infeasible.json |
tt4_3slot_tight | timetabling | tight | 4 | true | null | false | null | 4 | 4 | [
"not_equal"
] | Schedule 4 courses (course1..course4) into time slots ['s1', 's2', 's3'].
Courses that share students or a room cannot be in the same slot. Conflicting pairs:
(course1,course2), (course1,course3), (course2,course3), (course2,course4). Forbidden course/slot placements: none. Give each course exactly one slot. | [
"course1",
"course2",
"course3",
"course4"
] | {"course1":["s1","s2","s3"],"course2":["s1","s2","s3"],"course3":["s1","s2","s3"],"course4":["s1","s2","s3"]} | [{"type":"not_equal","a":"course1","b":"course2"},{"type":"not_equal","a":"course1","b":"course3"},{"type":"not_equal","a":"course2","b":"course3"},{"type":"not_equal","a":"course2","b":"course4"}] | null | {"course4":"s2","course2":"s3","course3":"s2","course1":"s1"} | benchmark/problems/tt4_3slot_tight.json |
tt5_3slot | timetabling | feasible | 5 | true | null | false | null | 5 | 3 | [
"not_equal"
] | Schedule 5 courses (course1..course5) into time slots ['mon', 'tue', 'wed'].
Courses that share students or a room cannot be in the same slot. Conflicting pairs:
(course1,course2), (course2,course3), (course4,course5). Forbidden course/slot placements: none. Give each course exactly one slot. | [
"course1",
"course2",
"course3",
"course4",
"course5"
] | {"course1":["mon","tue","wed"],"course2":["mon","tue","wed"],"course3":["mon","tue","wed"],"course4":["mon","tue","wed"],"course5":["mon","tue","wed"]} | [{"type":"not_equal","a":"course1","b":"course2"},{"type":"not_equal","a":"course2","b":"course3"},{"type":"not_equal","a":"course4","b":"course5"}] | null | {"course5":"mon","course4":"tue","course3":"mon","course2":"wed","course1":"mon"} | benchmark/problems/tt5_3slot.json |
tt5_3slot_infeasible | timetabling | infeasible | 5 | false | null | false | null | 5 | 7 | [
"not_equal"
] | Schedule 5 courses (course1..course5) into time slots ['s1', 's2', 's3'].
Courses that share students or a room cannot be in the same slot. Conflicting pairs:
(course1,course2), (course1,course3), (course1,course4), (course2,course3), (course2,course4), (course3,course4), (course4,course5). Forbidden course/slot placem... | [
"course1",
"course2",
"course3",
"course4",
"course5"
] | {"course1":["s1","s2","s3"],"course2":["s1","s2","s3"],"course3":["s1","s2","s3"],"course4":["s1","s2","s3"],"course5":["s1","s2","s3"]} | [{"type":"not_equal","a":"course1","b":"course2"},{"type":"not_equal","a":"course1","b":"course3"},{"type":"not_equal","a":"course1","b":"course4"},{"type":"not_equal","a":"course2","b":"course3"},{"type":"not_equal","a":"course2","b":"course4"},{"type":"not_equal","a":"course3","b":"course4"},{"type":"not_equal","a":"... | null | null | benchmark/problems/tt5_3slot_infeasible.json |
tt5_3slot_tight | timetabling | tight | 5 | true | null | false | null | 5 | 5 | [
"not_equal"
] | Schedule 5 courses (course1..course5) into time slots ['s1', 's2', 's3'].
Courses that share students or a room cannot be in the same slot. Conflicting pairs:
(course1,course2), (course1,course3), (course2,course3), (course3,course4), (course4,course5). Forbidden course/slot placements: none. Give each course exactly o... | [
"course1",
"course2",
"course3",
"course4",
"course5"
] | {"course1":["s1","s2","s3"],"course2":["s1","s2","s3"],"course3":["s1","s2","s3"],"course4":["s1","s2","s3"],"course5":["s1","s2","s3"]} | [{"type":"not_equal","a":"course1","b":"course2"},{"type":"not_equal","a":"course1","b":"course3"},{"type":"not_equal","a":"course2","b":"course3"},{"type":"not_equal","a":"course3","b":"course4"},{"type":"not_equal","a":"course4","b":"course5"}] | null | {"course5":"s2","course4":"s1","course3":"s3","course2":"s2","course1":"s1"} | benchmark/problems/tt5_3slot_tight.json |
tt6_4slot | timetabling | feasible | 6 | true | null | false | null | 6 | 5 | [
"forbidden",
"not_equal"
] | Schedule 6 courses (course1..course6) into time slots ['s1', 's2', 's3', 's4'].
Courses that share students or a room cannot be in the same slot. Conflicting pairs:
(course1,course2), (course2,course3), (course3,course4), (course5,course6). Forbidden course/slot placements: course1!=s4. Give each course exactly one slo... | [
"course1",
"course2",
"course3",
"course4",
"course5",
"course6"
] | {"course1":["s1","s2","s3","s4"],"course2":["s1","s2","s3","s4"],"course3":["s1","s2","s3","s4"],"course4":["s1","s2","s3","s4"],"course5":["s1","s2","s3","s4"],"course6":["s1","s2","s3","s4"]} | [{"type":"not_equal","a":"course1","b":"course2"},{"type":"not_equal","a":"course2","b":"course3"},{"type":"not_equal","a":"course3","b":"course4"},{"type":"not_equal","a":"course5","b":"course6"},{"type":"forbidden","var":"course1","value":"s4"}] | null | {"course1":"s3","course6":"s2","course5":"s3","course4":"s2","course3":"s3","course2":"s4"} | benchmark/problems/tt6_4slot.json |
tt7_4slot | timetabling | feasible | 7 | true | null | false | null | 7 | 6 | [
"not_equal"
] | Schedule 7 courses (course1..course7) into time slots ['s1', 's2', 's3', 's4'].
Courses that share students or a room cannot be in the same slot. Conflicting pairs:
(course1,course2), (course2,course3), (course3,course4), (course4,course5), (course5,course6), (course6,course7). Forbidden course/slot placements: none. G... | [
"course1",
"course2",
"course3",
"course4",
"course5",
"course6",
"course7"
] | {"course1":["s1","s2","s3","s4"],"course2":["s1","s2","s3","s4"],"course3":["s1","s2","s3","s4"],"course4":["s1","s2","s3","s4"],"course5":["s1","s2","s3","s4"],"course6":["s1","s2","s3","s4"],"course7":["s1","s2","s3","s4"]} | [{"type":"not_equal","a":"course1","b":"course2"},{"type":"not_equal","a":"course2","b":"course3"},{"type":"not_equal","a":"course3","b":"course4"},{"type":"not_equal","a":"course4","b":"course5"},{"type":"not_equal","a":"course5","b":"course6"},{"type":"not_equal","a":"course6","b":"course7"}] | null | {"course7":"s4","course6":"s3","course5":"s4","course4":"s2","course3":"s3","course2":"s4","course1":"s2"} | benchmark/problems/tt7_4slot.json |
xl_color_g3x20_k3 | graph_coloring | xl | 60 | true | null | false | null | 60 | 600 | [
"not_equal"
] | We must colour 60 regions, numbered n1..n60, using at most 3 colours (c1..c3).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,22), (1,24), (1,26), (1,28), (1,30), (1,32), (1,34), (1,36), (1,38), (1,40), (1,42), (1,44), (1,46), (1,48), (1,50), (1,52), (1,54), (1,56), (... | [
"n1",
"n2",
"n3",
"n4",
"n5",
"n6",
"n7",
"n8",
"n9",
"n10",
"n11",
"n12",
"n13",
"n14",
"n15",
"n16",
"n17",
"n18",
"n19",
"n20",
"n21",
"n22",
"n23",
"n24",
"n25",
"n26",
"n27",
"n28",
"n29",
"n30",
"n31",
"n32",
"n33",
"n34",
"n35",
"n36",
"... | {"n1":["c1","c2","c3"],"n2":["c1","c2","c3"],"n3":["c1","c2","c3"],"n4":["c1","c2","c3"],"n5":["c1","c2","c3"],"n6":["c1","c2","c3"],"n7":["c1","c2","c3"],"n8":["c1","c2","c3"],"n9":["c1","c2","c3"],"n10":["c1","c2","c3"],"n11":["c1","c2","c3"],"n12":["c1","c2","c3"],"n13":["c1","c2","c3"],"n14":["c1","c2","c3"],"n15":... | [{"type":"not_equal","a":"n1","b":"n22"},{"type":"not_equal","a":"n1","b":"n24"},{"type":"not_equal","a":"n1","b":"n26"},{"type":"not_equal","a":"n1","b":"n28"},{"type":"not_equal","a":"n1","b":"n30"},{"type":"not_equal","a":"n1","b":"n32"},{"type":"not_equal","a":"n1","b":"n34"},{"type":"not_equal","a":"n1","b":"n36"}... | null | {"n60":"c2","n40":"c3","n58":"c2","n56":"c2","n54":"c2","n52":"c2","n50":"c2","n48":"c2","n46":"c2","n44":"c2","n42":"c2","n39":"c3","n38":"c3","n37":"c3","n36":"c3","n35":"c3","n34":"c3","n33":"c1","n32":"c3","n31":"c3","n30":"c3","n29":"c3","n28":"c3","n27":"c1","n26":"c3","n25":"c3","n24":"c3","n23":"c3","n22":"c3",... | benchmark/problems/xl_color_g3x20_k3.json |
xl_color_g3x30_k3 | graph_coloring | xl | 90 | true | null | false | null | 90 | 900 | [
"not_equal"
] | We must colour 90 regions, numbered n1..n90, using at most 3 colours (c1..c3).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,33), (1,36), (1,39), (1,42), (1,45), (1,48), (1,51), (1,54), (1,57), (1,60), (1,63), (1,66), (1,69), (1,72), (1,75), (1,78), (1,81), (1,84), (... | [
"n1",
"n2",
"n3",
"n4",
"n5",
"n6",
"n7",
"n8",
"n9",
"n10",
"n11",
"n12",
"n13",
"n14",
"n15",
"n16",
"n17",
"n18",
"n19",
"n20",
"n21",
"n22",
"n23",
"n24",
"n25",
"n26",
"n27",
"n28",
"n29",
"n30",
"n31",
"n32",
"n33",
"n34",
"n35",
"n36",
"... | {"n1":["c1","c2","c3"],"n2":["c1","c2","c3"],"n3":["c1","c2","c3"],"n4":["c1","c2","c3"],"n5":["c1","c2","c3"],"n6":["c1","c2","c3"],"n7":["c1","c2","c3"],"n8":["c1","c2","c3"],"n9":["c1","c2","c3"],"n10":["c1","c2","c3"],"n11":["c1","c2","c3"],"n12":["c1","c2","c3"],"n13":["c1","c2","c3"],"n14":["c1","c2","c3"],"n15":... | [{"type":"not_equal","a":"n1","b":"n33"},{"type":"not_equal","a":"n1","b":"n36"},{"type":"not_equal","a":"n1","b":"n39"},{"type":"not_equal","a":"n1","b":"n42"},{"type":"not_equal","a":"n1","b":"n45"},{"type":"not_equal","a":"n1","b":"n48"},{"type":"not_equal","a":"n1","b":"n51"},{"type":"not_equal","a":"n1","b":"n54"}... | null | {"n90":"c2","n60":"c3","n87":"c2","n84":"c2","n81":"c2","n78":"c2","n75":"c2","n72":"c2","n69":"c2","n66":"c2","n63":"c2","n59":"c3","n58":"c1","n57":"c3","n56":"c3","n55":"c3","n54":"c3","n53":"c3","n52":"c3","n51":"c3","n50":"c3","n49":"c3","n48":"c3","n47":"c3","n46":"c3","n45":"c3","n44":"c3","n43":"c3","n42":"c3",... | benchmark/problems/xl_color_g3x30_k3.json |
xl_color_g4x15_k4 | graph_coloring | xl | 60 | true | null | false | null | 60 | 450 | [
"not_equal"
] | We must colour 60 regions, numbered n1..n60, using at most 4 colours (c1..c4).
Two regions that share a border must get different colours.
Bordering pairs (by region number): (1,18), (1,21), (1,24), (1,27), (1,30), (1,33), (1,36), (1,39), (1,42), (1,45), (1,48), (1,51), (1,54), (1,57), (1,60), (2,18), (2,21), (2,24), (... | [
"n1",
"n2",
"n3",
"n4",
"n5",
"n6",
"n7",
"n8",
"n9",
"n10",
"n11",
"n12",
"n13",
"n14",
"n15",
"n16",
"n17",
"n18",
"n19",
"n20",
"n21",
"n22",
"n23",
"n24",
"n25",
"n26",
"n27",
"n28",
"n29",
"n30",
"n31",
"n32",
"n33",
"n34",
"n35",
"n36",
"... | {"n1":["c1","c2","c3","c4"],"n2":["c1","c2","c3","c4"],"n3":["c1","c2","c3","c4"],"n4":["c1","c2","c3","c4"],"n5":["c1","c2","c3","c4"],"n6":["c1","c2","c3","c4"],"n7":["c1","c2","c3","c4"],"n8":["c1","c2","c3","c4"],"n9":["c1","c2","c3","c4"],"n10":["c1","c2","c3","c4"],"n11":["c1","c2","c3","c4"],"n12":["c1","c2","c3... | [{"type":"not_equal","a":"n1","b":"n18"},{"type":"not_equal","a":"n1","b":"n21"},{"type":"not_equal","a":"n1","b":"n24"},{"type":"not_equal","a":"n1","b":"n27"},{"type":"not_equal","a":"n1","b":"n30"},{"type":"not_equal","a":"n1","b":"n33"},{"type":"not_equal","a":"n1","b":"n36"},{"type":"not_equal","a":"n1","b":"n39"}... | null | {"n60":"c2","n45":"c1","n57":"c2","n54":"c2","n51":"c2","n48":"c2","n44":"c1","n43":"c3","n42":"c1","n41":"c1","n40":"c4","n39":"c1","n38":"c1","n37":"c1","n36":"c1","n35":"c3","n34":"c4","n33":"c1","n32":"c3","n31":"c4","n30":"c3","n29":"c4","n28":"c3","n27":"c3","n26":"c3","n25":"c4","n24":"c3","n23":"c4","n22":"c4",... | benchmark/problems/xl_color_g4x15_k4.json |
xl_latin8 | latin_square | xl | 8 | true | null | false | null | 64 | 16 | [
"all_different"
] | Fill an 8x8 grid (cell r<row>c<col>) with symbols d1..d8 so that every row contains
all 8 symbols once and every column contains all 8 symbols once (a Latin square).
Assign exactly one symbol to each cell. | [
"r1c1",
"r1c2",
"r1c3",
"r1c4",
"r1c5",
"r1c6",
"r1c7",
"r1c8",
"r2c1",
"r2c2",
"r2c3",
"r2c4",
"r2c5",
"r2c6",
"r2c7",
"r2c8",
"r3c1",
"r3c2",
"r3c3",
"r3c4",
"r3c5",
"r3c6",
"r3c7",
"r3c8",
"r4c1",
"r4c2",
"r4c3",
"r4c4",
"r4c5",
"r4c6",
"r4c7",
"r4c8"... | {"r1c1":["d1","d2","d3","d4","d5","d6","d7","d8"],"r1c2":["d1","d2","d3","d4","d5","d6","d7","d8"],"r1c3":["d1","d2","d3","d4","d5","d6","d7","d8"],"r1c4":["d1","d2","d3","d4","d5","d6","d7","d8"],"r1c5":["d1","d2","d3","d4","d5","d6","d7","d8"],"r1c6":["d1","d2","d3","d4","d5","d6","d7","d8"],"r1c7":["d1","d2","d3","d... | [{"type":"all_different","vars":["r1c1","r1c2","r1c3","r1c4","r1c5","r1c6","r1c7","r1c8"]},{"type":"all_different","vars":["r2c1","r2c2","r2c3","r2c4","r2c5","r2c6","r2c7","r2c8"]},{"type":"all_different","vars":["r3c1","r3c2","r3c3","r3c4","r3c5","r3c6","r3c7","r3c8"]},{"type":"all_different","vars":["r4c1","r4c2","r4... | null | {"r8c8":"d3","r7c8":"d5","r6c8":"d4","r5c8":"d1","r4c8":"d2","r3c8":"d6","r2c8":"d8","r1c8":"d7","r8c7":"d5","r7c7":"d1","r6c7":"d3","r5c7":"d2","r4c7":"d8","r3c7":"d4","r2c7":"d7","r1c7":"d6","r8c6":"d1","r7c6":"d4","r6c6":"d2","r5c6":"d3","r4c6":"d7","r3c6":"d8","r2c6":"d6","r1c6":"d5","r8c5":"d2","r7c5":"d3","r6c5":... | benchmark/problems/xl_latin8.json |
xl_latin9 | latin_square | xl | 9 | true | null | false | null | 81 | 18 | [
"all_different"
] | Fill an 9x9 grid (cell r<row>c<col>) with symbols d1..d9 so that every row contains
all 9 symbols once and every column contains all 9 symbols once (a Latin square).
Assign exactly one symbol to each cell. | [
"r1c1",
"r1c2",
"r1c3",
"r1c4",
"r1c5",
"r1c6",
"r1c7",
"r1c8",
"r1c9",
"r2c1",
"r2c2",
"r2c3",
"r2c4",
"r2c5",
"r2c6",
"r2c7",
"r2c8",
"r2c9",
"r3c1",
"r3c2",
"r3c3",
"r3c4",
"r3c5",
"r3c6",
"r3c7",
"r3c8",
"r3c9",
"r4c1",
"r4c2",
"r4c3",
"r4c4",
"r4c5"... | {"r1c1":["d1","d2","d3","d4","d5","d6","d7","d8","d9"],"r1c2":["d1","d2","d3","d4","d5","d6","d7","d8","d9"],"r1c3":["d1","d2","d3","d4","d5","d6","d7","d8","d9"],"r1c4":["d1","d2","d3","d4","d5","d6","d7","d8","d9"],"r1c5":["d1","d2","d3","d4","d5","d6","d7","d8","d9"],"r1c6":["d1","d2","d3","d4","d5","d6","d7","d8","... | [{"type":"all_different","vars":["r1c1","r1c2","r1c3","r1c4","r1c5","r1c6","r1c7","r1c8","r1c9"]},{"type":"all_different","vars":["r2c1","r2c2","r2c3","r2c4","r2c5","r2c6","r2c7","r2c8","r2c9"]},{"type":"all_different","vars":["r3c1","r3c2","r3c3","r3c4","r3c5","r3c6","r3c7","r3c8","r3c9"]},{"type":"all_different","var... | null | {"r9c9":"d2","r8c9":"d6","r7c9":"d3","r6c9":"d4","r5c9":"d1","r4c9":"d5","r3c9":"d8","r2c9":"d9","r1c9":"d7","r9c8":"d1","r8c8":"d2","r7c8":"d5","r6c8":"d3","r5c8":"d4","r4c8":"d6","r3c8":"d9","r2c8":"d7","r1c8":"d8","r9c7":"d4","r8c7":"d1","r7c7":"d2","r6c7":"d7","r5c7":"d3","r4c7":"d9","r3c7":"d5","r2c7":"d8","r1c7":... | benchmark/problems/xl_latin9.json |
xl_sched10x8 | scheduling | xl | 80 | true | null | false | null | 80 | 18 | [
"capacity",
"min_count"
] | Build a 8-day duty roster for 10 workers (w1..w10). For each worker
and each day decide 'on' or 'off' (variable w<worker>_d<day>). At least 2 workers
must be 'on' each day. No worker may work more than 6 days in total. | [
"w1_d1",
"w2_d1",
"w3_d1",
"w4_d1",
"w5_d1",
"w6_d1",
"w7_d1",
"w8_d1",
"w9_d1",
"w10_d1",
"w1_d2",
"w2_d2",
"w3_d2",
"w4_d2",
"w5_d2",
"w6_d2",
"w7_d2",
"w8_d2",
"w9_d2",
"w10_d2",
"w1_d3",
"w2_d3",
"w3_d3",
"w4_d3",
"w5_d3",
"w6_d3",
"w7_d3",
"w8_d3",
"w9_d3... | {"w1_d1":["on","off"],"w2_d1":["on","off"],"w3_d1":["on","off"],"w4_d1":["on","off"],"w5_d1":["on","off"],"w6_d1":["on","off"],"w7_d1":["on","off"],"w8_d1":["on","off"],"w9_d1":["on","off"],"w10_d1":["on","off"],"w1_d2":["on","off"],"w2_d2":["on","off"],"w3_d2":["on","off"],"w4_d2":["on","off"],"w5_d2":["on","off"],"w6... | [{"type":"min_count","value":"on","min":2,"vars":["w1_d1","w2_d1","w3_d1","w4_d1","w5_d1","w6_d1","w7_d1","w8_d1","w9_d1","w10_d1"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d2","w2_d2","w3_d2","w4_d2","w5_d2","w6_d2","w7_d2","w8_d2","w9_d2","w10_d2"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d3... | null | {"w1_d1":"off","w2_d1":"on","w3_d1":"on","w4_d1":"off","w5_d1":"off","w6_d1":"off","w7_d1":"off","w8_d1":"off","w9_d1":"off","w10_d1":"off","w1_d2":"on","w2_d2":"off","w3_d2":"off","w4_d2":"off","w5_d2":"off","w6_d2":"off","w7_d2":"off","w8_d2":"on","w9_d2":"off","w10_d2":"off","w1_d3":"off","w2_d3":"off","w3_d3":"off"... | benchmark/problems/xl_sched10x8.json |
xl_sched12x10 | scheduling | xl | 120 | true | null | false | null | 120 | 22 | [
"capacity",
"min_count"
] | Build a 10-day duty roster for 12 workers (w1..w12). For each worker
and each day decide 'on' or 'off' (variable w<worker>_d<day>). At least 2 workers
must be 'on' each day. No worker may work more than 8 days in total. | [
"w1_d1",
"w2_d1",
"w3_d1",
"w4_d1",
"w5_d1",
"w6_d1",
"w7_d1",
"w8_d1",
"w9_d1",
"w10_d1",
"w11_d1",
"w12_d1",
"w1_d2",
"w2_d2",
"w3_d2",
"w4_d2",
"w5_d2",
"w6_d2",
"w7_d2",
"w8_d2",
"w9_d2",
"w10_d2",
"w11_d2",
"w12_d2",
"w1_d3",
"w2_d3",
"w3_d3",
"w4_d3",
"w... | {"w1_d1":["on","off"],"w2_d1":["on","off"],"w3_d1":["on","off"],"w4_d1":["on","off"],"w5_d1":["on","off"],"w6_d1":["on","off"],"w7_d1":["on","off"],"w8_d1":["on","off"],"w9_d1":["on","off"],"w10_d1":["on","off"],"w11_d1":["on","off"],"w12_d1":["on","off"],"w1_d2":["on","off"],"w2_d2":["on","off"],"w3_d2":["on","off"],"... | [{"type":"min_count","value":"on","min":2,"vars":["w1_d1","w2_d1","w3_d1","w4_d1","w5_d1","w6_d1","w7_d1","w8_d1","w9_d1","w10_d1","w11_d1","w12_d1"]},{"type":"min_count","value":"on","min":2,"vars":["w1_d2","w2_d2","w3_d2","w4_d2","w5_d2","w6_d2","w7_d2","w8_d2","w9_d2","w10_d2","w11_d2","w12_d2"]},{"type":"min_count"... | null | {"w1_d1":"off","w2_d1":"off","w3_d1":"on","w4_d1":"on","w5_d1":"off","w6_d1":"off","w7_d1":"off","w8_d1":"off","w9_d1":"off","w10_d1":"off","w11_d1":"off","w12_d1":"off","w1_d2":"on","w2_d2":"on","w3_d2":"off","w4_d2":"off","w5_d2":"off","w6_d2":"off","w7_d2":"off","w8_d2":"off","w9_d2":"off","w10_d2":"off","w11_d2":"o... | benchmark/problems/xl_sched12x10.json |
xl_seat40_10x5 | seating | xl | 40 | true | null | false | null | 40 | 15 | [
"capacity",
"equal",
"not_equal"
] | Seat 40 guests (g1..g40) at tables ['t1', 't2', 't3', 't4', 't5', 't6', 't7', 't8', 't9', 't10'], each seating at most 5.
These pairs must sit at the SAME table: (g1,g2), (g3,g4), (g5,g6). These pairs must sit at DIFFERENT
tables: (g1,g7), (g2,g8). Assign every guest to exactly one table. | [
"g1",
"g2",
"g3",
"g4",
"g5",
"g6",
"g7",
"g8",
"g9",
"g10",
"g11",
"g12",
"g13",
"g14",
"g15",
"g16",
"g17",
"g18",
"g19",
"g20",
"g21",
"g22",
"g23",
"g24",
"g25",
"g26",
"g27",
"g28",
"g29",
"g30",
"g31",
"g32",
"g33",
"g34",
"g35",
"g36",
"... | {"g1":["t1","t2","t3","t4","t5","t6","t7","t8","t9","t10"],"g2":["t1","t2","t3","t4","t5","t6","t7","t8","t9","t10"],"g3":["t1","t2","t3","t4","t5","t6","t7","t8","t9","t10"],"g4":["t1","t2","t3","t4","t5","t6","t7","t8","t9","t10"],"g5":["t1","t2","t3","t4","t5","t6","t7","t8","t9","t10"],"g6":["t1","t2","t3","t4","t5... | [{"type":"capacity","value":"t1","max":5},{"type":"capacity","value":"t2","max":5},{"type":"capacity","value":"t3","max":5},{"type":"capacity","value":"t4","max":5},{"type":"capacity","value":"t5","max":5},{"type":"capacity","value":"t6","max":5},{"type":"capacity","value":"t7","max":5},{"type":"capacity","value":"t8",... | null | {"g8":"t8","g2":"t3","g7":"t6","g1":"t3","g6":"t8","g5":"t8","g4":"t3","g3":"t3","g9":"t5","g10":"t4","g11":"t4","g12":"t5","g13":"t5","g14":"t4","g15":"t1","g16":"t5","g17":"t5","g18":"t6","g19":"t4","g20":"t7","g21":"t7","g22":"t4","g23":"t8","g24":"t7","g25":"t6","g26":"t2","g27":"t10","g28":"t10","g29":"t1","g30":"... | benchmark/problems/xl_seat40_10x5.json |
xl_team30_5x8 | team_assignment | xl | 30 | true | null | false | null | 30 | 9 | [
"capacity",
"not_equal"
] | Assign 30 people (p1..p30) to the teams ['grp1', 'grp2', 'grp3', 'grp4', 'grp5']. Each team can hold at
most 8 people. The following pairs must NOT be on the same team: (p1,p2), (p3,p4), (p5,p6), (p7,p8).
Forbidden person/team placements: none. Give each person exactly one team. | [
"p1",
"p2",
"p3",
"p4",
"p5",
"p6",
"p7",
"p8",
"p9",
"p10",
"p11",
"p12",
"p13",
"p14",
"p15",
"p16",
"p17",
"p18",
"p19",
"p20",
"p21",
"p22",
"p23",
"p24",
"p25",
"p26",
"p27",
"p28",
"p29",
"p30"
] | {"p1":["grp1","grp2","grp3","grp4","grp5"],"p2":["grp1","grp2","grp3","grp4","grp5"],"p3":["grp1","grp2","grp3","grp4","grp5"],"p4":["grp1","grp2","grp3","grp4","grp5"],"p5":["grp1","grp2","grp3","grp4","grp5"],"p6":["grp1","grp2","grp3","grp4","grp5"],"p7":["grp1","grp2","grp3","grp4","grp5"],"p8":["grp1","grp2","grp3... | [{"type":"capacity","value":"grp1","max":8},{"type":"capacity","value":"grp2","max":8},{"type":"capacity","value":"grp3","max":8},{"type":"capacity","value":"grp4","max":8},{"type":"capacity","value":"grp5","max":8},{"type":"not_equal","a":"p1","b":"p2"},{"type":"not_equal","a":"p3","b":"p4"},{"type":"not_equal","a":"p... | null | {"p8":"grp3","p7":"grp1","p6":"grp1","p5":"grp2","p4":"grp1","p3":"grp3","p2":"grp1","p1":"grp3","p9":"grp5","p10":"grp5","p11":"grp1","p12":"grp5","p13":"grp4","p14":"grp5","p15":"grp4","p16":"grp4","p17":"grp4","p18":"grp4","p19":"grp5","p20":"grp4","p21":"grp1","p22":"grp2","p23":"grp1","p24":"grp2","p25":"grp1","p2... | benchmark/problems/xl_team30_5x8.json |
xl_tt20_6slot | timetabling | xl | 20 | true | null | false | null | 20 | 22 | [
"not_equal"
] | Schedule 20 courses (course1..course20) into time slots ['s1', 's2', 's3', 's4', 's5', 's6'].
Courses that share students or a room cannot be in the same slot. Conflicting pairs:
(course1,course2), (course2,course3), (course3,course4), (course4,course5), (course5,course6), (course6,course7), (course7,course8), (course8... | [
"course1",
"course2",
"course3",
"course4",
"course5",
"course6",
"course7",
"course8",
"course9",
"course10",
"course11",
"course12",
"course13",
"course14",
"course15",
"course16",
"course17",
"course18",
"course19",
"course20"
] | {"course1":["s1","s2","s3","s4","s5","s6"],"course2":["s1","s2","s3","s4","s5","s6"],"course3":["s1","s2","s3","s4","s5","s6"],"course4":["s1","s2","s3","s4","s5","s6"],"course5":["s1","s2","s3","s4","s5","s6"],"course6":["s1","s2","s3","s4","s5","s6"],"course7":["s1","s2","s3","s4","s5","s6"],"course8":["s1","s2","s3"... | [{"type":"not_equal","a":"course1","b":"course2"},{"type":"not_equal","a":"course2","b":"course3"},{"type":"not_equal","a":"course3","b":"course4"},{"type":"not_equal","a":"course4","b":"course5"},{"type":"not_equal","a":"course5","b":"course6"},{"type":"not_equal","a":"course6","b":"course7"},{"type":"not_equal","a":"... | null | {"course7":"s4","course4":"s6","course5":"s2","course2":"s1","course3":"s4","course1":"s2","course20":"s3","course19":"s1","course18":"s2","course17":"s1","course16":"s2","course15":"s1","course14":"s2","course13":"s4","course12":"s2","course11":"s3","course10":"s1","course9":"s5","course8":"s2","course6":"s1"} | benchmark/problems/xl_tt20_6slot.json |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.