Optimize a model with 30 rows, 435 columns and 870 nonzeros
Presolve time: 0.00s
Presolved: 30 rows, 435 columns, 870 nonzeros
Variable types: 0 continuous, 435 integer (406 binary)
adding cut for [(8, 29), (8, 30), (7, 29), (7, 30)]
adding cut for [(9, 27), (9, 28), (10, 27), (10, 28)]
adding cut for [(11, 25), (11, 26), (12, 25), (12, 26)]
adding cut for [(13, 24), (13, 23), (14, 24), (14, 23)]
adding cut for [(16, 21), (16, 22), (15, 21), (15, 22)]
adding cut for [(17, 19), (17, 20), (18, 19), (18, 20)]

Root relaxation: objective 4.040000e+02, 33 iterations, 0.00 seconds

    Nodes    |    Current Node    |     Objective Bounds      |     Work
 Expl Unexpl |  Obj  Depth IntInf | Incumbent    BestBd   Gap | It/Node Time

     0     0  404.00000    0    6          -  404.00000     -      -    0s
adding cut for [(8, 14), (8, 18), (9, 13), (9, 15), (10, 15), (10, 18), (11, 12), (11, 16), (12, 13), (14, 17), (16, 17)]
adding cut for [(25, 26), (25, 30), (26, 30)]
     0     0  434.50000    0    6          -  434.50000     -      -    0s
     0     0  435.50000    0   12          -  435.50000     -      -    0s
     0     0  436.00000    0   12          -  436.00000     -      -    0s
     0     0  436.50000    0   23          -  436.50000     -      -    0s
     0     0  436.50000    0   12          -  436.50000     -      -    0s
adding cut for [(2, 7), (2, 25), (3, 6), (4, 5), (4, 7), (5, 6), (25, 26), (26, 30), (27, 29), (28, 29), (28, 30)]
adding cut for [(9, 10), (9, 15), (10, 15)]
adding cut for [(20, 21), (20, 23), (21, 23)]
     0     2  436.50000    0   12          -  436.50000     -      -    0s
adding cut for [(2, 7), (2, 25), (3, 6), (3, 23), (4, 21), (4, 23), (5, 6), (5, 7), (21, 27), (25, 26), (26, 30), (27, 29), (28, 29), (28, 30)]
adding cut for [(8, 14), (8, 18), (9, 13), (9, 15), (10, 15), (10, 18), (12, 13), (12, 16), (14, 17), (16, 17)]
adding cut for [(2, 7), (2, 25), (3, 6), (3, 23), (4, 20), (4, 23), (5, 6), (5, 7), (20, 27), (25, 26), (26, 30), (27, 29), (28, 29), (28, 30)]
adding cut for [(2, 7), (2, 25), (3, 6), (3, 23), (4, 23), (5, 6), (5, 7), (25, 26), (26, 30), (27, 29), (28, 29), (28, 30)]
adding cut for [(8, 14), (8, 18), (9, 10), (9, 15), (10, 18), (11, 12), (12, 13), (13, 16), (14, 17), (15, 22), (16, 17)]
adding cut for [(2, 7), (2, 25), (3, 6), (3, 23), (5, 6), (5, 7), (25, 26), (26, 30), (27, 29), (28, 29), (28, 30)]
adding cut for [(20, 21), (4, 20), (4, 21)]
adding cut for [(2, 25), (2, 7), (7, 25)]
adding cut for [(3, 5), (3, 6), (5, 6)]
adding cut for [(26, 28), (26, 30), (28, 30)]
adding cut for [(2, 7), (2, 25), (3, 6), (3, 21), (4, 20), (4, 23), (5, 6), (5, 7), (20, 21), (25, 26), (26, 30), (27, 29), (28, 29), (28, 30)]
adding cut for [(2, 7), (2, 25), (3, 6), (3, 21), (5, 6), (5, 7), (25, 26), (26, 30), (27, 29), (28, 29), (28, 30)]
adding cut for [(2, 7), (2, 25), (3, 6), (5, 6), (5, 7), (20, 27), (25, 26), (26, 30), (27, 29), (28, 29), (28, 30)]
adding cut for [(2, 7), (2, 25), (3, 6), (5, 6), (5, 7), (25, 26), (26, 30), (27, 29), (28, 29), (28, 30)]
*    3     3               2     521.0000000  502.00000  3.65%  12.3    0s

Cutting planes:
  MIR: 2
  Zero half: 3

Explored 7 nodes (119 simplex iterations) in 0.03 seconds
Thread count was 1 (of 16 available processors)

Optimal solution found (tolerance 1.00e-04)
Best objective 5.210000000000e+02, best bound 5.210000000000e+02, gap 0.0%

Gurobi 5.0.1 (linux64) logging started Fri Dec  7 08:09:04 2012