Optimize a model with 22 rows, 231 columns and 462 nonzeros Presolve time: 0.00s Presolved: 22 rows, 231 columns, 462 nonzeros Variable types: 0 continuous, 231 integer (210 binary) Found heuristic solution: objective 556.0000000 Root relaxation: objective 3.865000e+02, 22 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 386.50000 0 6 556.00000 386.50000 30.5% - 0s H 0 0 421.0000000 386.50000 8.19% - 0s * 0 0 0 387.0000000 387.00000 0.0% - 0s Cutting planes: Gomory: 2 MIR: 8 Zero half: 2 Explored 0 nodes (25 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.870000000000e+02, best bound 3.870000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 4), (3, 7), (4, 5), (5, 9), (7, 9)] adding cut for [(16, 19), (18, 21), (18, 22), (19, 21), (20, 22)] adding cut for [(8, 10), (6, 8), (6, 10)] Optimize a model with 25 rows, 231 columns and 495 nonzeros Presolve time: 0.00s Presolved: 25 rows, 231 columns, 495 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 231 integer (210 binary) Found heuristic solution: objective 734.0000000 Root relaxation: objective 3.960000e+02, 27 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 396.0000000 396.00000 0.0% - 0s Explored 0 nodes (27 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.960000000000e+02, best bound 3.960000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 7), (6, 8), (7, 9), (8, 10), (9, 11), (10, 11)] adding cut for [(18, 21), (18, 22), (19, 21), (20, 22)] Optimize a model with 27 rows, 231 columns and 550 nonzeros Presolve time: 0.00s Presolved: 27 rows, 231 columns, 550 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 231 integer (210 binary) Found heuristic solution: objective 1097.0000000 Root relaxation: objective 3.980000e+02, 28 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 398.0000000 398.00000 0.0% - 0s Explored 0 nodes (28 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.980000000000e+02, best bound 3.980000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 8), (7, 9), (7, 10), (8, 10), (9, 12)] adding cut for [(16, 19), (19, 21), (20, 22), (21, 22)] Optimize a model with 29 rows, 231 columns and 605 nonzeros Presolve time: 0.00s Presolved: 29 rows, 231 columns, 605 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 231 integer (210 binary) Found heuristic solution: objective 1097.0000000 Root relaxation: objective 4.180000e+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 418.0000000 418.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 4.180000000000e+02, best bound 4.180000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 8), (8, 10)] adding cut for [(18, 21), (20, 22), (14, 20), (21, 22)] Optimize a model with 31 rows, 231 columns and 643 nonzeros Presolve time: 0.00s Presolved: 31 rows, 231 columns, 643 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 231 integer (210 binary) Found heuristic solution: objective 1097.0000000 Root relaxation: objective 4.190000e+02, 30 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 419.0000000 419.00000 0.0% - 0s Explored 0 nodes (30 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.190000000000e+02, best bound 4.190000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 7), (3, 6), (4, 5), (4, 7), (5, 12), (6, 8), (8, 10), (12, 14)] Optimize a model with 32 rows, 231 columns and 688 nonzeros Presolve time: 0.00s Presolved: 32 rows, 231 columns, 688 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 231 integer (210 binary) Found heuristic solution: objective 1097.0000000 Root relaxation: objective 4.200000e+02, 35 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 420.0000000 420.00000 0.0% - 0s Explored 0 nodes (35 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.200000000000e+02, best bound 4.200000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 7), (3, 6), (4, 5), (4, 7), (5, 12), (6, 8), (8, 10)] Optimize a model with 33 rows, 231 columns and 724 nonzeros Presolve time: 0.00s Presolved: 33 rows, 231 columns, 724 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 231 integer (210 binary) Found heuristic solution: objective 1097.0000000 Root relaxation: objective 4.210000e+02, 35 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 421.0000000 421.00000 0.0% - 0s Explored 0 nodes (35 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.210000000000e+02, best bound 4.210000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 7), (6, 8), (7, 9), (8, 10)] Optimize a model with 34 rows, 231 columns and 760 nonzeros Presolve time: 0.00s Presolved: 34 rows, 231 columns, 760 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 231 integer (210 binary) Found heuristic solution: objective 1097.0000000 Root relaxation: objective 4.225000e+02, 35 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 422.50000 0 6 1097.00000 422.50000 61.5% - 0s Another try with MIP start * 0 0 0 424.0000000 424.00000 0.0% - 0s Cutting planes: Gomory: 1 Zero half: 3 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 4.240000000000e+02, best bound 4.240000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 7), (6, 8), (7, 11), (8, 10)] Optimize a model with 35 rows, 231 columns and 796 nonzeros Presolve time: 0.00s Presolved: 35 rows, 231 columns, 796 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 231 integer (210 binary) Found heuristic solution: objective 1097.0000000 Root relaxation: objective 4.225000e+02, 35 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 422.50000 0 6 1097.00000 422.50000 61.5% - 0s Another try with MIP start 0 0 424.00000 0 13 1097.00000 424.00000 61.3% - 0s H 0 0 455.0000000 424.00000 6.81% - 0s 0 0 425.00000 0 11 455.00000 425.00000 6.59% - 0s * 0 0 0 425.0000000 425.00000 0.0% - 0s Cutting planes: Gomory: 3 Zero half: 3 Explored 0 nodes (47 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.250000000000e+02, best bound 4.250000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 7), (3, 6), (6, 8), (7, 11), (8, 10)] Optimize a model with 36 rows, 231 columns and 817 nonzeros Presolve time: 0.00s Presolved: 36 rows, 231 columns, 817 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 231 integer (210 binary) Found heuristic solution: objective 1097.0000000 Root relaxation: objective 4.225000e+02, 35 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 422.50000 0 6 1097.00000 422.50000 61.5% - 0s Another try with MIP start 0 0 424.00000 0 13 1097.00000 424.00000 61.3% - 0s H 0 0 430.0000000 424.00000 1.40% - 0s 0 0 425.00000 0 11 430.00000 425.00000 1.16% - 0s 0 0 425.00000 0 6 430.00000 425.00000 1.16% - 0s 0 0 425.40000 0 14 430.00000 425.40000 1.07% - 0s 0 0 425.66667 0 13 430.00000 425.66667 1.01% - 0s H 0 0 428.0000000 425.66667 0.55% - 0s * 0 0 0 426.0000000 426.00000 0.0% - 0s Cutting planes: Gomory: 3 Zero half: 3 Mod-K: 1 Explored 0 nodes (86 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.260000000000e+02, best bound 4.260000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 7), (6, 8), (8, 10)] Optimize a model with 37 rows, 231 columns and 845 nonzeros Presolve time: 0.00s Presolved: 37 rows, 231 columns, 845 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 231 integer (210 binary) Found heuristic solution: objective 1097.0000000 Root relaxation: objective 4.225000e+02, 35 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 422.50000 0 6 1097.00000 422.50000 61.5% - 0s Another try with MIP start 0 0 424.50000 0 12 1097.00000 424.50000 61.3% - 0s H 0 0 489.0000000 424.50000 13.2% - 0s 0 0 424.50000 0 14 489.00000 424.50000 13.2% - 0s 0 0 425.20000 0 19 489.00000 425.20000 13.0% - 0s 0 0 425.80000 0 18 489.00000 425.80000 12.9% - 0s 0 0 426.00000 0 8 489.00000 426.00000 12.9% - 0s 0 0 426.00000 0 14 489.00000 426.00000 12.9% - 0s H 0 0 427.0000000 426.00000 0.23% - 0s 0 0 cutoff 0 427.00000 426.00043 0.23% - 0s Explored 0 nodes (62 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.270000000000e+02, best bound 4.270000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 7), (3, 6), (6, 8), (7, 9), (8, 10), (9, 11)] Optimize a model with 38 rows, 231 columns and 873 nonzeros Presolve time: 0.00s Presolved: 38 rows, 231 columns, 873 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 231 integer (210 binary) Found heuristic solution: objective 1097.0000000 Root relaxation: objective 4.225000e+02, 34 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 422.50000 0 6 1097.00000 422.50000 61.5% - 0s Another try with MIP start H 0 0 519.0000000 422.50000 18.6% - 0s 0 0 424.50000 0 12 519.00000 424.50000 18.2% - 0s 0 0 424.50000 0 14 519.00000 424.50000 18.2% - 0s 0 0 425.20000 0 19 519.00000 425.20000 18.1% - 0s 0 0 425.46667 0 21 519.00000 425.46667 18.0% - 0s 0 0 426.00000 0 12 519.00000 426.00000 17.9% - 0s 0 0 426.00000 0 8 519.00000 426.00000 17.9% - 0s 0 0 426.00000 0 12 519.00000 426.00000 17.9% - 0s 0 0 426.00000 0 12 519.00000 426.00000 17.9% - 0s H 0 0 429.0000000 426.00000 0.70% - 0s 0 0 426.00000 0 7 429.00000 426.00000 0.70% - 0s 0 0 426.00000 0 9 429.00000 426.00000 0.70% - 0s H 0 0 427.0000000 426.00000 0.23% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (83 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.270000000000e+02, best bound 4.270000000000e+02, gap 0.0% adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 8), (7, 8), (7, 9), (9, 11), (12, 14)] Optimize a model with 39 rows, 231 columns and 928 nonzeros Presolve time: 0.00s Presolved: 39 rows, 231 columns, 928 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 231 integer (210 binary) Found heuristic solution: objective 1097.0000000 Root relaxation: objective 4.230000e+02, 34 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 423.00000 0 14 1097.00000 423.00000 61.4% - 0s Another try with MIP start H 0 0 428.0000000 423.00000 1.17% - 0s 0 0 425.50000 0 25 428.00000 425.50000 0.58% - 0s * 0 0 0 427.0000000 427.00000 0.0% - 0s Explored 0 nodes (66 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 4.270000000000e+02, best bound 4.270000000000e+02, gap 0.0% Gurobi 5.0.1 (linux64) logging started Fri Dec 7 08:09:03 2012