Optimize a model with 23 rows, 253 columns and 506 nonzeros Presolve time: 0.00s Presolved: 23 rows, 253 columns, 506 nonzeros Variable types: 0 continuous, 253 integer (231 binary) Found heuristic solution: objective 752.0000000 Root relaxation: objective 5.400000e+02, 29 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 540.0000000 540.00000 0.0% - 0s Explored 0 nodes (29 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.400000000000e+02, best bound 5.400000000000e+02, gap 0.0% adding cut for [(5, 9), (5, 6), (6, 9)] adding cut for [(10, 11), (10, 14), (11, 14)] Optimize a model with 25 rows, 253 columns and 512 nonzeros Presolve time: 0.00s Presolved: 25 rows, 253 columns, 512 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 253 integer (231 binary) Found heuristic solution: objective 834.0000000 Root relaxation: objective 5.760000e+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 0 576.0000000 576.00000 0.0% - 0s Explored 0 nodes (33 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.760000000000e+02, best bound 5.760000000000e+02, gap 0.0% adding cut for [(5, 6), (5, 22), (6, 9), (9, 10), (10, 11), (11, 12)] Optimize a model with 26 rows, 253 columns and 533 nonzeros Presolve time: 0.00s Presolved: 26 rows, 253 columns, 533 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 253 integer (231 binary) Found heuristic solution: objective 870.0000000 Root relaxation: objective 5.760000e+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 0 576.0000000 576.00000 0.0% - 0s Explored 0 nodes (33 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.760000000000e+02, best bound 5.760000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 7), (3, 4), (4, 17), (7, 11), (11, 14), (12, 14), (15, 16), (15, 18), (16, 17), (18, 23), (19, 20), (20, 21), (21, 23)] adding cut for [(9, 10), (5, 9), (5, 6), (6, 10)] Optimize a model with 28 rows, 253 columns and 644 nonzeros Presolve time: 0.00s Presolved: 28 rows, 253 columns, 644 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 253 integer (231 binary) Found heuristic solution: objective 1761.0000000 Root relaxation: objective 5.760000e+02, 32 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 576.0000000 576.00000 0.0% - 0s Explored 0 nodes (32 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.760000000000e+02, best bound 5.760000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 7), (3, 4), (4, 17), (5, 6), (5, 22), (6, 9), (7, 11), (9, 10), (10, 11), (15, 16), (15, 18), (16, 17), (18, 23), (19, 20), (20, 21), (21, 23)] Optimize a model with 29 rows, 253 columns and 797 nonzeros Presolve time: 0.00s Presolved: 29 rows, 253 columns, 797 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 253 integer (231 binary) Found heuristic solution: objective 1761.0000000 Root relaxation: objective 5.770000e+02, 36 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 577.0000000 577.00000 0.0% - 0s Explored 0 nodes (36 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.770000000000e+02, best bound 5.770000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 7), (3, 4), (4, 17), (7, 14), (11, 14), (15, 16), (15, 18), (16, 17), (18, 23), (19, 20), (20, 21), (21, 23)] Optimize a model with 30 rows, 253 columns and 888 nonzeros Presolve time: 0.00s Presolved: 30 rows, 253 columns, 888 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 253 integer (231 binary) Found heuristic solution: objective 1761.0000000 Root relaxation: objective 5.770000e+02, 37 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 577.00000 0 10 1761.00000 577.00000 67.2% - 0s Another try with MIP start H 0 0 578.0000000 577.00000 0.17% - 0s Explored 0 nodes (39 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.780000000000e+02, best bound 5.770000000000e+02, gap 0.1730% adding cut for [(2, 3), (2, 7), (3, 4), (4, 17), (7, 14), (11, 12), (11, 14), (15, 16), (15, 18), (16, 17), (18, 23), (20, 21), (21, 23)] Optimize a model with 31 rows, 253 columns and 979 nonzeros Presolve time: 0.00s Presolved: 31 rows, 253 columns, 979 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 253 integer (231 binary) Found heuristic solution: objective 1761.0000000 Root relaxation: objective 5.775000e+02, 39 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 577.50000 0 10 1761.00000 577.50000 67.2% - 0s Another try with MIP start H 0 0 595.0000000 577.50000 2.94% - 0s H 0 0 578.0000000 577.50000 0.09% - 0s Explored 0 nodes (41 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.780000000000e+02, best bound 5.780000000000e+02, gap 0.0% adding cut for [(5, 6), (5, 22), (6, 9), (8, 22), (9, 10), (10, 11)] Optimize a model with 32 rows, 253 columns and 1000 nonzeros Presolve time: 0.00s Presolved: 32 rows, 253 columns, 1000 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 253 integer (231 binary) Found heuristic solution: objective 1761.0000000 Root relaxation: objective 5.780000e+02, 41 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 578.0000000 578.00000 0.0% - 0s Explored 0 nodes (41 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.780000000000e+02, best bound 5.780000000000e+02, gap 0.0% adding cut for [(11, 14), (12, 14)] Optimize a model with 33 rows, 253 columns and 1003 nonzeros Presolve time: 0.00s Presolved: 33 rows, 253 columns, 1003 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 253 integer (231 binary) Found heuristic solution: objective 1761.0000000 Root relaxation: objective 5.790000e+02, 40 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 579.00000 0 13 1761.00000 579.00000 67.1% - 0s Another try with MIP start H 0 0 582.0000000 579.00000 0.52% - 0s * 0 0 0 580.0000000 580.00000 0.0% - 0s Cutting planes: Gomory: 1 Zero half: 3 Explored 0 nodes (43 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.800000000000e+02, best bound 5.800000000000e+02, gap 0.0% adding cut for [(5, 6), (5, 9), (6, 10), (8, 9), (10, 11)] Optimize a model with 34 rows, 253 columns and 1018 nonzeros Presolve time: 0.00s Presolved: 34 rows, 253 columns, 1018 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 253 integer (231 binary) Found heuristic solution: objective 1761.0000000 Root relaxation: objective 5.790000e+02, 40 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 579.00000 0 13 1761.00000 579.00000 67.1% - 0s Another try with MIP start H 0 0 582.0000000 579.00000 0.52% - 0s 0 0 cutoff 0 582.00000 581.00058 0.17% - 0s Cutting planes: Gomory: 1 Zero half: 3 Explored 0 nodes (43 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.820000000000e+02, best bound 5.820000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 7), (3, 4), (4, 17), (5, 6), (5, 22), (6, 9), (7, 14), (9, 10), (10, 14), (15, 16), (15, 18), (16, 17), (18, 23), (19, 20), (20, 21), (21, 23)] Optimize a model with 35 rows, 253 columns and 1171 nonzeros Presolve time: 0.00s Presolved: 35 rows, 253 columns, 1171 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 253 integer (231 binary) Found heuristic solution: objective 1761.0000000 Root relaxation: objective 5.790000e+02, 40 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 579.00000 0 13 1761.00000 579.00000 67.1% - 0s Another try with MIP start H 0 0 584.0000000 579.00000 0.86% - 0s 0 0 580.87500 0 14 584.00000 580.87500 0.54% - 0s 0 0 580.87500 0 11 584.00000 580.87500 0.54% - 0s 0 0 581.00000 0 9 584.00000 581.00000 0.51% - 0s 0 0 582.40000 0 14 584.00000 582.40000 0.27% - 0s * 0 0 0 583.0000000 583.00000 0.0% - 0s Cutting planes: Gomory: 3 MIR: 3 Zero half: 8 Explored 0 nodes (82 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 5.830000000000e+02, best bound 5.830000000000e+02, gap 0.0% Gurobi 5.0.1 (linux64) logging started Fri Dec 7 08:09:03 2012