Optimize a model with 13 rows, 78 columns and 156 nonzeros Presolve time: 0.00s Presolved: 13 rows, 78 columns, 156 nonzeros Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 408.0000000 Found heuristic solution: objective 312.0000000 Root relaxation: objective 2.860000e+02, 9 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 286.0000000 286.00000 0.0% - 0s Explored 0 nodes (9 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 2.860000000000e+02, best bound 2.860000000000e+02, gap 0.0% adding cut for [(9, 10), (9, 11), (10, 12), (11, 13), (12, 13)] Optimize a model with 14 rows, 78 columns and 166 nonzeros Presolve time: 0.00s Presolved: 14 rows, 78 columns, 166 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 516.0000000 Root relaxation: objective 3.040000e+02, 11 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 304.0000000 304.00000 0.0% - 0s Explored 0 nodes (11 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.040000000000e+02, best bound 3.040000000000e+02, gap 0.0% adding cut for [(7, 10), (8, 9), (8, 11), (10, 12), (11, 13), (12, 13)] Optimize a model with 15 rows, 78 columns and 187 nonzeros Presolve time: 0.00s Presolved: 15 rows, 78 columns, 187 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 556.0000000 Root relaxation: objective 3.120000e+02, 14 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 312.0000000 312.00000 0.0% - 0s Explored 0 nodes (14 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.120000000000e+02, best bound 3.120000000000e+02, gap 0.0% adding cut for [(6, 9), (8, 9), (8, 11), (10, 12), (11, 13), (12, 13)] Optimize a model with 16 rows, 78 columns and 208 nonzeros Presolve time: 0.00s Presolved: 16 rows, 78 columns, 208 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 578.0000000 Root relaxation: objective 3.160000e+02, 16 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 316.0000000 316.00000 0.0% - 0s Explored 0 nodes (16 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.160000000000e+02, best bound 3.160000000000e+02, gap 0.0% adding cut for [(8, 9), (8, 11), (10, 12), (11, 13), (12, 13)] Optimize a model with 17 rows, 78 columns and 223 nonzeros Presolve time: 0.00s Presolved: 17 rows, 78 columns, 223 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 578.0000000 Root relaxation: objective 3.160000e+02, 15 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 316.0000000 316.00000 0.0% - 0s Explored 0 nodes (15 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.160000000000e+02, best bound 3.160000000000e+02, gap 0.0% adding cut for [(8, 9), (6, 8), (7, 9)] adding cut for [(11, 12), (11, 13), (12, 13)] Optimize a model with 19 rows, 78 columns and 232 nonzeros Presolve time: 0.00s Presolved: 19 rows, 78 columns, 232 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.180000e+02, 17 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 318.0000000 318.00000 0.0% - 0s Explored 0 nodes (17 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.180000000000e+02, best bound 3.180000000000e+02, gap 0.0% adding cut for [(6, 8), (7, 10), (8, 11), (10, 12), (11, 13), (12, 13)] Optimize a model with 20 rows, 78 columns and 253 nonzeros Presolve time: 0.00s Presolved: 20 rows, 78 columns, 253 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.180000e+02, 19 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 318.0000000 318.00000 0.0% - 0s Explored 0 nodes (19 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.180000000000e+02, best bound 3.180000000000e+02, gap 0.0% adding cut for [(6, 8), (8, 11), (10, 12), (11, 13), (12, 13)] Optimize a model with 21 rows, 78 columns and 268 nonzeros Presolve time: 0.00s Presolved: 21 rows, 78 columns, 268 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.200000e+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 0 320.0000000 320.00000 0.0% - 0s Explored 0 nodes (22 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.200000000000e+02, best bound 3.200000000000e+02, gap 0.0% adding cut for [(7, 8), (8, 11), (10, 12), (11, 13), (12, 13)] Optimize a model with 22 rows, 78 columns and 283 nonzeros Presolve time: 0.00s Presolved: 22 rows, 78 columns, 283 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.200000e+02, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 320.0000000 320.00000 0.0% - 0s Explored 0 nodes (23 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.200000000000e+02, best bound 3.200000000000e+02, gap 0.0% adding cut for [(8, 11), (10, 12), (11, 13), (12, 13)] Optimize a model with 23 rows, 78 columns and 293 nonzeros Presolve time: 0.00s Presolved: 23 rows, 78 columns, 293 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.220000e+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 0 322.0000000 322.00000 0.0% - 0s Explored 0 nodes (23 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.220000000000e+02, best bound 3.220000000000e+02, gap 0.0% adding cut for [(6, 8), (8, 12), (9, 11), (11, 13), (12, 13)] Optimize a model with 24 rows, 78 columns and 308 nonzeros Presolve time: 0.00s Presolved: 24 rows, 78 columns, 308 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.220000e+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 322.00000 0 12 604.00000 322.00000 46.7% - 0s Another try with MIP start H 0 0 344.0000000 322.00000 6.40% - 0s * 0 0 0 324.0000000 324.00000 0.0% - 0s Cutting planes: Gomory: 1 Zero half: 1 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.240000000000e+02, best bound 3.240000000000e+02, gap 0.0% adding cut for [(5, 13), (7, 8), (8, 11), (11, 12), (12, 13)] Optimize a model with 25 rows, 78 columns and 323 nonzeros Presolve time: 0.00s Presolved: 25 rows, 78 columns, 323 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.220000e+02, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 322.00000 0 12 604.00000 322.00000 46.7% - 0s Another try with MIP start H 0 0 328.0000000 322.00000 1.83% - 0s * 0 0 0 324.0000000 324.00000 0.0% - 0s Cutting planes: Gomory: 1 Zero half: 2 Explored 0 nodes (34 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.240000000000e+02, best bound 3.240000000000e+02, gap 0.0% adding cut for [(8, 11), (11, 12), (12, 13), (5, 13)] Optimize a model with 26 rows, 78 columns and 333 nonzeros Presolve time: 0.00s Presolved: 26 rows, 78 columns, 333 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.220000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 322.00000 0 12 604.00000 322.00000 46.7% - 0s Another try with MIP start H 0 0 326.0000000 322.00000 1.23% - 0s * 0 0 0 324.0000000 324.00000 0.0% - 0s Explored 0 nodes (26 simplex iterations) in 0.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.240000000000e+02, best bound 3.240000000000e+02, gap 0.0% adding cut for [(10, 12), (11, 13), (12, 13), (7, 10)] Optimize a model with 27 rows, 78 columns and 343 nonzeros Presolve time: 0.00s Presolved: 27 rows, 78 columns, 343 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.220000e+02, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 322.00000 0 14 604.00000 322.00000 46.7% - 0s Another try with MIP start H 0 0 326.0000000 322.00000 1.23% - 0s * 0 0 0 324.0000000 324.00000 0.0% - 0s Cutting planes: Zero half: 1 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.240000000000e+02, best bound 3.240000000000e+02, gap 0.0% adding cut for [(10, 12), (11, 13), (12, 13), (6, 11)] Optimize a model with 28 rows, 78 columns and 353 nonzeros Presolve time: 0.00s Presolved: 28 rows, 78 columns, 353 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.220000e+02, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 322.00000 0 14 604.00000 322.00000 46.7% - 0s Another try with MIP start H 0 0 326.0000000 322.00000 1.23% - 0s 0 0 324.66667 0 14 326.00000 324.66667 0.41% - 0s 0 0 324.66667 0 8 326.00000 324.66667 0.41% - 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 3.260000000000e+02, best bound 3.260000000000e+02, gap 0.0% adding cut for [(5, 13), (7, 8), (8, 9), (9, 11), (11, 12), (12, 13)] Optimize a model with 29 rows, 78 columns and 374 nonzeros Presolve time: 0.00s Presolved: 29 rows, 78 columns, 374 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.220000e+02, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 322.00000 0 12 604.00000 322.00000 46.7% - 0s Another try with MIP start H 0 0 328.0000000 322.00000 1.83% - 0s 0 0 324.00000 0 12 328.00000 324.00000 1.22% - 0s 0 0 324.66667 0 12 328.00000 324.66667 1.02% - 0s H 0 0 326.0000000 324.66667 0.41% - 0s Cutting planes: Gomory: 1 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 3.260000000000e+02, best bound 3.260000000000e+02, gap 0.0% adding cut for [(8, 13), (11, 12), (12, 13), (6, 8)] Optimize a model with 30 rows, 78 columns and 384 nonzeros Presolve time: 0.00s Presolved: 30 rows, 78 columns, 384 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.220000e+02, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 322.00000 0 12 604.00000 322.00000 46.7% - 0s Another try with MIP start H 0 0 330.0000000 322.00000 2.42% - 0s 0 0 324.00000 0 10 330.00000 324.00000 1.82% - 0s 0 0 324.00000 0 11 330.00000 324.00000 1.82% - 0s H 0 0 328.0000000 324.00000 1.22% - 0s H 0 0 326.0000000 324.00000 0.61% - 0s 0 0 324.00000 0 15 326.00000 324.00000 0.61% - 0s 0 0 infeasible 0 326.00000 325.00033 0.31% - 0s Cutting planes: Gomory: 3 Zero half: 1 Explored 0 nodes (73 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.260000000000e+02, best bound 3.260000000000e+02, gap 0.0% adding cut for [(5, 13), (8, 9), (9, 11), (11, 12), (12, 13)] Optimize a model with 31 rows, 78 columns and 399 nonzeros Presolve time: 0.00s Presolved: 31 rows, 78 columns, 399 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.220000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 322.00000 0 12 604.00000 322.00000 46.7% - 0s Another try with MIP start H 0 0 328.0000000 322.00000 1.83% - 0s 0 0 324.00000 0 14 328.00000 324.00000 1.22% - 0s 0 0 324.00000 0 11 328.00000 324.00000 1.22% - 0s 0 0 324.00000 0 15 328.00000 324.00000 1.22% - 0s 0 0 324.66667 0 17 328.00000 324.66667 1.02% - 0s 0 0 325.33333 0 14 328.00000 325.33333 0.81% - 0s 0 0 325.33333 0 15 328.00000 325.33333 0.81% - 0s 0 0 325.50000 0 16 328.00000 325.50000 0.76% - 0s 0 0 325.50000 0 17 328.00000 325.50000 0.76% - 0s Cutting planes: Clique: 1 Zero half: 3 Mod-K: 2 Explored 0 nodes (91 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.280000000000e+02, best bound 3.280000000000e+02, gap 0.0% adding cut for [(8, 11), (9, 11), (7, 8)] Optimize a model with 32 rows, 78 columns and 405 nonzeros Presolve time: 0.00s Presolved: 32 rows, 78 columns, 405 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.220000e+02, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 322.00000 0 12 604.00000 322.00000 46.7% - 0s Another try with MIP start H 0 0 344.0000000 322.00000 6.40% - 0s 0 0 324.00000 0 12 344.00000 324.00000 5.81% - 0s 0 0 324.00000 0 14 344.00000 324.00000 5.81% - 0s 0 0 324.57143 0 18 344.00000 324.57143 5.65% - 0s 0 0 324.80000 0 22 344.00000 324.80000 5.58% - 0s H 0 0 332.0000000 324.80000 2.17% - 0s H 0 0 330.0000000 324.80000 1.58% - 0s 0 0 325.00000 0 12 330.00000 325.00000 1.52% - 0s 0 0 325.00000 0 13 330.00000 325.00000 1.52% - 0s 0 0 325.00000 0 17 330.00000 325.00000 1.52% - 0s 0 0 325.00000 0 16 330.00000 325.00000 1.52% - 0s 0 0 325.50000 0 19 330.00000 325.50000 1.36% - 0s 0 0 325.50000 0 20 330.00000 325.50000 1.36% - 0s 0 0 325.60000 0 19 330.00000 325.60000 1.33% - 0s 0 0 326.00000 0 16 330.00000 326.00000 1.21% - 0s 0 0 326.00000 0 16 330.00000 326.00000 1.21% - 0s H 0 0 328.0000000 326.00000 0.61% - 0s 0 0 cutoff 0 328.00000 328.00000 0.0% - 0s Cutting planes: Gomory: 1 Zero half: 2 Mod-K: 1 Explored 1 nodes (135 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.280000000000e+02, best bound 3.280000000000e+02, gap 0.0% adding cut for [(10, 12), (7, 10), (12, 13), (5, 13)] Optimize a model with 33 rows, 78 columns and 415 nonzeros Presolve time: 0.00s Presolved: 33 rows, 78 columns, 415 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.220000e+02, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 322.00000 0 12 604.00000 322.00000 46.7% - 0s Another try with MIP start H 0 0 340.0000000 322.00000 5.29% - 0s 0 0 324.00000 0 14 340.00000 324.00000 4.71% - 0s 0 0 324.28571 0 20 340.00000 324.28571 4.62% - 0s 0 0 324.66667 0 14 340.00000 324.66667 4.51% - 0s 0 0 324.66667 0 16 340.00000 324.66667 4.51% - 0s 0 0 324.66667 0 16 340.00000 324.66667 4.51% - 0s H 0 0 328.0000000 324.66667 1.02% - 0s Cutting planes: Gomory: 2 Zero half: 4 Explored 0 nodes (51 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.280000000000e+02, best bound 3.280000000000e+02, gap 0.0% adding cut for [(8, 11), (11, 13), (12, 13), (7, 8)] Optimize a model with 34 rows, 78 columns and 425 nonzeros Presolve time: 0.00s Presolved: 34 rows, 78 columns, 425 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.220000e+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 322.00000 0 14 604.00000 322.00000 46.7% - 0s Another try with MIP start H 0 0 356.0000000 322.00000 9.55% - 0s 0 0 324.00000 0 16 356.00000 324.00000 8.99% - 0s 0 0 324.00000 0 18 356.00000 324.00000 8.99% - 0s 0 0 324.00000 0 18 356.00000 324.00000 8.99% - 0s H 0 0 332.0000000 324.00000 2.41% - 0s 0 2 324.00000 0 16 332.00000 324.00000 2.41% - 0s * 3 2 2 328.0000000 328.00000 0.0% 7.0 0s Cutting planes: Gomory: 1 Zero half: 2 Explored 4 nodes (58 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.280000000000e+02, best bound 3.280000000000e+02, gap 0.0% adding cut for [(7, 9), (8, 12), (9, 11), (11, 13), (12, 13)] Optimize a model with 35 rows, 78 columns and 440 nonzeros Presolve time: 0.00s Presolved: 35 rows, 78 columns, 440 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.220000e+02, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 322.00000 0 14 604.00000 322.00000 46.7% - 0s Another try with MIP start H 0 0 336.0000000 322.00000 4.17% - 0s 0 0 324.00000 0 13 336.00000 324.00000 3.57% - 0s 0 0 324.00000 0 12 336.00000 324.00000 3.57% - 0s 0 0 324.00000 0 16 336.00000 324.00000 3.57% - 0s 0 0 324.33333 0 23 336.00000 324.33333 3.47% - 0s 0 0 324.71429 0 21 336.00000 324.71429 3.36% - 0s 0 0 324.71429 0 21 336.00000 324.71429 3.36% - 0s H 0 0 334.0000000 324.71429 2.78% - 0s H 0 0 330.0000000 324.71429 1.60% - 0s 0 2 325.66667 0 21 330.00000 325.66667 1.31% - 0s * 4 2 4 328.0000000 328.00000 0.0% 4.0 0s Cutting planes: Gomory: 2 Zero half: 5 Explored 5 nodes (107 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.280000000000e+02, best bound 3.280000000000e+02, gap 0.0% adding cut for [(8, 11), (9, 12), (11, 13), (12, 13)] Optimize a model with 36 rows, 78 columns and 450 nonzeros Presolve time: 0.00s Presolved: 36 rows, 78 columns, 450 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 13 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 344.0000000 324.00000 5.81% - 0s 0 0 324.00000 0 16 344.00000 324.00000 5.81% - 0s 0 0 325.00000 0 18 344.00000 325.00000 5.52% - 0s 0 0 325.00000 0 19 344.00000 325.00000 5.52% - 0s 0 0 325.20000 0 15 344.00000 325.20000 5.47% - 0s H 0 0 330.0000000 325.20000 1.45% - 0s 0 0 325.20000 0 16 330.00000 325.20000 1.45% - 0s 0 0 325.20000 0 9 330.00000 325.20000 1.45% - 0s H 0 0 328.0000000 325.20000 0.85% - 0s 0 0 326.00000 0 12 328.00000 326.00000 0.61% - 0s 0 0 326.00000 0 12 328.00000 326.00000 0.61% - 0s 0 0 326.00000 0 14 328.00000 326.00000 0.61% - 0s Cutting planes: Zero half: 3 Explored 0 nodes (89 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.280000000000e+02, best bound 3.280000000000e+02, gap 0.0% adding cut for [(9, 10), (6, 9), (7, 10)] Optimize a model with 37 rows, 78 columns and 456 nonzeros Presolve time: 0.00s Presolved: 37 rows, 78 columns, 456 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 16 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 332.0000000 324.00000 2.41% - 0s 0 0 325.14286 0 14 332.00000 325.14286 2.07% - 0s 0 0 325.14286 0 15 332.00000 325.14286 2.07% - 0s 0 0 325.14286 0 17 332.00000 325.14286 2.07% - 0s 0 0 326.00000 0 17 332.00000 326.00000 1.81% - 0s 0 0 326.00000 0 17 332.00000 326.00000 1.81% - 0s 0 0 326.00000 0 15 332.00000 326.00000 1.81% - 0s H 0 0 330.0000000 326.00000 1.21% - 0s 0 0 326.00000 0 14 330.00000 326.00000 1.21% - 0s 0 0 326.00000 0 17 330.00000 326.00000 1.21% - 0s 0 0 cutoff 0 330.00000 329.00033 0.30% - 0s Cutting planes: Gomory: 1 Zero half: 3 Explored 0 nodes (106 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.300000000000e+02, best bound 3.300000000000e+02, gap 0.0% adding cut for [(8, 9), (9, 10), (7, 10)] Optimize a model with 38 rows, 78 columns and 462 nonzeros Presolve time: 0.00s Presolved: 38 rows, 78 columns, 462 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 14 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 332.0000000 324.00000 2.41% - 0s 0 0 324.85714 0 16 332.00000 324.85714 2.15% - 0s 0 0 324.85714 0 13 332.00000 324.85714 2.15% - 0s 0 0 324.85714 0 18 332.00000 324.85714 2.15% - 0s 0 0 326.66667 0 13 332.00000 326.66667 1.61% - 0s 0 0 327.11111 0 17 332.00000 327.11111 1.47% - 0s 0 0 327.33333 0 14 332.00000 327.33333 1.41% - 0s 0 0 327.33333 0 16 332.00000 327.33333 1.41% - 0s 0 0 327.33333 0 16 332.00000 327.33333 1.41% - 0s 0 2 327.50000 0 16 332.00000 327.50000 1.36% - 0s * 10 2 3 330.0000000 329.00000 0.30% 2.8 0s Cutting planes: Gomory: 3 Zero half: 2 Explored 12 nodes (119 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.300000000000e+02, best bound 3.300000000000e+02, gap 0.0% adding cut for [(10, 12), (11, 12), (11, 13), (5, 13)] Optimize a model with 39 rows, 78 columns and 472 nonzeros Presolve time: 0.00s Presolved: 39 rows, 78 columns, 472 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 15 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 344.0000000 324.00000 5.81% - 0s 0 0 324.80000 0 20 344.00000 324.80000 5.58% - 0s 0 0 325.33333 0 16 344.00000 325.33333 5.43% - 0s 0 0 325.38462 0 20 344.00000 325.38462 5.41% - 0s 0 0 325.38462 0 21 344.00000 325.38462 5.41% - 0s 0 0 325.38462 0 19 344.00000 325.38462 5.41% - 0s H 0 0 340.0000000 325.38462 4.30% - 0s H 0 0 330.0000000 325.38462 1.40% - 0s 0 0 325.38462 0 10 330.00000 325.38462 1.40% - 0s 0 0 325.50000 0 15 330.00000 325.50000 1.36% - 0s 0 0 327.00000 0 10 330.00000 327.00000 0.91% - 0s 0 0 327.00000 0 9 330.00000 327.00000 0.91% - 0s 0 0 327.00000 0 11 330.00000 327.00000 0.91% - 0s 0 0 cutoff 0 330.00000 329.00033 0.30% - 0s Cutting planes: Zero half: 3 Mod-K: 1 Explored 0 nodes (87 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.300000000000e+02, best bound 3.300000000000e+02, gap 0.0% adding cut for [(8, 13), (10, 12), (12, 13), (6, 8)] Optimize a model with 40 rows, 78 columns and 482 nonzeros Presolve time: 0.00s Presolved: 40 rows, 78 columns, 482 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 12 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 346.0000000 324.00000 6.36% - 0s 0 0 324.85714 0 19 346.00000 324.85714 6.11% - 0s 0 0 326.66667 0 14 346.00000 326.66667 5.59% - 0s 0 0 327.11111 0 17 346.00000 327.11111 5.46% - 0s 0 0 327.33333 0 13 346.00000 327.33333 5.39% - 0s 0 0 327.33333 0 16 346.00000 327.33333 5.39% - 0s 0 0 327.33333 0 16 346.00000 327.33333 5.39% - 0s H 0 0 332.0000000 327.33333 1.41% - 0s 0 0 327.33333 0 11 332.00000 327.33333 1.41% - 0s 0 0 327.33333 0 11 332.00000 327.33333 1.41% - 0s 0 0 327.33333 0 12 332.00000 327.33333 1.41% - 0s 0 0 327.33333 0 15 332.00000 327.33333 1.41% - 0s 0 0 327.33333 0 15 332.00000 327.33333 1.41% - 0s 0 1 327.33333 0 12 332.00000 327.33333 1.41% - 0s * 5 2 4 330.0000000 329.00000 0.30% 3.8 0s Cutting planes: Gomory: 3 Zero half: 5 Explored 7 nodes (113 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.300000000000e+02, best bound 3.300000000000e+02, gap 0.0% adding cut for [(8, 11), (9, 11), (6, 8)] Optimize a model with 41 rows, 78 columns and 488 nonzeros Presolve time: 0.00s Presolved: 41 rows, 78 columns, 488 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 14 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 334.0000000 324.00000 2.99% - 0s 0 0 324.85714 0 16 334.00000 324.85714 2.74% - 0s 0 0 324.85714 0 15 334.00000 324.85714 2.74% - 0s H 0 0 330.0000000 324.85714 1.56% - 0s 0 0 325.50000 0 16 330.00000 325.50000 1.36% - 0s 0 0 326.00000 0 18 330.00000 326.00000 1.21% - 0s 0 0 326.00000 0 18 330.00000 326.00000 1.21% - 0s 0 0 326.00000 0 15 330.00000 326.00000 1.21% - 0s 0 0 326.00000 0 16 330.00000 326.00000 1.21% - 0s 0 0 cutoff 0 330.00000 329.00033 0.30% - 0s Cutting planes: Gomory: 1 Zero half: 2 Explored 0 nodes (111 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.300000000000e+02, best bound 3.300000000000e+02, gap 0.0% adding cut for [(9, 11), (6, 11), (7, 9)] Optimize a model with 42 rows, 78 columns and 494 nonzeros Presolve time: 0.00s Presolved: 42 rows, 78 columns, 494 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 10 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 374.0000000 324.00000 13.4% - 0s 0 0 324.85714 0 19 374.00000 324.85714 13.1% - 0s 0 0 326.80000 0 17 374.00000 326.80000 12.6% - 0s 0 0 327.00000 0 12 374.00000 327.00000 12.6% - 0s 0 0 327.11111 0 19 374.00000 327.11111 12.5% - 0s 0 0 327.33333 0 15 374.00000 327.33333 12.5% - 0s 0 0 327.33333 0 18 374.00000 327.33333 12.5% - 0s 0 0 327.33333 0 18 374.00000 327.33333 12.5% - 0s H 0 0 360.0000000 327.33333 9.07% - 0s H 0 0 332.0000000 327.33333 1.41% - 0s 0 0 327.33333 0 13 332.00000 327.33333 1.41% - 0s 0 0 327.33333 0 13 332.00000 327.33333 1.41% - 0s 0 0 327.33333 0 14 332.00000 327.33333 1.41% - 0s 0 0 327.33333 0 17 332.00000 327.33333 1.41% - 0s 0 0 327.33333 0 13 332.00000 327.33333 1.41% - 0s 0 2 328.00000 0 12 332.00000 328.00000 1.20% - 0s * 4 3 3 330.0000000 329.00000 0.30% 2.8 0s Cutting planes: Gomory: 2 Zero half: 3 Explored 7 nodes (124 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.300000000000e+02, best bound 3.300000000000e+02, gap 0.0% adding cut for [(9, 13), (10, 12), (12, 13), (7, 9)] Optimize a model with 43 rows, 78 columns and 504 nonzeros Presolve time: 0.00s Presolved: 43 rows, 78 columns, 504 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 14 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 330.0000000 324.00000 1.82% - 0s 0 0 324.85714 0 16 330.00000 324.85714 1.56% - 0s 0 0 324.85714 0 10 330.00000 324.85714 1.56% - 0s 0 0 324.85714 0 19 330.00000 324.85714 1.56% - 0s 0 0 325.42857 0 19 330.00000 325.42857 1.39% - 0s 0 0 325.50000 0 19 330.00000 325.50000 1.36% - 0s 0 0 325.50000 0 20 330.00000 325.50000 1.36% - 0s 0 0 cutoff 0 330.00000 329.00033 0.30% - 0s Cutting planes: Gomory: 1 Zero half: 4 Mod-K: 1 Explored 0 nodes (88 simplex iterations) in 0.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.300000000000e+02, best bound 3.300000000000e+02, gap 0.0% adding cut for [(9, 13), (10, 12), (12, 13)] Optimize a model with 44 rows, 78 columns and 510 nonzeros Presolve time: 0.00s Presolved: 44 rows, 78 columns, 510 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 14 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 378.0000000 324.00000 14.3% - 0s 0 0 324.85714 0 19 378.00000 324.85714 14.1% - 0s 0 0 325.46667 0 21 378.00000 325.46667 13.9% - 0s 0 0 325.46667 0 22 378.00000 325.46667 13.9% - 0s 0 0 325.46667 0 22 378.00000 325.46667 13.9% - 0s H 0 0 358.0000000 325.46667 9.09% - 0s H 0 0 332.0000000 325.46667 1.97% - 0s 0 0 325.46667 0 11 332.00000 325.46667 1.97% - 0s 0 0 325.46667 0 18 332.00000 325.46667 1.97% - 0s 0 0 325.50000 0 17 332.00000 325.50000 1.96% - 0s 0 0 326.00000 0 18 332.00000 326.00000 1.81% - 0s 0 0 326.00000 0 14 332.00000 326.00000 1.81% - 0s H 0 0 330.0000000 326.00000 1.21% - 0s 0 2 327.00000 0 14 330.00000 327.00000 0.91% - 0s Cutting planes: Zero half: 2 Mod-K: 1 Explored 5 nodes (134 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.300000000000e+02, best bound 3.300000000000e+02, gap 0.0% adding cut for [(7, 11), (11, 12), (12, 13), (5, 13)] Optimize a model with 45 rows, 78 columns and 520 nonzeros Presolve time: 0.00s Presolved: 45 rows, 78 columns, 520 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 15 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 362.0000000 324.00000 10.5% - 0s 0 0 324.80000 0 20 362.00000 324.80000 10.3% - 0s 0 0 325.33333 0 16 362.00000 325.33333 10.1% - 0s 0 0 325.38462 0 20 362.00000 325.38462 10.1% - 0s 0 0 325.38462 0 21 362.00000 325.38462 10.1% - 0s 0 0 325.38462 0 19 362.00000 325.38462 10.1% - 0s H 0 0 352.0000000 325.38462 7.56% - 0s H 0 0 348.0000000 325.38462 6.50% - 0s H 0 0 336.0000000 325.38462 3.16% - 0s 0 2 326.00000 0 19 336.00000 326.00000 2.98% - 0s * 10 4 8 332.0000000 326.00000 1.81% 3.2 0s * 14 1 2 330.0000000 329.00000 0.30% 4.0 0s Cutting planes: MIR: 1 Zero half: 5 Explored 16 nodes (111 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.300000000000e+02, best bound 3.300000000000e+02, gap 0.0% adding cut for [(8, 13), (10, 12), (12, 13), (7, 8)] Optimize a model with 46 rows, 78 columns and 530 nonzeros Presolve time: 0.00s Presolved: 46 rows, 78 columns, 530 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 12 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 344.0000000 324.00000 5.81% - 0s 0 0 324.85714 0 19 344.00000 324.85714 5.56% - 0s 0 0 326.80000 0 18 344.00000 326.80000 5.00% - 0s 0 0 327.00000 0 12 344.00000 327.00000 4.94% - 0s 0 0 327.11111 0 18 344.00000 327.11111 4.91% - 0s 0 0 327.33333 0 14 344.00000 327.33333 4.84% - 0s 0 0 327.33333 0 19 344.00000 327.33333 4.84% - 0s 0 0 327.33333 0 15 344.00000 327.33333 4.84% - 0s H 0 0 340.0000000 327.33333 3.73% - 0s 0 0 327.33333 0 12 340.00000 327.33333 3.73% - 0s 0 0 327.33333 0 12 340.00000 327.33333 3.73% - 0s 0 0 327.33333 0 16 340.00000 327.33333 3.73% - 0s 0 0 327.33333 0 18 340.00000 327.33333 3.73% - 0s 0 0 327.33333 0 16 340.00000 327.33333 3.73% - 0s H 0 0 336.0000000 327.33333 2.58% - 0s H 0 0 334.0000000 327.33333 2.00% - 0s 0 2 328.00000 0 15 334.00000 328.00000 1.80% - 0s * 6 3 5 332.0000000 329.00000 0.90% 5.5 0s * 9 1 2 330.0000000 330.00000 0.0% 5.0 0s Cutting planes: Gomory: 2 Zero half: 6 Explored 10 nodes (164 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.300000000000e+02, best bound 3.300000000000e+02, gap 0.0% adding cut for [(9, 11), (11, 12), (12, 13), (5, 13)] Optimize a model with 47 rows, 78 columns and 540 nonzeros Presolve time: 0.00s Presolved: 47 rows, 78 columns, 540 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 10 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 354.0000000 324.00000 8.47% - 0s 0 0 324.85714 0 18 354.00000 324.85714 8.23% - 0s 0 0 326.80000 0 18 354.00000 326.80000 7.68% - 0s 0 0 327.00000 0 12 354.00000 327.00000 7.63% - 0s 0 0 327.11111 0 18 354.00000 327.11111 7.60% - 0s 0 0 327.33333 0 14 354.00000 327.33333 7.53% - 0s 0 0 327.33333 0 19 354.00000 327.33333 7.53% - 0s 0 0 327.33333 0 17 354.00000 327.33333 7.53% - 0s 0 2 328.00000 0 17 354.00000 328.00000 7.34% - 0s * 9 9 7 332.0000000 329.00000 0.90% 3.9 0s * 19 0 3 330.0000000 330.00000 0.0% 2.6 0s Cutting planes: Gomory: 3 Zero half: 2 Explored 20 nodes (109 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.300000000000e+02, best bound 3.300000000000e+02, gap 0.0% adding cut for [(10, 12), (12, 13), (6, 13), (7, 10)] Optimize a model with 48 rows, 78 columns and 550 nonzeros Presolve time: 0.00s Presolved: 48 rows, 78 columns, 550 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 10 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 352.0000000 324.00000 7.95% - 0s H 0 0 336.0000000 324.00000 3.57% - 0s 0 0 324.85714 0 17 336.00000 324.85714 3.32% - 0s 0 0 324.85714 0 16 336.00000 324.85714 3.32% - 0s 0 0 325.50000 0 18 336.00000 325.50000 3.13% - 0s 0 0 328.00000 0 12 336.00000 328.00000 2.38% - 0s 0 0 328.00000 0 18 336.00000 328.00000 2.38% - 0s 0 0 328.00000 0 12 336.00000 328.00000 2.38% - 0s 0 0 328.00000 0 12 336.00000 328.00000 2.38% - 0s 0 0 328.00000 0 12 336.00000 328.00000 2.38% - 0s 0 2 328.50000 0 12 336.00000 328.50000 2.23% - 0s * 21 7 9 334.0000000 330.00000 1.20% 4.1 0s * 27 5 5 332.0000000 330.00000 0.60% 4.0 0s Cutting planes: Gomory: 4 Zero half: 1 Explored 40 nodes (291 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.320000000000e+02, best bound 3.320000000000e+02, gap 0.0% adding cut for [(9, 11), (11, 13), (12, 13), (6, 12)] Optimize a model with 49 rows, 78 columns and 560 nonzeros Presolve time: 0.00s Presolved: 49 rows, 78 columns, 560 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 10 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 352.0000000 324.00000 7.95% - 0s H 0 0 336.0000000 324.00000 3.57% - 0s 0 0 324.85714 0 17 336.00000 324.85714 3.32% - 0s 0 0 324.85714 0 10 336.00000 324.85714 3.32% - 0s 0 0 324.85714 0 19 336.00000 324.85714 3.32% - 0s 0 0 326.80000 0 18 336.00000 326.80000 2.74% - 0s 0 0 327.00000 0 12 336.00000 327.00000 2.68% - 0s 0 0 327.11111 0 20 336.00000 327.11111 2.65% - 0s 0 0 327.27273 0 20 336.00000 327.27273 2.60% - 0s 0 0 327.33333 0 14 336.00000 327.33333 2.58% - 0s 0 0 327.33333 0 17 336.00000 327.33333 2.58% - 0s 0 0 327.33333 0 16 336.00000 327.33333 2.58% - 0s 0 2 327.60000 0 16 336.00000 327.60000 2.50% - 0s * 11 4 5 332.0000000 329.20000 0.84% 4.7 0s Cutting planes: Gomory: 3 Zero half: 2 Explored 20 nodes (188 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.320000000000e+02, best bound 3.320000000000e+02, gap 0.0% adding cut for [(9, 11), (11, 12), (12, 13), (7, 9)] Optimize a model with 50 rows, 78 columns and 570 nonzeros Presolve time: 0.00s Presolved: 50 rows, 78 columns, 570 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 12 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 342.0000000 324.00000 5.26% - 0s 0 0 324.85714 0 18 342.00000 324.85714 5.01% - 0s 0 0 326.80000 0 18 342.00000 326.80000 4.44% - 0s 0 0 327.00000 0 12 342.00000 327.00000 4.39% - 0s 0 0 327.11111 0 18 342.00000 327.11111 4.35% - 0s 0 0 327.33333 0 14 342.00000 327.33333 4.29% - 0s 0 0 327.33333 0 19 342.00000 327.33333 4.29% - 0s 0 0 327.33333 0 15 342.00000 327.33333 4.29% - 0s H 0 0 340.0000000 327.33333 3.73% - 0s 0 0 327.33333 0 16 340.00000 327.33333 3.73% - 0s 0 0 327.33333 0 15 340.00000 327.33333 3.73% - 0s H 0 0 336.0000000 327.33333 2.58% - 0s H 0 0 334.0000000 327.33333 2.00% - 0s 0 0 327.33333 0 14 334.00000 327.33333 2.00% - 0s 0 0 327.33333 0 16 334.00000 327.33333 2.00% - 0s 0 0 327.33333 0 18 334.00000 327.33333 2.00% - 0s 0 0 327.33333 0 16 334.00000 327.33333 2.00% - 0s 0 2 328.00000 0 15 334.00000 328.00000 1.80% - 0s * 6 2 5 332.0000000 329.14286 0.86% 6.5 0s Cutting planes: Gomory: 3 Zero half: 1 Explored 12 nodes (195 simplex iterations) in 0.03 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.320000000000e+02, best bound 3.320000000000e+02, gap 0.0% adding cut for [(8, 10), (6, 8), (7, 10)] adding cut for [(9, 11), (11, 13), (12, 13)] Optimize a model with 52 rows, 78 columns and 582 nonzeros Presolve removed 1 rows and 0 columns Presolve time: 0.00s Presolved: 51 rows, 78 columns, 579 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 14 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 332.0000000 324.00000 2.41% - 0s 0 0 324.85714 0 17 332.00000 324.85714 2.15% - 0s 0 0 324.85714 0 10 332.00000 324.85714 2.15% - 0s 0 0 324.85714 0 20 332.00000 324.85714 2.15% - 0s 0 0 326.80000 0 17 332.00000 326.80000 1.57% - 0s 0 0 327.00000 0 12 332.00000 327.00000 1.51% - 0s 0 0 327.11111 0 20 332.00000 327.11111 1.47% - 0s 0 0 327.33333 0 14 332.00000 327.33333 1.41% - 0s 0 0 327.33333 0 17 332.00000 327.33333 1.41% - 0s 0 0 327.33333 0 17 332.00000 327.33333 1.41% - 0s 0 2 327.33333 0 16 332.00000 327.33333 1.41% - 0s Cutting planes: Gomory: 2 Zero half: 4 Explored 17 nodes (150 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.320000000000e+02, best bound 3.320000000000e+02, gap 0.0% adding cut for [(8, 9), (9, 10), (6, 8)] Optimize a model with 53 rows, 78 columns and 588 nonzeros Presolve removed 1 rows and 0 columns Presolve time: 0.00s Presolved: 52 rows, 78 columns, 585 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 14 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 360.0000000 324.00000 10.0% - 0s 0 0 324.85714 0 20 360.00000 324.85714 9.76% - 0s 0 0 326.80000 0 17 360.00000 326.80000 9.22% - 0s 0 0 327.00000 0 12 360.00000 327.00000 9.17% - 0s 0 0 327.11111 0 19 360.00000 327.11111 9.14% - 0s 0 0 327.33333 0 14 360.00000 327.33333 9.07% - 0s 0 0 327.33333 0 19 360.00000 327.33333 9.07% - 0s 0 0 327.33333 0 15 360.00000 327.33333 9.07% - 0s H 0 0 340.0000000 327.33333 3.73% - 0s 0 0 327.33333 0 15 340.00000 327.33333 3.73% - 0s 0 0 327.33333 0 14 340.00000 327.33333 3.73% - 0s 0 0 327.33333 0 16 340.00000 327.33333 3.73% - 0s 0 0 327.33333 0 18 340.00000 327.33333 3.73% - 0s 0 0 327.33333 0 15 340.00000 327.33333 3.73% - 0s 0 0 327.33333 0 13 340.00000 327.33333 3.73% - 0s 0 0 327.33333 0 15 340.00000 327.33333 3.73% - 0s 0 0 327.33333 0 15 340.00000 327.33333 3.73% - 0s H 0 0 334.0000000 327.33333 2.00% - 0s 0 2 328.00000 0 15 334.00000 328.00000 1.80% - 0s * 9 2 7 332.0000000 330.00000 0.60% 5.2 0s Cutting planes: Gomory: 2 Zero half: 5 Explored 13 nodes (223 simplex iterations) in 0.04 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.320000000000e+02, best bound 3.320000000000e+02, gap 0.0% adding cut for [(11, 13), (12, 13), (6, 12), (7, 11)] Optimize a model with 54 rows, 78 columns and 598 nonzeros Presolve removed 1 rows and 0 columns Presolve time: 0.00s Presolved: 53 rows, 78 columns, 595 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.240000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 324.00000 0 13 604.00000 324.00000 46.4% - 0s Another try with MIP start H 0 0 334.0000000 324.00000 2.99% - 0s 0 0 324.00000 0 14 334.00000 324.00000 2.99% - 0s 0 0 324.00000 0 16 334.00000 324.00000 2.99% - 0s 0 0 325.14286 0 18 334.00000 325.14286 2.65% - 0s 0 0 325.50000 0 18 334.00000 325.50000 2.54% - 0s 0 0 325.66667 0 20 334.00000 325.66667 2.50% - 0s 0 0 325.71429 0 22 334.00000 325.71429 2.48% - 0s 0 0 325.71429 0 20 334.00000 325.71429 2.48% - 0s 0 2 325.83333 0 20 334.00000 325.83333 2.45% - 0s Cutting planes: Gomory: 1 Zero half: 5 Mod-K: 1 Explored 27 nodes (188 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.340000000000e+02, best bound 3.340000000000e+02, gap 0.0% adding cut for [(10, 12), (11, 13), (12, 13)] Optimize a model with 55 rows, 78 columns and 604 nonzeros Presolve removed 1 rows and 0 columns Presolve time: 0.00s Presolved: 54 rows, 78 columns, 601 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 78 integer (66 binary) Found heuristic solution: objective 604.0000000 Root relaxation: objective 3.270000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 327.00000 0 10 604.00000 327.00000 45.9% - 0s Another try with MIP start H 0 0 336.0000000 327.00000 2.68% - 0s 0 0 328.00000 0 12 336.00000 328.00000 2.38% - 0s 0 0 328.00000 0 9 336.00000 328.00000 2.38% - 0s 0 0 328.00000 0 13 336.00000 328.00000 2.38% - 0s 0 0 329.00000 0 10 336.00000 329.00000 2.08% - 0s 0 0 330.00000 0 15 336.00000 330.00000 1.79% - 0s 0 0 330.00000 0 17 336.00000 330.00000 1.79% - 0s 0 0 330.00000 0 18 336.00000 330.00000 1.79% - 0s 0 0 330.00000 0 11 336.00000 330.00000 1.79% - 0s 0 0 330.00000 0 11 336.00000 330.00000 1.79% - 0s 0 2 330.00000 0 11 336.00000 330.00000 1.79% - 0s Cutting planes: Gomory: 3 Implied bound: 1 Zero half: 1 Explored 17 nodes (220 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.360000000000e+02, best bound 3.360000000000e+02, gap 0.0% Gurobi 5.0.1 (linux64) logging started Fri Dec 7 08:09:03 2012