The quality of a solution to an integer programming problem is a function of a number of elements. Lightly constrained problems are easier to solve than those with tighter constraints. Local search methods generally perform better than greedy methods. In the companion paper to this one, the...