Gurobi 5.0.1 (linux64) logging started Fri Nov 16 02:02:18 2012 Optimize a model with 7471 rows, 992 columns and 23281 nonzeros Presolve time: 0.06s Presolved: 7471 rows, 992 columns, 29917 nonzeros Variable types: 0 continuous, 992 integer (992 binary) Found heuristic solution: objective 20.0000000 Root relaxation: objective 2.000000e+00, 85 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2.00000 0 62 20.00000 2.00000 90.0% - 0s H 0 0 11.0000000 2.00000 81.8% - 0s H 0 0 9.0000000 2.00000 77.8% - 0s 0 0 2.00000 0 62 9.00000 2.00000 77.8% - 0s 0 0 2.00000 0 62 9.00000 2.00000 77.8% - 0s 0 0 2.00000 0 62 9.00000 2.00000 77.8% - 1s 0 0 2.00000 0 62 9.00000 2.00000 77.8% - 1s 0 0 2.00000 0 62 9.00000 2.00000 77.8% - 2s 0 0 2.00000 0 62 9.00000 2.00000 77.8% - 2s 0 2 2.00000 0 62 9.00000 2.00000 77.8% - 4s 2 4 3.00000 1 58 9.00000 3.00000 66.7% 1972 5s H 27 23 8.0000000 3.00000 62.5% 570 6s * 34 16 22 7.0000000 3.00000 57.1% 463 6s 93 25 cutoff 12 7.00000 4.00000 42.9% 441 10s 198 52 cutoff 10 7.00000 4.00000 42.9% 388 15s 327 77 5.50000 9 82 7.00000 4.66667 33.3% 355 20s 445 89 cutoff 10 7.00000 5.00000 28.6% 328 25s 578 111 6.00000 13 117 7.00000 5.00000 28.6% 304 32s 603 116 6.00000 10 92 7.00000 6.00000 14.3% 306 35s 609 122 6.00000 9 62 7.00000 6.00000 14.3% 343 40s 614 127 6.00000 29 163 7.00000 6.00000 14.3% 367 47s 616 129 6.00000 30 118 7.00000 6.00000 14.3% 367 50s 621 130 6.00000 32 187 7.00000 6.00000 14.3% 370 56s 638 127 6.00000 30 143 7.00000 6.00000 14.3% 376 60s 682 117 infeasible 38 7.00000 6.00000 14.3% 367 65s 893 55 6.00000 45 130 7.00000 6.00000 14.3% 325 70s 1064 11 infeasible 38 7.00000 6.00000 14.3% 307 75s 1121 24 6.00000 48 106 7.00000 6.00000 14.3% 307 80s 1199 24 6.00000 39 155 7.00000 6.00000 14.3% 312 85s 1248 21 infeasible 44 7.00000 6.00000 14.3% 322 90s 1329 28 6.00000 43 90 7.00000 6.00000 14.3% 323 95s 1391 32 6.00000 46 93 7.00000 6.00000 14.3% 331 100s 1473 22 infeasible 42 7.00000 6.00000 14.3% 330 105s 1513 24 infeasible 40 7.00000 6.00000 14.3% 331 110s 1547 28 6.00000 44 128 7.00000 6.00000 14.3% 333 115s 1585 26 infeasible 40 7.00000 6.00000 14.3% 336 120s 1641 24 infeasible 41 7.00000 6.00000 14.3% 338 125s 1663 26 6.00000 43 179 7.00000 6.00000 14.3% 338 130s 1694 21 6.00000 38 89 7.00000 6.00000 14.3% 340 135s 1752 19 infeasible 39 7.00000 6.00000 14.3% 341 140s 1821 16 6.00000 44 94 7.00000 6.00000 14.3% 340 145s 1891 22 6.00000 47 113 7.00000 6.00000 14.3% 338 150s 1932 17 6.00000 39 122 7.00000 6.00000 14.3% 339 155s 1972 7 6.00000 40 90 7.00000 6.00000 14.3% 342 160s 2010 15 infeasible 35 7.00000 6.00000 14.3% 344 165s 2032 11 6.00000 44 147 7.00000 6.00000 14.3% 346 170s 2062 5 infeasible 35 7.00000 6.00000 14.3% 346 175s 2092 9 infeasible 40 7.00000 6.00000 14.3% 351 181s 2113 6 6.00000 37 114 7.00000 6.00000 14.3% 352 185s 2136 1 infeasible 37 7.00000 6.00000 14.3% 355 190s Explored 2142 nodes (770991 simplex iterations) in 190.87 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 7.000000000000e+00, best bound 7.000000000000e+00, gap 0.0%