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) Found heuristic solution: objective 2170.0000000 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 2170.00000 404.00000 81.4% - 0s H 0 0 434.0000000 404.00000 6.91% - 0s * 0 0 0 404.0000000 404.00000 0.0% - 0s Cutting planes: MIR: 6 Zero half: 1 Explored 0 nodes (37 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.040000000000e+02, best bound 4.040000000000e+02, gap 0.0% 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), (2, 25), (2, 7), (26, 30), (7, 30)] adding cut for [(3, 4), (3, 6), (4, 5), (5, 6)] adding cut for [(27, 28), (27, 29), (28, 29)] Optimize a model with 34 rows, 435 columns and 944 nonzeros Presolve time: 0.00s Presolved: 34 rows, 435 columns, 944 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 435 integer (406 binary) Found heuristic solution: objective 2170.0000000 Root relaxation: objective 4.365000e+02, 43 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 436.50000 0 6 2170.00000 436.50000 79.9% - 0s Another try with MIP start H 0 0 540.0000000 436.50000 19.2% - 0s 0 0 436.50000 0 14 540.00000 436.50000 19.2% - 0s 0 0 438.00000 0 14 540.00000 438.00000 18.9% - 0s 0 0 438.00000 0 22 540.00000 438.00000 18.9% - 0s 0 0 438.00000 0 10 540.00000 438.00000 18.9% - 0s H 0 0 457.0000000 438.00000 4.16% - 0s H 0 0 454.0000000 438.00000 3.52% - 0s 0 0 438.00000 0 10 454.00000 438.00000 3.52% - 0s H 0 0 443.0000000 438.00000 1.13% - 0s H 0 0 440.0000000 438.00000 0.45% - 0s Cutting planes: Gomory: 1 Zero half: 2 Explored 0 nodes (100 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.400000000000e+02, best bound 4.400000000000e+02, gap 0.0% adding cut for [(2, 7), (2, 25), (4, 7), (4, 27), (25, 26), (26, 30), (27, 29), (28, 29), (28, 30)] adding cut for [(3, 5), (3, 6), (5, 6)] Optimize a model with 36 rows, 435 columns and 983 nonzeros Presolve time: 0.00s Presolved: 36 rows, 435 columns, 983 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 435 integer (406 binary) Found heuristic solution: objective 2170.0000000 Root relaxation: objective 4.385000e+02, 45 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 438.50000 0 6 2170.00000 438.50000 79.8% - 0s Another try with MIP start H 0 0 442.0000000 438.50000 0.79% - 0s 0 0 infeasible 0 442.00000 441.00044 0.23% - 0s Cutting planes: Cover: 1 Clique: 2 MIR: 4 GUB cover: 1 Explored 0 nodes (50 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.420000000000e+02, best bound 4.420000000000e+02, gap 0.0% adding cut for [(2, 6), (2, 7), (3, 5), (3, 6), (4, 5), (4, 27), (7, 25), (25, 26), (26, 30), (27, 29), (28, 29), (28, 30)] Optimize a model with 37 rows, 435 columns and 1049 nonzeros Presolve time: 0.00s Presolved: 37 rows, 435 columns, 1049 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 435 integer (406 binary) Found heuristic solution: objective 2170.0000000 Root relaxation: objective 4.770000e+02, 47 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 477.0000000 477.00000 0.0% - 0s Explored 0 nodes (47 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.770000000000e+02, best bound 4.770000000000e+02, gap 0.0% 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)] Optimize a model with 39 rows, 435 columns and 1185 nonzeros Presolve time: 0.00s Presolved: 39 rows, 435 columns, 1185 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 435 integer (406 binary) Found heuristic solution: objective 2170.0000000 Root relaxation: objective 4.860000e+02, 51 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 486.0000000 486.00000 0.0% - 0s Explored 0 nodes (51 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.860000000000e+02, best bound 4.860000000000e+02, gap 0.0% 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)] Optimize a model with 40 rows, 435 columns and 1276 nonzeros Presolve time: 0.00s Presolved: 40 rows, 435 columns, 1276 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 435 integer (406 binary) Found heuristic solution: objective 2170.0000000 Root relaxation: objective 4.900000e+02, 52 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 490.0000000 490.00000 0.0% - 0s Explored 0 nodes (52 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.900000000000e+02, best bound 4.900000000000e+02, gap 0.0% 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 [(11, 12), (11, 13), (12, 13)] Optimize a model with 42 rows, 435 columns and 1357 nonzeros Presolve time: 0.00s Presolved: 42 rows, 435 columns, 1357 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 435 integer (406 binary) Found heuristic solution: objective 2170.0000000 Root relaxation: objective 4.990000e+02, 52 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 499.0000000 499.00000 0.0% - 0s Explored 0 nodes (52 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.990000000000e+02, best bound 4.990000000000e+02, gap 0.0% 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)] Optimize a model with 44 rows, 435 columns and 1426 nonzeros Presolve time: 0.00s Presolved: 44 rows, 435 columns, 1426 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 435 integer (406 binary) Found heuristic solution: objective 2170.0000000 Root relaxation: objective 5.020000e+02, 55 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 502.0000000 502.00000 0.0% - 0s Explored 0 nodes (55 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.020000000000e+02, best bound 5.020000000000e+02, gap 0.0% adding cut for [(2, 7), (2, 25), (3, 6), (4, 21), (4, 23), (5, 6), (5, 7), (20, 21), (20, 27), (25, 26), (26, 30), (27, 29), (28, 29), (28, 30)] Optimize a model with 45 rows, 435 columns and 1531 nonzeros Presolve time: 0.00s Presolved: 45 rows, 435 columns, 1531 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 435 integer (406 binary) Found heuristic solution: objective 2170.0000000 Root relaxation: objective 5.030000e+02, 56 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 503.0000000 503.00000 0.0% - 0s Explored 0 nodes (56 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.030000000000e+02, best bound 5.030000000000e+02, gap 0.0% 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 [(8, 14), (8, 18), (9, 10), (9, 15), (10, 18), (11, 12), (12, 13), (13, 16), (14, 17), (15, 22), (16, 17)] Optimize a model with 47 rows, 435 columns and 1663 nonzeros Presolve removed 1 rows and 0 columns Presolve time: 0.00s Presolved: 46 rows, 435 columns, 1608 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 435 integer (406 binary) Found heuristic solution: objective 2170.0000000 Root relaxation: objective 5.100000e+02, 55 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 510.0000000 510.00000 0.0% - 0s Explored 0 nodes (55 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.100000000000e+02, best bound 5.100000000000e+02, gap 0.0% 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)] Optimize a model with 48 rows, 435 columns and 1729 nonzeros Presolve removed 1 rows and 0 columns Presolve time: 0.00s Presolved: 47 rows, 435 columns, 1674 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 435 integer (406 binary) Found heuristic solution: objective 2170.0000000 Root relaxation: objective 5.110000e+02, 57 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 511.0000000 511.00000 0.0% - 0s Explored 0 nodes (57 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.110000000000e+02, best bound 5.110000000000e+02, gap 0.0% adding cut for [(2, 7), (2, 25), (3, 6), (5, 6), (5, 7), (25, 26), (26, 30), (27, 29), (28, 29), (28, 30)] Optimize a model with 49 rows, 435 columns and 1784 nonzeros Presolve removed 1 rows and 0 columns Presolve time: 0.00s Presolved: 48 rows, 435 columns, 1729 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 435 integer (406 binary) Found heuristic solution: objective 2170.0000000 Root relaxation: objective 5.190000e+02, 57 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 519.00000 0 6 2170.00000 519.00000 76.1% - 0s Another try with MIP start H 0 0 532.0000000 519.00000 2.44% - 0s * 0 0 0 520.0000000 520.00000 0.0% - 0s Cutting planes: Gomory: 1 Zero half: 2 Explored 0 nodes (65 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.200000000000e+02, best bound 5.200000000000e+02, gap 0.0% adding cut for [(2, 25), (2, 7), (7, 25)] adding cut for [(26, 28), (26, 30), (28, 30)] Optimize a model with 51 rows, 435 columns and 1790 nonzeros Presolve removed 1 rows and 0 columns Presolve time: 0.00s Presolved: 50 rows, 435 columns, 1735 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 435 integer (406 binary) Found heuristic solution: objective 2170.0000000 Root relaxation: objective 5.190000e+02, 56 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 519.00000 0 6 2170.00000 519.00000 76.1% - 0s Another try with MIP start 0 0 520.50000 0 10 2170.00000 520.50000 76.0% - 0s H 0 0 732.0000000 520.50000 28.9% - 0s 0 0 520.75000 0 13 732.00000 520.75000 28.9% - 0s 0 0 520.80000 0 14 732.00000 520.80000 28.9% - 0s 0 0 520.83333 0 15 732.00000 520.83333 28.8% - 0s 0 0 521.00000 0 17 732.00000 521.00000 28.8% - 0s * 0 0 0 521.0000000 521.00000 0.0% - 0s Cutting planes: Gomory: 1 Zero half: 5 Explored 0 nodes (74 simplex iterations) in 0.01 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