Uniform Random Binary Problem:

This is the modules for generating instances of the uniform random binary problems:

• Setup-random-binary-problems; build a random binary CSP.
• LoadGFile; load an instance generated and salved previously.
• WriteGFile; save an instance generated

This is the modules for static ordering of variables. We consider three heuristics for static ordering of variables:

• The minimum width heuristic, orders the variables from last to first by selecting, at each stage, a node in the constraint graph which has a minimal degree in the graph remaining after deleting from the graph all nodes which have been selected already. As its name indicates, the heuristic results in a minimum width ordering.
• The max-degree heuristic orders the variables in a decreasing order of their degrees in the constraint graph. This heuristic also aims at finding a minimum-width ordering.
• The third heuristic is the max-cardinality search ordering. This ordering selects the first variable arbitrarily, then, at each stage it appends to the selected variables one which is connected to the largest group among the variables already selected.

from: Dechter, R., Pearl, J. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence, 34:1-38, 1988.

This is an example for the random binary problems.

Graph coloring problem:

This is the modules for generating instances of the uniform random binary problems:

• Setup-random-graph ;
• LoadGFile; load an instance generated and salved previously.
• WriteGFile; save an instance generated
  

This is an example for the graph coloring problem.