Presolve eliminates 33 constraints and 660 variables. Adjusted problem: 6720 variables, all binary 11076 constraints, all linear; 39018 nonzeros 1 linear objective; 20 nonzeros. CPLEX 8.1.0: clocktype = 2 timing=1 mipdisplay=2 mipstartvalue=1 Clique table members: 9760 MIP emphasis: balance optimality and feasibility Root relaxation solution time = 32.48 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 5.7792 2471 5.7792 6163 5.7792 3043 Cuts: 824 14358 Heuristic still looking Heuristic still looking Heuristic still looking Heuristic complete 100 68 5.8507 1373 5.7792 277894 200 136 5.7922 1640 5.7792 402543 300 206 5.7926 1600 5.7792 814101 (cplex) GUB cover cuts applied: 52 Clique cuts applied: 368 Cover cuts applied: 92 Times (seconds): Input = 0.18 Solve = 9163.33 Output = 0.02 CPLEX 8.1.0: aborted, no integer solution. 978665 MIP simplex iterations 340 branch-and-bound nodes; no basis.