Gurobi 5.0.1 (linux64) logging started Fri Nov 16 02:13:46 2012 Optimize a model with 8160 rows, 1056 columns and 25408 nonzeros Presolve time: 0.07s Presolved: 8160 rows, 1056 columns, 31818 nonzeros Variable types: 0 continuous, 1056 integer (1056 binary) Found heuristic solution: objective 22.0000000 Root relaxation: objective 2.000000e+00, 2820 iterations, 0.19 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2.00000 0 64 22.00000 2.00000 90.9% - 0s H 0 0 12.0000000 2.00000 83.3% - 0s H 0 0 10.0000000 2.00000 80.0% - 0s 0 0 2.00000 0 64 10.00000 2.00000 80.0% - 0s H 0 0 9.0000000 2.00000 77.8% - 0s 0 0 2.00000 0 64 9.00000 2.00000 77.8% - 0s 0 0 2.00000 0 64 9.00000 2.00000 77.8% - 0s 0 0 2.00000 0 64 9.00000 2.00000 77.8% - 0s 0 0 2.00000 0 64 9.00000 2.00000 77.8% - 0s 0 0 2.00000 0 64 9.00000 2.00000 77.8% - 0s 0 2 2.00000 0 64 9.00000 2.00000 77.8% - 1s H 27 25 8.0000000 3.00000 62.5% 394 3s 45 33 5.00000 7 67 8.00000 3.00000 62.5% 535 5s 82 54 6.11111 5 138 8.00000 3.00000 62.5% 566 10s 208 106 6.00000 11 89 8.00000 3.50000 56.2% 375 15s 318 130 cutoff 15 8.00000 4.00000 50.0% 343 20s 413 158 6.00000 19 54 8.00000 4.00000 50.0% 301 25s 579 228 5.00000 9 109 8.00000 4.50000 43.8% 260 30s 607 238 7.00000 9 64 8.00000 7.00000 12.5% 282 35s 614 245 7.00000 20 90 8.00000 7.00000 12.5% 301 40s 634 250 7.00000 29 90 8.00000 7.00000 12.5% 303 45s 690 233 7.00000 26 70 8.00000 7.00000 12.5% 313 50s 761 208 infeasible 31 8.00000 7.00000 12.5% 327 55s 834 186 7.00000 29 79 8.00000 7.00000 12.5% 340 60s 911 164 7.00000 29 85 8.00000 7.00000 12.5% 346 65s 1006 131 7.00000 28 86 8.00000 7.00000 12.5% 348 70s 1098 98 7.00000 29 75 8.00000 7.00000 12.5% 350 75s 1162 79 7.00000 29 82 8.00000 7.00000 12.5% 359 80s 1219 63 7.00000 26 107 8.00000 7.00000 12.5% 371 85s 1294 51 7.00000 29 100 8.00000 7.00000 12.5% 374 90s 1383 39 7.00000 24 131 8.00000 7.00000 12.5% 375 95s 1474 42 infeasible 35 8.00000 7.00000 12.5% 377 100s 1557 45 7.00000 27 108 8.00000 7.00000 12.5% 382 105s 1635 39 7.00000 25 84 8.00000 7.00000 12.5% 387 110s 1717 43 infeasible 27 8.00000 7.00000 12.5% 392 115s 1810 40 infeasible 27 8.00000 7.00000 12.5% 394 120s 1895 37 infeasible 27 8.00000 7.00000 12.5% 397 125s 1979 29 7.00000 25 52 8.00000 7.00000 12.5% 400 130s 2062 31 7.00000 27 67 8.00000 7.00000 12.5% 400 135s 2156 27 infeasible 29 8.00000 7.00000 12.5% 400 140s 2257 27 7.00000 28 69 8.00000 7.00000 12.5% 399 145s 2339 25 7.00000 27 97 8.00000 7.00000 12.5% 402 150s 2439 19 7.00000 32 40 8.00000 7.00000 12.5% 401 155s 2509 17 7.00000 25 64 8.00000 7.00000 12.5% 406 160s 2585 21 infeasible 31 8.00000 7.00000 12.5% 410 165s 2634 16 infeasible 29 8.00000 7.00000 12.5% 417 170s 2709 15 infeasible 30 8.00000 7.00000 12.5% 420 175s 2790 12 infeasible 27 8.00000 7.00000 12.5% 422 180s 2859 9 7.00000 34 76 8.00000 7.00000 12.5% 424 185s 2919 7 7.00000 31 156 8.00000 7.00000 12.5% 426 190s 3001 9 infeasible 33 8.00000 7.00000 12.5% 427 195s 3053 5 7.00000 31 189 8.00000 7.00000 12.5% 431 200s Explored 3065 nodes (1323599 simplex iterations) in 200.79 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.000000000000e+00, best bound 8.000000000000e+00, gap 0.0%