Optimize a model with 101 rows, 5050 columns and 10100 nonzeros Presolve time: 0.03s Presolved: 101 rows, 5050 columns, 10100 nonzeros Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 1553.0000000 Root relaxation: objective 8.190000e+02, 143 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 819.00000 0 20 1553.00000 819.00000 47.3% - 0s H 0 0 912.0000000 819.00000 10.2% - 0s 0 0 821.00000 0 8 912.00000 821.00000 10.0% - 0s H 0 0 822.0000000 821.00000 0.12% - 0s Cutting planes: MIR: 1 Zero half: 6 Explored 0 nodes (166 simplex iterations) in 0.06 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.220000000000e+02, best bound 8.220000000000e+02, gap 0.0% adding cut for [(2, 51), (4, 78), (4, 80), (6, 61), (6, 85), (8, 83), (8, 89), (9, 46), (9, 47), (11, 32), (11, 63), (12, 20), (12, 65), (18, 46), (18, 85), (19, 84), (20, 49), (21, 31), (21, 67), (31, 71), (32, 71), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (51, 77), (61, 84), (63, 89), (66, 67), (66, 72), (77, 78), (79, 80)] adding cut for [(38, 99), (38, 101), (39, 87), (45, 92), (15, 39), (15, 45), (17, 87), (17, 62), (94, 99), (86, 94), (92, 101), (62, 86)] adding cut for [(5, 55), (5, 57), (40, 68), (55, 56), (24, 68), (24, 57), (26, 40), (26, 56)] adding cut for [(3, 88), (3, 58), (43, 44), (43, 88), (16, 44), (16, 58)] adding cut for [(96, 97), (96, 98), (97, 100), (60, 100), (60, 93), (93, 98)] adding cut for [(10, 52), (10, 82), (34, 52), (34, 82)] adding cut for [(42, 76), (75, 76), (23, 42), (23, 75)] adding cut for [(25, 30), (25, 81), (69, 81), (30, 69)] adding cut for [(73, 74), (22, 73), (22, 74)] adding cut for [(64, 91), (33, 64), (33, 91)] Optimize a model with 111 rows, 5050 columns and 10914 nonzeros Presolve time: 0.03s Presolved: 111 rows, 5050 columns, 10914 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.275000e+02, 164 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 827.50000 0 37 3624.00000 827.50000 77.2% - 0s Another try with MIP start H 0 0 888.0000000 827.50000 6.81% - 0s 0 0 829.00000 0 20 888.00000 829.00000 6.64% - 0s 0 0 829.00000 0 31 888.00000 829.00000 6.64% - 0s H 0 0 830.0000000 829.00000 0.12% - 0s 0 0 829.00000 0 6 830.00000 829.00000 0.12% - 0s 0 0 cutoff 0 830.00000 829.00083 0.12% - 0s Explored 0 nodes (239 simplex iterations) in 0.09 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.300000000000e+02, best bound 8.300000000000e+02, gap 0.0% adding cut for [(2, 51), (4, 78), (4, 80), (6, 61), (6, 85), (8, 83), (8, 89), (9, 46), (9, 47), (10, 36), (10, 52), (11, 33), (11, 63), (12, 20), (12, 63), (18, 46), (18, 85), (19, 84), (20, 49), (21, 31), (21, 52), (31, 71), (32, 71), (32, 89), (33, 91), (34, 80), (34, 82), (35, 36), (35, 79), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (51, 77), (61, 84), (64, 65), (64, 91), (77, 78), (79, 82)] adding cut for [(3, 58), (3, 88), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (38, 99), (38, 101), (39, 45), (39, 87), (43, 44), (60, 93), (60, 94), (62, 86), (86, 92), (88, 98), (92, 101), (93, 99), (94, 100), (96, 97), (96, 98), (97, 100)] adding cut for [(5, 56), (5, 57), (40, 68), (24, 68), (24, 57), (26, 40), (26, 56)] adding cut for [(25, 30), (25, 55), (69, 81), (30, 69), (55, 81)] adding cut for [(73, 75), (74, 75), (22, 73), (22, 74)] adding cut for [(42, 76), (23, 42), (23, 76)] adding cut for [(66, 72), (66, 67), (67, 72)] Optimize a model with 118 rows, 5050 columns and 12053 nonzeros Presolve time: 0.03s Presolved: 118 rows, 5050 columns, 12053 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.316000e+02, 178 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 831.60000 0 39 3624.00000 831.60000 77.1% - 0s Another try with MIP start H 0 0 886.0000000 831.60000 6.14% - 0s 0 0 833.00000 0 30 886.00000 833.00000 5.98% - 0s 0 0 833.00000 0 8 886.00000 833.00000 5.98% - 0s H 0 0 837.0000000 833.00000 0.48% - 0s H 0 0 833.0000000 833.00000 0.0% - 0s Cutting planes: MIR: 1 Zero half: 6 Explored 0 nodes (216 simplex iterations) in 0.09 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.330000000000e+02, best bound 8.330000000000e+02, gap 0.0% adding cut for [(2, 51), (3, 58), (3, 74), (4, 69), (4, 78), (5, 55), (5, 56), (16, 44), (16, 58), (22, 73), (22, 74), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 81), (40, 68), (42, 75), (43, 44), (43, 88), (51, 77), (57, 76), (69, 81), (73, 75), (77, 78), (88, 98), (95, 96), (96, 98)] adding cut for [(97, 100), (6, 85), (6, 61), (60, 94), (60, 93), (94, 100), (93, 99), (17, 87), (17, 62), (18, 85), (18, 87), (19, 84), (86, 92), (38, 99), (38, 101), (92, 101), (61, 84), (62, 86)] adding cut for [(34, 80), (34, 82), (67, 72), (36, 66), (10, 82), (10, 52), (66, 72), (79, 80), (35, 36), (35, 79), (21, 67), (21, 52)] adding cut for [(64, 91), (32, 89), (32, 71), (33, 91), (31, 33), (31, 71), (11, 64), (11, 63), (63, 89)] adding cut for [(37, 48), (37, 50), (12, 65), (12, 20), (50, 65), (20, 48)] adding cut for [(8, 49), (8, 83), (49, 83)] adding cut for [(9, 46), (9, 47), (46, 47)] adding cut for [(39, 45), (15, 39), (15, 45)] Optimize a model with 126 rows, 5050 columns and 12878 nonzeros Presolve time: 0.03s Presolved: 126 rows, 5050 columns, 12878 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.333333e+02, 191 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 833.33333 0 39 3624.00000 833.33333 77.0% - 0s Another try with MIP start H 0 0 916.0000000 833.33333 9.02% - 0s 0 0 833.66667 0 29 916.00000 833.66667 8.99% - 0s 0 0 833.83333 0 30 916.00000 833.83333 8.97% - 0s 0 0 834.02778 0 65 916.00000 834.02778 8.95% - 0s 0 0 834.16667 0 74 916.00000 834.16667 8.93% - 0s H 0 0 838.0000000 834.16667 0.46% - 0s 0 0 834.28125 0 59 838.00000 834.28125 0.44% - 0s 0 0 834.28125 0 22 838.00000 834.28125 0.44% - 0s 0 0 834.33333 0 69 838.00000 834.33333 0.44% - 0s 0 0 834.40000 0 64 838.00000 834.40000 0.43% - 0s 0 0 834.50000 0 66 838.00000 834.50000 0.42% - 0s 0 0 834.50000 0 64 838.00000 834.50000 0.42% - 0s 0 0 834.50000 0 60 838.00000 834.50000 0.42% - 0s 0 0 834.50000 0 14 838.00000 834.50000 0.42% - 0s 0 0 834.60000 0 78 838.00000 834.60000 0.41% - 0s 0 0 834.83333 0 38 838.00000 834.83333 0.38% - 0s 0 0 834.87931 0 77 838.00000 834.87931 0.37% - 0s * 0 0 0 835.0000000 835.00000 0.0% - 0s Cutting planes: Gomory: 3 MIR: 1 Zero half: 30 Explored 0 nodes (609 simplex iterations) in 0.17 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.350000000000e+02, best bound 8.350000000000e+02, gap 0.0% adding cut for [(2, 51), (4, 78), (4, 80), (6, 61), (6, 85), (8, 83), (8, 89), (9, 46), (9, 47), (10, 52), (10, 82), (11, 33), (11, 63), (12, 20), (12, 63), (18, 46), (18, 62), (19, 84), (20, 49), (21, 31), (21, 67), (31, 71), (32, 71), (32, 89), (33, 91), (34, 52), (34, 80), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (51, 77), (61, 84), (62, 85), (64, 65), (64, 91), (66, 72), (67, 72), (77, 78), (79, 82)] adding cut for [(3, 58), (3, 74), (5, 26), (5, 40), (13, 81), (16, 44), (16, 58), (22, 73), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 69), (40, 68), (42, 76), (43, 44), (43, 88), (55, 56), (57, 76), (69, 81), (73, 75), (88, 98), (96, 98)] adding cut for [(97, 100), (38, 99), (38, 101), (92, 101), (86, 92), (86, 94), (60, 97), (60, 93), (93, 99), (94, 100)] adding cut for [(17, 87), (17, 45), (39, 87), (15, 39), (15, 45)] Optimize a model with 130 rows, 5050 columns and 14301 nonzeros Presolve time: 0.03s Presolved: 130 rows, 5050 columns, 14301 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.360833e+02, 194 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 836.08333 0 30 3624.00000 836.08333 76.9% - 0s Another try with MIP start H 0 0 856.0000000 836.08333 2.33% - 0s 0 0 836.25000 0 24 856.00000 836.25000 2.31% - 0s 0 0 836.25000 0 36 856.00000 836.25000 2.31% - 0s 0 0 836.25000 0 44 856.00000 836.25000 2.31% - 0s 0 0 836.25000 0 30 856.00000 836.25000 2.31% - 0s 0 0 836.45000 0 50 856.00000 836.45000 2.28% - 0s 0 0 836.76923 0 58 856.00000 836.76923 2.25% - 0s 0 0 836.77778 0 67 856.00000 836.77778 2.25% - 0s 0 0 836.88462 0 83 856.00000 836.88462 2.23% - 0s 0 0 836.88462 0 83 856.00000 836.88462 2.23% - 0s 0 0 836.88462 0 83 856.00000 836.88462 2.23% - 0s H 0 0 846.0000000 836.88462 1.08% - 0s H 0 0 843.0000000 836.88462 0.73% - 0s 0 2 837.00000 0 83 843.00000 837.00000 0.71% - 0s * 10 6 7 838.0000000 837.00000 0.12% 9.0 0s Cutting planes: Zero half: 14 Explored 13 nodes (621 simplex iterations) in 0.25 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.380000000000e+02, best bound 8.380000000000e+02, gap 0.0% adding cut for [(2, 51), (3, 58), (3, 74), (4, 78), (4, 80), (5, 26), (5, 40), (10, 52), (10, 82), (13, 77), (13, 81), (16, 44), (16, 58), (21, 52), (21, 67), (22, 73), (22, 74), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 79), (34, 80), (34, 82), (35, 36), (35, 79), (36, 66), (40, 68), (42, 75), (43, 44), (43, 88), (51, 77), (55, 56), (57, 76), (66, 72), (67, 72), (69, 78), (69, 81), (73, 75), (88, 98), (95, 96), (96, 98)] adding cut for [(32, 71), (32, 89), (33, 91), (37, 48), (37, 50), (8, 83), (8, 89), (64, 91), (11, 64), (11, 63), (12, 65), (12, 20), (48, 49), (49, 83), (50, 65), (20, 63), (31, 33), (31, 71)] adding cut for [(39, 87), (45, 92), (15, 39), (15, 45), (17, 87), (17, 62), (86, 101), (92, 101), (62, 86)] adding cut for [(6, 85), (6, 61), (9, 47), (9, 84), (46, 47), (18, 46), (18, 85), (61, 84)] adding cut for [(93, 99), (38, 99), (38, 93)] adding cut for [(60, 100), (60, 94), (94, 100)] Optimize a model with 136 rows, 5050 columns and 15559 nonzeros Presolve time: 0.03s Presolved: 136 rows, 5050 columns, 15559 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.400000e+02, 224 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 840.00000 0 22 3624.00000 840.00000 76.8% - 0s Another try with MIP start H 0 0 915.0000000 840.00000 8.20% - 0s 0 0 840.50000 0 46 915.00000 840.50000 8.14% - 0s 0 0 841.00000 0 42 915.00000 841.00000 8.09% - 0s H 0 0 847.0000000 841.00000 0.71% - 0s 0 0 841.00000 0 16 847.00000 841.00000 0.71% - 0s 0 0 841.00000 0 28 847.00000 841.00000 0.71% - 0s * 0 0 0 841.0000000 841.00000 0.0% - 0s Cutting planes: Gomory: 10 MIR: 2 Zero half: 6 Explored 0 nodes (534 simplex iterations) in 0.13 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.410000000000e+02, best bound 8.410000000000e+02, gap 0.0% adding cut for [(3, 22), (3, 58), (5, 26), (5, 40), (6, 61), (6, 85), (8, 83), (8, 89), (9, 46), (9, 47), (11, 63), (11, 64), (12, 20), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (20, 49), (21, 33), (21, 67), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (42, 76), (43, 44), (47, 48), (49, 83), (50, 65), (55, 56), (57, 76), (61, 84), (62, 86), (63, 89), (64, 91), (66, 67), (66, 72), (73, 74), (73, 75), (86, 92), (88, 98), (92, 101), (93, 98), (93, 99)] adding cut for [(32, 71), (2, 51), (34, 80), (34, 82), (4, 78), (4, 80), (69, 78), (69, 81), (10, 82), (10, 52), (13, 77), (13, 81), (51, 77), (31, 71), (31, 52)] adding cut for [(97, 100), (60, 97), (60, 94), (94, 100)] Optimize a model with 139 rows, 5050 columns and 17896 nonzeros Presolve time: 0.03s Presolved: 139 rows, 5050 columns, 17896 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.410000e+02, 251 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 841.00000 0 22 3624.00000 841.00000 76.8% - 0s Another try with MIP start H 0 0 894.0000000 841.00000 5.93% - 0s 0 0 841.50000 0 34 894.00000 841.50000 5.87% - 0s 0 0 841.50000 0 20 894.00000 841.50000 5.87% - 0s 0 0 841.50000 0 28 894.00000 841.50000 5.87% - 0s 0 0 841.50000 0 6 894.00000 841.50000 5.87% - 0s 0 0 841.50000 0 6 894.00000 841.50000 5.87% - 0s H 0 0 842.0000000 841.50000 0.06% - 0s Cutting planes: Zero half: 2 Explored 0 nodes (308 simplex iterations) in 0.17 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.420000000000e+02, best bound 8.420000000000e+02, gap 0.0% adding cut for [(3, 22), (3, 58), (4, 78), (4, 80), (5, 55), (5, 56), (13, 81), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 80), (38, 93), (38, 99), (39, 45), (39, 87), (40, 68), (42, 75), (43, 44), (57, 76), (60, 93), (60, 94), (62, 86), (69, 78), (69, 81), (73, 74), (73, 75), (86, 92), (92, 101), (94, 100), (97, 100), (99, 101)] adding cut for [(6, 61), (6, 85), (8, 83), (8, 89), (9, 46), (9, 47), (11, 63), (11, 71), (12, 20), (12, 63), (18, 46), (18, 85), (19, 84), (20, 49), (21, 31), (21, 67), (31, 71), (32, 89), (33, 67), (33, 91), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (61, 84), (64, 65), (64, 91)] adding cut for [(34, 82), (34, 52), (35, 79), (10, 35), (10, 52), (79, 82)] adding cut for [(66, 72), (36, 72), (36, 66)] Optimize a model with 143 rows, 5050 columns and 19266 nonzeros Presolve time: 0.04s Presolved: 143 rows, 5050 columns, 19266 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.418333e+02, 232 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 841.83333 0 61 3624.00000 841.83333 76.8% - 0s Another try with MIP start H 0 0 846.0000000 841.83333 0.49% - 0s H 0 0 844.0000000 841.83333 0.26% - 0s 0 0 842.33333 0 44 844.00000 842.33333 0.20% - 0s 0 0 842.33333 0 45 844.00000 842.33333 0.20% - 0s 0 0 842.40000 0 23 844.00000 842.40000 0.19% - 0s 0 0 842.50000 0 21 844.00000 842.50000 0.18% - 0s 0 0 842.50000 0 25 844.00000 842.50000 0.18% - 0s H 0 0 843.0000000 842.50000 0.06% - 0s Cutting planes: Gomory: 3 Clique: 1 Zero half: 1 Explored 0 nodes (445 simplex iterations) in 0.13 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.430000000000e+02, best bound 8.430000000000e+02, gap 0.0% adding cut for [(3, 58), (3, 88), (4, 78), (4, 80), (8, 83), (8, 89), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (20, 49), (21, 31), (21, 52), (25, 30), (25, 81), (30, 79), (31, 71), (32, 89), (33, 67), (33, 91), (34, 80), (34, 82), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (39, 45), (39, 87), (43, 44), (47, 48), (49, 83), (50, 65), (62, 85), (64, 65), (64, 91), (66, 67), (66, 72), (69, 78), (69, 81), (88, 98), (96, 98)] adding cut for [(5, 22), (5, 55), (40, 68), (73, 74), (73, 75), (24, 68), (24, 57), (57, 76), (22, 74), (55, 56), (23, 76), (23, 42), (26, 40), (26, 56), (42, 75)] adding cut for [(97, 100), (6, 61), (6, 94), (60, 100), (60, 93), (93, 99), (19, 84), (86, 92), (86, 94), (38, 99), (38, 101), (92, 101), (61, 84)] Optimize a model with 146 rows, 5050 columns and 20947 nonzeros Presolve time: 0.04s Presolved: 146 rows, 5050 columns, 20947 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.446667e+02, 226 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 844.66667 0 68 3624.00000 844.66667 76.7% - 0s Another try with MIP start H 0 0 943.0000000 844.66667 10.4% - 0s 0 0 846.28571 0 81 943.00000 846.28571 10.3% - 0s H 0 0 848.0000000 846.28571 0.20% - 0s 0 0 846.36364 0 58 848.00000 846.36364 0.19% - 0s 0 0 846.36364 0 41 848.00000 846.36364 0.19% - 0s 0 0 846.63333 0 59 848.00000 846.63333 0.16% - 0s 0 0 846.77922 0 59 848.00000 846.77922 0.14% - 0s 0 0 846.78313 0 62 848.00000 846.78313 0.14% - 0s Cutting planes: Gomory: 6 Clique: 1 Zero half: 5 Explored 0 nodes (454 simplex iterations) in 0.18 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.480000000000e+02, best bound 8.480000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (4, 69), (4, 78), (6, 61), (6, 85), (8, 83), (8, 89), (9, 46), (9, 83), (10, 52), (10, 82), (15, 39), (15, 45), (17, 45), (17, 62), (18, 85), (18, 87), (21, 31), (21, 52), (25, 30), (25, 55), (30, 35), (31, 71), (32, 71), (32, 89), (34, 80), (34, 82), (35, 79), (38, 99), (38, 101), (39, 87), (46, 84), (51, 77), (55, 81), (60, 93), (60, 94), (61, 84), (62, 86), (69, 81), (77, 78), (79, 80), (86, 92), (92, 101), (93, 99), (94, 100), (95, 97), (97, 100)] adding cut for [(64, 65), (64, 91), (33, 91), (37, 47), (37, 50), (11, 33), (11, 63), (12, 20), (12, 63), (47, 48), (48, 49), (50, 65), (20, 49)] adding cut for [(5, 56), (5, 57), (40, 68), (24, 68), (24, 76), (57, 76), (26, 40), (26, 56)] adding cut for [(66, 67), (67, 72), (36, 72), (36, 66)] Optimize a model with 150 rows, 5050 columns and 22235 nonzeros Presolve time: 0.04s Presolved: 150 rows, 5050 columns, 22235 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.449886e+02, 246 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 844.98864 0 72 3624.00000 844.98864 76.7% - 0s Another try with MIP start H 0 0 857.0000000 844.98864 1.40% - 0s 0 0 846.46667 0 60 857.00000 846.46667 1.23% - 0s 0 0 846.46667 0 78 857.00000 846.46667 1.23% - 0s 0 0 847.30959 0 71 857.00000 847.30959 1.13% - 0s 0 0 847.37500 0 76 857.00000 847.37500 1.12% - 0s H 0 0 853.0000000 847.37500 0.66% - 0s 0 0 847.66667 0 33 853.00000 847.66667 0.63% - 0s H 0 0 849.0000000 847.66667 0.16% - 0s 0 1 848.00000 0 31 849.00000 848.00000 0.12% - 0s H 1 1 848.0000000 848.00000 0.0% 17.0 0s Cutting planes: Gomory: 4 Zero half: 4 Explored 1 nodes (667 simplex iterations) in 0.25 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.480000000000e+02, best bound 8.480000000000e+02, gap 0.0% adding cut for [(3, 58), (3, 74), (5, 26), (5, 40), (6, 61), (6, 85), (9, 46), (9, 47), (15, 39), (15, 45), (16, 44), (16, 58), (17, 45), (17, 62), (18, 85), (18, 87), (22, 73), (22, 74), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 56), (30, 79), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 99), (38, 101), (39, 87), (40, 68), (42, 75), (43, 44), (43, 88), (46, 84), (47, 48), (50, 65), (57, 76), (60, 93), (60, 94), (61, 84), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (73, 75), (86, 92), (88, 98), (92, 101), (93, 99), (94, 100), (95, 97), (96, 98), (97, 100)] adding cut for [(2, 51), (2, 70), (4, 78), (4, 80), (8, 83), (8, 89), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (20, 49), (21, 31), (21, 52), (31, 71), (32, 89), (34, 80), (34, 82), (49, 83), (51, 77), (77, 78)] adding cut for [(69, 81), (55, 81), (55, 69)] Optimize a model with 153 rows, 5050 columns and 24382 nonzeros Presolve time: 0.04s Presolved: 153 rows, 5050 columns, 24382 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.452721e+02, 283 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 845.27206 0 86 3624.00000 845.27206 76.7% - 0s Another try with MIP start H 0 0 861.0000000 845.27206 1.83% - 0s 0 0 847.58333 0 82 861.00000 847.58333 1.56% - 0s 0 0 847.58333 0 82 861.00000 847.58333 1.56% - 0s 0 0 847.98974 0 77 861.00000 847.98974 1.51% - 0s 0 0 848.20039 0 84 861.00000 848.20039 1.49% - 0s 0 0 848.41379 0 86 861.00000 848.41379 1.46% - 0s 0 0 848.42222 0 89 861.00000 848.42222 1.46% - 0s 0 0 848.42222 0 87 861.00000 848.42222 1.46% - 0s 0 0 848.42222 0 89 861.00000 848.42222 1.46% - 0s 0 0 848.42222 0 90 861.00000 848.42222 1.46% - 0s 0 0 848.42222 0 87 861.00000 848.42222 1.46% - 0s H 0 0 856.0000000 848.42222 0.89% - 0s H 0 0 855.0000000 848.42222 0.77% - 0s H 0 0 854.0000000 848.42222 0.65% - 0s H 0 0 850.0000000 848.42222 0.19% - 0s 0 0 cutoff 0 850.00000 850.00000 0.0% - 0s Cutting planes: Gomory: 3 MIR: 2 Zero half: 5 Explored 1 nodes (740 simplex iterations) in 0.51 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.500000000000e+02, best bound 8.500000000000e+02, gap 0.0% adding cut for [(3, 22), (5, 56), (5, 73), (6, 61), (6, 85), (15, 39), (15, 45), (16, 44), (16, 58), (17, 45), (17, 62), (18, 85), (18, 87), (19, 84), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (38, 99), (38, 101), (39, 87), (40, 68), (42, 58), (43, 44), (43, 88), (57, 76), (60, 93), (60, 94), (61, 84), (62, 86), (73, 74), (75, 76), (86, 92), (88, 98), (92, 101), (93, 99), (94, 100), (96, 97), (96, 98), (97, 100)] adding cut for [(51, 77), (66, 72), (66, 67), (35, 79), (35, 36), (4, 80), (4, 30), (69, 78), (69, 81), (10, 82), (10, 52), (77, 78), (79, 80), (21, 67), (21, 52), (34, 51), (34, 82), (55, 81), (25, 55), (25, 30), (36, 72)] adding cut for [(37, 48), (37, 50), (8, 49), (8, 83), (9, 46), (9, 83), (12, 65), (12, 20), (46, 47), (47, 48), (50, 65), (20, 49)] Optimize a model with 156 rows, 5050 columns and 25604 nonzeros Presolve time: 0.04s Presolved: 156 rows, 5050 columns, 25604 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.467667e+02, 293 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 846.76667 0 77 3624.00000 846.76667 76.6% - 0s Another try with MIP start H 0 0 855.0000000 846.76667 0.96% - 0s 0 0 848.66867 0 87 855.00000 848.66867 0.74% - 0s 0 0 848.66867 0 72 855.00000 848.66867 0.74% - 0s 0 0 848.88889 0 74 855.00000 848.88889 0.71% - 0s 0 0 848.88889 0 70 855.00000 848.88889 0.71% - 0s H 0 0 851.0000000 848.88889 0.25% - 0s 0 1 849.02703 0 70 851.00000 849.02703 0.23% - 0s * 11 7 9 850.0000000 850.00000 0.0% 1.3 0s Cutting planes: Gomory: 6 Clique: 1 Zero half: 5 Explored 11 nodes (1054 simplex iterations) in 0.34 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.500000000000e+02, best bound 8.500000000000e+02, gap 0.0% adding cut for [(3, 58), (3, 88), (6, 61), (6, 85), (8, 83), (8, 89), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 64), (12, 20), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 62), (18, 85), (20, 49), (21, 33), (21, 67), (31, 52), (31, 71), (32, 71), (33, 91), (34, 80), (34, 82), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 60), (38, 99), (39, 45), (39, 87), (43, 44), (46, 84), (47, 48), (49, 83), (50, 65), (60, 93), (61, 84), (63, 89), (64, 91), (66, 67), (66, 72), (79, 80), (86, 92), (86, 94), (88, 98), (92, 101), (93, 98), (94, 100), (97, 100), (99, 101)] adding cut for [(2, 51), (2, 70), (4, 30), (4, 78), (5, 26), (5, 40), (13, 55), (13, 77), (22, 74), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 56), (40, 68), (42, 75), (51, 77), (55, 81), (57, 76), (69, 78), (69, 81), (73, 74), (73, 75)] Optimize a model with 158 rows, 5050 columns and 27759 nonzeros Presolve time: 0.04s Presolved: 158 rows, 5050 columns, 27759 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.488000e+02, 289 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 848.80000 0 64 3624.00000 848.80000 76.6% - 0s Another try with MIP start H 0 0 931.0000000 848.80000 8.83% - 0s 0 0 850.50000 0 62 931.00000 850.50000 8.65% - 0s 0 0 850.69697 0 77 931.00000 850.69697 8.63% - 0s H 0 0 858.0000000 850.69697 0.85% - 0s 0 0 850.69697 0 80 858.00000 850.69697 0.85% - 0s 0 0 850.69697 0 65 858.00000 850.69697 0.85% - 0s 0 0 851.00000 0 79 858.00000 851.00000 0.82% - 0s 0 0 851.02273 0 84 858.00000 851.02273 0.81% - 0s 0 0 851.03571 0 97 858.00000 851.03571 0.81% - 0s 0 0 851.27530 0 77 858.00000 851.27530 0.78% - 0s 0 0 851.27530 0 80 858.00000 851.27530 0.78% - 0s 0 0 851.27530 0 82 858.00000 851.27530 0.78% - 0s H 0 0 854.0000000 851.27530 0.32% - 0s 0 1 851.50000 0 69 854.00000 851.50000 0.29% - 0s * 4 1 4 852.0000000 851.97304 0.00% 19.0 0s Cutting planes: Gomory: 6 Zero half: 8 Explored 5 nodes (828 simplex iterations) in 0.45 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.520000000000e+02, best bound 8.520000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (4, 78), (4, 80), (5, 26), (5, 40), (6, 61), (6, 85), (8, 83), (8, 89), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 64), (12, 20), (12, 65), (13, 55), (13, 77), (18, 46), (18, 85), (19, 84), (20, 49), (21, 52), (21, 67), (22, 41), (22, 74), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 56), (30, 79), (31, 33), (31, 71), (33, 91), (34, 80), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (40, 68), (42, 75), (47, 48), (49, 83), (50, 65), (51, 77), (55, 81), (57, 76), (61, 84), (63, 89), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (73, 74), (73, 75)] adding cut for [(15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (38, 99), (38, 101), (39, 45), (39, 87), (43, 44), (58, 88), (60, 93), (60, 94), (62, 86), (86, 92), (88, 98), (92, 101), (93, 99), (94, 100), (95, 97), (96, 98), (97, 100)] Optimize a model with 160 rows, 5050 columns and 30051 nonzeros Presolve time: 0.05s Presolved: 160 rows, 5050 columns, 30051 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.497865e+02, 299 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 849.78646 0 94 3624.00000 849.78646 76.6% - 0s Another try with MIP start H 0 0 861.0000000 849.78646 1.30% - 0s 0 0 851.78125 0 91 861.00000 851.78125 1.07% - 0s 0 0 851.78125 0 92 861.00000 851.78125 1.07% - 0s 0 0 852.39646 0 85 861.00000 852.39646 1.00% - 0s 0 0 852.66667 0 62 861.00000 852.66667 0.97% - 0s H 0 0 857.0000000 852.66667 0.51% - 0s 0 2 852.81502 0 62 857.00000 852.81502 0.49% - 0s H 28 3 854.0000000 853.28314 0.08% 35.7 0s Cutting planes: Gomory: 19 MIR: 4 Zero half: 8 Explored 28 nodes (1713 simplex iterations) in 0.59 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.540000000000e+02, best bound 8.540000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (5, 26), (5, 40), (10, 52), (10, 82), (13, 81), (21, 52), (21, 67), (22, 74), (23, 75), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 79), (34, 80), (34, 82), (35, 36), (35, 79), (36, 66), (40, 68), (55, 56), (57, 76), (66, 72), (67, 72), (69, 78), (69, 81), (73, 74), (73, 75)] adding cut for [(2, 51), (2, 71), (8, 49), (8, 89), (9, 47), (9, 83), (11, 63), (11, 64), (12, 20), (12, 65), (20, 63), (31, 33), (31, 71), (32, 89), (33, 91), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (51, 77), (64, 91)] adding cut for [(96, 98), (3, 88), (3, 58), (38, 96), (38, 99), (39, 45), (39, 87), (42, 58), (43, 44), (15, 43), (15, 45), (16, 42), (16, 44), (17, 87), (17, 62), (99, 101), (86, 92), (88, 98), (92, 101), (62, 86)] adding cut for [(6, 85), (6, 61), (46, 84), (18, 46), (18, 85), (61, 84)] adding cut for [(60, 100), (60, 93), (93, 94), (94, 100)] Optimize a model with 165 rows, 5050 columns and 31043 nonzeros Presolve time: 0.05s Presolved: 165 rows, 5050 columns, 31043 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.498056e+02, 271 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 849.80556 0 93 3624.00000 849.80556 76.6% - 0s Another try with MIP start H 0 0 862.0000000 849.80556 1.41% - 0s 0 0 852.07430 0 90 862.00000 852.07430 1.15% - 0s 0 0 852.07430 0 93 862.00000 852.07430 1.15% - 0s 0 0 852.65510 0 87 862.00000 852.65510 1.08% - 0s H 0 0 856.0000000 852.65510 0.39% - 0s 0 0 852.65858 0 89 856.00000 852.65858 0.39% - 0s 0 2 852.98435 0 88 856.00000 852.98435 0.35% - 0s * 23 9 19 855.0000000 853.50967 0.17% 31.9 0s Cutting planes: Gomory: 15 MIR: 5 Zero half: 14 Explored 35 nodes (1546 simplex iterations) in 0.59 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.550000000000e+02, best bound 8.550000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (5, 55), (5, 56), (6, 85), (6, 100), (8, 83), (8, 89), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (13, 81), (15, 43), (15, 45), (16, 42), (16, 44), (17, 62), (17, 87), (18, 46), (18, 85), (20, 49), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 69), (31, 52), (31, 71), (32, 89), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 93), (38, 99), (39, 45), (39, 87), (40, 68), (43, 44), (47, 48), (49, 83), (50, 65), (51, 77), (57, 76), (60, 93), (60, 94), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (69, 81), (73, 75), (73, 76), (77, 78), (79, 80), (86, 92), (92, 101), (94, 100), (99, 101)] Optimize a model with 166 rows, 5050 columns and 33893 nonzeros Presolve time: 0.05s Presolved: 166 rows, 5050 columns, 33893 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.506314e+02, 310 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 850.63144 0 97 3624.00000 850.63144 76.5% - 0s Another try with MIP start H 0 0 860.0000000 850.63144 1.09% - 0s 0 0 852.22523 0 96 860.00000 852.22523 0.90% - 0s 0 0 852.22523 0 95 860.00000 852.22523 0.90% - 0s 0 0 852.83442 0 97 860.00000 852.83442 0.83% - 0s 0 0 853.55604 0 102 860.00000 853.55604 0.75% - 0s H 0 0 859.0000000 853.55604 0.63% - 0s 0 2 854.13451 0 102 859.00000 854.13451 0.57% - 0s H 1 2 857.0000000 854.13451 0.33% 3.0 0s * 26 8 19 856.0000000 854.52106 0.17% 34.3 0s Cutting planes: Gomory: 21 MIR: 3 Zero half: 20 Explored 35 nodes (1684 simplex iterations) in 0.69 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.560000000000e+02, best bound 8.560000000000e+02, gap 0.0% adding cut for [(4, 69), (4, 78), (5, 40), (5, 55), (6, 61), (6, 85), (8, 19), (8, 83), (9, 46), (9, 47), (10, 52), (10, 82), (12, 20), (12, 65), (13, 81), (15, 39), (15, 45), (16, 44), (16, 58), (17, 45), (17, 62), (18, 85), (18, 87), (20, 49), (21, 52), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 26), (25, 30), (26, 56), (30, 80), (34, 51), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 99), (38, 101), (39, 87), (40, 68), (42, 58), (43, 44), (43, 88), (46, 84), (47, 48), (49, 83), (50, 65), (51, 77), (55, 56), (57, 76), (60, 93), (60, 94), (61, 84), (62, 86), (66, 72), (67, 72), (69, 81), (75, 76), (77, 78), (79, 80), (86, 92), (88, 98), (92, 101), (93, 99), (94, 100), (96, 97), (96, 98), (97, 100)] Optimize a model with 167 rows, 5050 columns and 36594 nonzeros Presolve time: 0.06s Presolved: 167 rows, 5050 columns, 36594 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.508227e+02, 300 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 850.82273 0 95 3624.00000 850.82273 76.5% - 0s Another try with MIP start H 0 0 871.0000000 850.82273 2.32% - 0s 0 0 852.70474 0 107 871.00000 852.70474 2.10% - 0s 0 0 852.70474 0 95 871.00000 852.70474 2.10% - 0s 0 0 852.70474 0 111 871.00000 852.70474 2.10% - 0s 0 0 853.71805 0 110 871.00000 853.71805 1.98% - 0s 0 0 854.39199 0 109 871.00000 854.39199 1.91% - 0s 0 0 854.57882 0 110 871.00000 854.57882 1.89% - 0s 0 0 854.64876 0 104 871.00000 854.64876 1.88% - 0s 0 2 855.12698 0 104 871.00000 855.12698 1.82% - 0s H 1 2 857.0000000 855.12698 0.22% 5.0 0s Cutting planes: Gomory: 16 MIR: 1 Zero half: 5 Explored 20 nodes (1529 simplex iterations) in 0.89 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.570000000000e+02, best bound 8.570000000000e+02, gap 0.0% adding cut for [(3, 88), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 76), (38, 99), (38, 101), (39, 45), (39, 87), (42, 58), (43, 44), (62, 86), (73, 74), (73, 75), (75, 76), (86, 92), (88, 98), (92, 101), (93, 98), (93, 99)] adding cut for [(51, 77), (2, 70), (2, 71), (67, 72), (36, 66), (10, 72), (10, 52), (66, 67), (79, 82), (34, 51), (34, 82), (35, 36), (35, 79), (21, 52), (21, 31), (31, 71)] adding cut for [(4, 78), (4, 80), (69, 78), (69, 81), (40, 68), (24, 68), (24, 57), (55, 81), (25, 56), (25, 30), (26, 40), (26, 56), (30, 80), (5, 57), (5, 55)] adding cut for [(64, 65), (64, 91), (33, 91), (37, 48), (37, 50), (11, 33), (11, 63), (12, 20), (12, 63), (50, 65), (20, 48)] Optimize a model with 171 rows, 5050 columns and 37215 nonzeros Presolve time: 0.06s Presolved: 171 rows, 5050 columns, 37215 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.516763e+02, 356 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 851.67628 0 98 3624.00000 851.67628 76.5% - 0s Another try with MIP start H 0 0 864.0000000 851.67628 1.43% - 0s 0 0 852.79634 0 105 864.00000 852.79634 1.30% - 0s 0 0 852.79634 0 95 864.00000 852.79634 1.30% - 0s 0 0 853.13419 0 112 864.00000 853.13419 1.26% - 0s 0 0 853.57567 0 116 864.00000 853.57567 1.21% - 0s 0 0 854.20064 0 126 864.00000 854.20064 1.13% - 0s 0 0 854.34075 0 119 864.00000 854.34075 1.12% - 0s H 0 0 859.0000000 854.34075 0.54% - 0s 0 2 854.69231 0 119 859.00000 854.69231 0.50% - 0s * 45 15 17 858.0000000 855.11302 0.34% 26.3 1s * 124 0 17 857.0000000 857.00000 0.0% 18.7 1s Cutting planes: Gomory: 15 MIR: 15 Zero half: 17 Explored 125 nodes (3157 simplex iterations) in 1.12 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.570000000000e+02, best bound 8.570000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (4, 69), (4, 78), (5, 26), (5, 55), (6, 61), (6, 85), (8, 49), (8, 89), (9, 83), (9, 84), (10, 52), (10, 82), (11, 63), (11, 64), (12, 20), (12, 65), (18, 46), (18, 85), (20, 63), (21, 52), (21, 67), (25, 30), (25, 56), (26, 56), (30, 80), (31, 33), (31, 71), (32, 89), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (46, 47), (47, 48), (49, 83), (50, 65), (55, 81), (61, 84), (64, 91), (66, 67), (66, 72), (69, 81), (77, 78), (79, 80)] adding cut for [(3, 22), (3, 88), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 75), (38, 93), (38, 99), (39, 45), (39, 87), (42, 58), (43, 44), (60, 93), (60, 94), (62, 86), (73, 74), (73, 75), (86, 92), (88, 98), (92, 101), (94, 100), (96, 98), (96, 100), (99, 101)] adding cut for [(24, 76), (24, 68), (57, 76), (40, 68), (40, 57)] Optimize a model with 174 rows, 5050 columns and 38906 nonzeros Presolve time: 0.06s Presolved: 174 rows, 5050 columns, 38906 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.547822e+02, 312 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 854.78217 0 94 3624.00000 854.78217 76.4% - 0s Another try with MIP start H 0 0 863.0000000 854.78217 0.95% - 0s H 0 0 862.0000000 854.78217 0.84% - 0s 0 0 855.67391 0 85 862.00000 855.67391 0.73% - 0s 0 0 855.67391 0 98 862.00000 855.67391 0.73% - 0s 0 0 856.70000 0 99 862.00000 856.70000 0.61% - 0s 0 0 856.85754 0 95 862.00000 856.85754 0.60% - 0s 0 2 857.14865 0 94 862.00000 857.14865 0.56% - 0s H 1 2 861.0000000 857.14865 0.45% 3.0 0s H 11 8 860.0000000 857.15735 0.33% 0.3 0s * 19 10 14 858.0000000 858.00000 0.0% 39.1 0s Cutting planes: Gomory: 9 MIR: 2 Zero half: 6 Explored 20 nodes (1512 simplex iterations) in 0.75 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.580000000000e+02, best bound 8.580000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (4, 78), (4, 80), (6, 61), (6, 85), (8, 83), (8, 89), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 64), (12, 20), (12, 65), (18, 46), (18, 85), (19, 84), (20, 49), (21, 52), (21, 67), (31, 33), (31, 71), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (61, 84), (63, 89), (64, 91), (66, 67), (66, 72), (70, 71), (77, 78), (79, 80)] adding cut for [(5, 55), (5, 73), (7, 97), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 69), (38, 93), (38, 99), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (55, 81), (57, 76), (60, 93), (60, 94), (62, 86), (69, 81), (73, 75), (74, 75), (86, 92), (92, 101), (94, 100), (97, 100), (99, 101)] Optimize a model with 176 rows, 5050 columns and 40632 nonzeros Presolve time: 0.06s Presolved: 176 rows, 5050 columns, 40632 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.547822e+02, 340 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 854.78217 0 96 3624.00000 854.78217 76.4% - 0s Another try with MIP start H 0 0 863.0000000 854.78217 0.95% - 0s H 0 0 862.0000000 854.78217 0.84% - 0s 0 0 855.71875 0 86 862.00000 855.71875 0.73% - 0s 0 0 855.71875 0 94 862.00000 855.71875 0.73% - 0s 0 0 856.72598 0 99 862.00000 856.72598 0.61% - 0s H 0 0 861.0000000 856.72598 0.50% - 0s 0 0 856.88391 0 97 861.00000 856.88391 0.48% - 0s 0 2 857.32143 0 96 861.00000 857.32143 0.43% - 0s * 73 8 32 859.0000000 857.57143 0.17% 18.6 0s Cutting planes: Gomory: 8 MIR: 2 Zero half: 7 Explored 83 nodes (2199 simplex iterations) in 0.89 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.590000000000e+02, best bound 8.590000000000e+02, gap 0.0% adding cut for [(2, 70), (2, 71), (4, 78), (4, 80), (5, 55), (5, 57), (10, 36), (10, 52), (13, 69), (21, 31), (21, 67), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 35), (31, 71), (34, 51), (34, 82), (35, 79), (36, 72), (40, 68), (51, 77), (52, 82), (55, 81), (66, 67), (66, 72), (69, 81), (77, 78), (79, 80)] adding cut for [(3, 42), (3, 58), (16, 44), (16, 58), (22, 74), (23, 42), (23, 76), (38, 99), (38, 101), (43, 44), (43, 88), (60, 94), (60, 100), (73, 75), (73, 76), (74, 75), (86, 92), (86, 94), (88, 98), (92, 101), (93, 96), (93, 99), (95, 97), (96, 98), (97, 100)] adding cut for [(64, 91), (33, 91), (37, 48), (37, 50), (8, 83), (8, 89), (11, 33), (11, 63), (12, 64), (12, 65), (49, 83), (50, 65), (20, 48), (20, 49), (63, 89)] adding cut for [(6, 85), (6, 61), (39, 87), (9, 47), (9, 84), (46, 47), (17, 45), (17, 62), (18, 46), (18, 87), (15, 39), (15, 45), (61, 84), (62, 85)] Optimize a model with 180 rows, 5050 columns and 41681 nonzeros Presolve time: 0.06s Presolved: 180 rows, 5050 columns, 41681 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.553243e+02, 338 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 855.32428 0 91 3624.00000 855.32428 76.4% - 0s Another try with MIP start H 0 0 863.0000000 855.32428 0.89% - 0s 0 0 856.45238 0 98 863.00000 856.45238 0.76% - 0s 0 0 856.45238 0 91 863.00000 856.45238 0.76% - 0s 0 0 856.55083 0 92 863.00000 856.55083 0.75% - 0s H 0 0 862.0000000 856.55083 0.63% - 0s 0 0 856.75233 0 98 862.00000 856.75233 0.61% - 0s 0 2 857.41318 0 97 862.00000 857.41318 0.53% - 0s * 33 14 24 861.0000000 857.64528 0.39% 28.6 0s H 40 9 860.0000000 857.64717 0.27% 26.8 0s * 53 4 19 859.0000000 858.40625 0.07% 25.4 0s Cutting planes: Gomory: 13 MIR: 6 Zero half: 20 Explored 54 nodes (2080 simplex iterations) in 0.91 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.590000000000e+02, best bound 8.590000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (5, 55), (5, 57), (6, 61), (6, 85), (8, 83), (8, 89), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (15, 39), (15, 45), (17, 45), (17, 62), (18, 46), (18, 87), (19, 84), (20, 49), (21, 33), (21, 67), (24, 68), (24, 76), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (31, 52), (31, 71), (32, 89), (33, 91), (34, 80), (34, 82), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (39, 87), (40, 68), (47, 48), (49, 83), (50, 65), (55, 81), (57, 76), (61, 84), (62, 85), (64, 65), (64, 91), (66, 67), (66, 72), (69, 78), (69, 81)] adding cut for [(7, 97), (16, 44), (16, 58), (22, 41), (22, 74), (23, 42), (23, 75), (38, 99), (38, 101), (42, 58), (43, 44), (43, 88), (60, 93), (60, 96), (73, 74), (73, 75), (86, 92), (86, 94), (88, 98), (92, 101), (93, 99), (94, 100), (96, 98), (97, 100)] Optimize a model with 182 rows, 5050 columns and 43751 nonzeros Presolve time: 0.06s Presolved: 182 rows, 5050 columns, 43751 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.562822e+02, 338 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.28223 0 93 3624.00000 856.28223 76.4% - 0s Another try with MIP start H 0 0 864.0000000 856.28223 0.89% - 0s 0 0 857.05349 0 96 864.00000 857.05349 0.80% - 0s 0 0 857.05349 0 93 864.00000 857.05349 0.80% - 0s 0 0 857.55097 0 97 864.00000 857.55097 0.75% - 0s H 0 0 863.0000000 857.55097 0.63% - 0s 0 0 857.81429 0 97 863.00000 857.81429 0.60% - 0s 0 2 858.18421 0 97 863.00000 858.18421 0.56% - 0s H 1 2 862.0000000 858.18421 0.44% 4.0 0s * 30 10 19 861.0000000 858.31581 0.31% 28.0 0s * 51 2 17 860.0000000 858.87805 0.13% 24.1 0s Cutting planes: Gomory: 12 MIR: 3 Zero half: 7 Explored 54 nodes (1993 simplex iterations) in 0.86 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.600000000000e+02, best bound 8.600000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (3, 42), (3, 58), (6, 85), (6, 94), (9, 46), (9, 47), (11, 63), (11, 64), (12, 20), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (20, 63), (22, 74), (23, 42), (23, 76), (31, 33), (31, 71), (33, 91), (37, 48), (37, 50), (38, 99), (38, 101), (39, 45), (39, 87), (43, 44), (47, 48), (50, 65), (60, 93), (60, 97), (62, 86), (64, 91), (73, 74), (73, 75), (75, 76), (86, 92), (92, 101), (93, 99), (94, 100), (97, 100)] adding cut for [(4, 78), (4, 80), (5, 55), (5, 57), (10, 52), (10, 82), (21, 52), (21, 67), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (34, 80), (34, 82), (35, 36), (35, 79), (36, 66), (40, 68), (55, 81), (66, 72), (67, 72), (69, 77), (69, 81), (77, 78)] Optimize a model with 184 rows, 5050 columns and 45278 nonzeros Presolve time: 0.07s Presolved: 184 rows, 5050 columns, 45278 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.568095e+02, 388 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.80952 0 86 3624.00000 856.80952 76.4% - 0s Another try with MIP start H 0 0 866.0000000 856.80952 1.06% - 0s 0 0 857.77564 0 93 866.00000 857.77564 0.95% - 0s 0 0 857.77564 0 86 866.00000 857.77564 0.95% - 0s 0 0 858.25211 0 102 866.00000 858.25211 0.89% - 0s H 0 0 862.0000000 858.25211 0.43% - 0s 0 0 858.25211 0 103 862.00000 858.25211 0.43% - 0s 0 2 858.69141 0 102 862.00000 858.69141 0.38% - 0s * 28 15 22 861.0000000 859.08012 0.22% 35.9 0s * 45 0 18 860.0000000 860.00000 0.0% 28.7 0s Cutting planes: Gomory: 14 MIR: 2 Zero half: 13 Explored 46 nodes (2108 simplex iterations) in 0.85 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.600000000000e+02, best bound 8.600000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (4, 78), (4, 80), (6, 85), (6, 86), (8, 83), (8, 89), (9, 46), (9, 47), (11, 63), (11, 71), (12, 20), (12, 63), (15, 39), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (20, 49), (21, 31), (21, 33), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 80), (31, 71), (32, 89), (33, 91), (37, 48), (37, 50), (38, 93), (38, 99), (39, 87), (40, 68), (42, 58), (43, 44), (43, 88), (45, 92), (47, 48), (49, 83), (50, 65), (51, 77), (57, 76), (62, 86), (64, 65), (64, 91), (75, 76), (77, 78), (88, 98), (92, 101), (93, 98), (99, 101)] adding cut for [(66, 67), (67, 72), (36, 66), (10, 72), (10, 52), (34, 82), (34, 52), (79, 82), (35, 36), (35, 79)] Optimize a model with 186 rows, 5050 columns and 47214 nonzeros Presolve time: 0.07s Presolved: 186 rows, 5050 columns, 47214 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.568095e+02, 375 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.80952 0 85 3624.00000 856.80952 76.4% - 0s Another try with MIP start H 0 0 869.0000000 856.80952 1.40% - 0s 0 0 857.77564 0 93 869.00000 857.77564 1.29% - 0s 0 0 857.77564 0 86 869.00000 857.77564 1.29% - 0s 0 0 858.49225 0 98 869.00000 858.49225 1.21% - 0s 0 0 858.51389 0 100 869.00000 858.51389 1.21% - 0s 0 0 858.53285 0 101 869.00000 858.53285 1.20% - 0s 0 0 858.53285 0 105 869.00000 858.53285 1.20% - 0s 0 0 858.53285 0 100 869.00000 858.53285 1.20% - 0s 0 0 858.53285 0 102 869.00000 858.53285 1.20% - 0s 0 0 858.53285 0 107 869.00000 858.53285 1.20% - 0s 0 0 858.53285 0 107 869.00000 858.53285 1.20% - 0s H 0 0 868.0000000 858.53285 1.09% - 0s 0 2 858.61905 0 105 868.00000 858.61905 1.08% - 0s * 36 30 22 863.0000000 859.13333 0.45% 21.2 0s * 56 21 16 862.0000000 859.15294 0.33% 19.6 0s H 70 16 861.0000000 859.26718 0.20% 17.8 0s Cutting planes: Gomory: 4 MIR: 3 Zero half: 20 Explored 101 nodes (2367 simplex iterations) in 0.75 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.610000000000e+02, best bound 8.610000000000e+02, gap 0.0% adding cut for [(3, 42), (6, 85), (6, 94), (7, 97), (9, 46), (9, 47), (18, 46), (18, 85), (21, 33), (21, 67), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (40, 68), (47, 48), (50, 65), (57, 76), (64, 65), (64, 91), (66, 72), (67, 72), (94, 100), (97, 100)] adding cut for [(2, 51), (2, 70), (4, 78), (4, 80), (8, 83), (8, 89), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (20, 49), (31, 52), (31, 71), (32, 89), (34, 80), (34, 82), (49, 83), (51, 77), (77, 78)] adding cut for [(96, 98), (99, 101), (38, 99), (38, 93), (39, 45), (39, 87), (60, 96), (60, 93), (43, 88), (43, 58), (15, 44), (15, 45), (16, 44), (16, 58), (17, 87), (17, 62), (86, 92), (88, 98), (92, 101), (62, 86)] adding cut for [(73, 74), (73, 75), (74, 75)] Optimize a model with 190 rows, 5050 columns and 48268 nonzeros Presolve time: 0.07s Presolved: 190 rows, 5050 columns, 48268 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.568095e+02, 353 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.80952 0 86 3624.00000 856.80952 76.4% - 0s Another try with MIP start H 0 0 874.0000000 856.80952 1.97% - 0s 0 0 857.77825 0 93 874.00000 857.77825 1.86% - 0s 0 0 857.77825 0 87 874.00000 857.77825 1.86% - 0s 0 0 858.22273 0 100 874.00000 858.22273 1.81% - 0s 0 0 858.57581 0 104 874.00000 858.57581 1.76% - 0s 0 0 858.78571 0 103 874.00000 858.78571 1.74% - 0s 0 0 858.78795 0 106 874.00000 858.78795 1.74% - 0s 0 0 858.80123 0 110 874.00000 858.80123 1.74% - 0s 0 0 858.86152 0 105 874.00000 858.86152 1.73% - 0s H 0 0 873.0000000 858.86152 1.62% - 0s 0 0 858.86152 0 106 873.00000 858.86152 1.62% - 0s 0 0 858.86152 0 106 873.00000 858.86152 1.62% - 0s 0 0 858.86152 0 105 873.00000 858.86152 1.62% - 0s 0 2 858.90385 0 105 873.00000 858.90385 1.61% - 0s H 27 27 871.0000000 859.45000 1.33% 18.9 0s * 48 25 34 862.0000000 859.45000 0.30% 16.8 0s * 59 4 5 861.0000000 859.60109 0.16% 16.0 0s Cutting planes: Gomory: 3 MIR: 4 Zero half: 10 Explored 74 nodes (1990 simplex iterations) in 0.92 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.610000000000e+02, best bound 8.610000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (3, 42), (3, 58), (4, 78), (4, 80), (6, 85), (6, 94), (9, 46), (9, 47), (11, 63), (11, 64), (12, 20), (12, 65), (15, 39), (15, 45), (16, 44), (16, 58), (17, 45), (17, 62), (18, 85), (18, 87), (20, 63), (21, 31), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 80), (31, 71), (33, 67), (33, 91), (37, 48), (37, 50), (38, 93), (38, 99), (39, 87), (40, 68), (43, 44), (43, 88), (46, 84), (47, 48), (50, 65), (51, 77), (57, 76), (60, 94), (60, 100), (61, 84), (62, 86), (64, 91), (75, 76), (77, 78), (86, 92), (88, 98), (92, 101), (93, 96), (95, 97), (96, 98), (97, 100), (99, 101)] adding cut for [(34, 82), (34, 52), (35, 36), (35, 79), (36, 66), (10, 72), (10, 52), (66, 72), (79, 82)] Optimize a model with 192 rows, 5050 columns and 50449 nonzeros Presolve time: 0.07s Presolved: 192 rows, 5050 columns, 50449 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.568095e+02, 371 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.80952 0 86 3624.00000 856.80952 76.4% - 0s Another try with MIP start H 0 0 874.0000000 856.80952 1.97% - 0s 0 0 857.77825 0 93 874.00000 857.77825 1.86% - 0s 0 0 857.77825 0 86 874.00000 857.77825 1.86% - 0s 0 0 858.22273 0 100 874.00000 858.22273 1.81% - 0s 0 0 858.57581 0 104 874.00000 858.57581 1.76% - 0s 0 0 858.78392 0 100 874.00000 858.78392 1.74% - 0s 0 0 858.80368 0 103 874.00000 858.80368 1.74% - 0s 0 0 858.82924 0 109 874.00000 858.82924 1.74% - 0s 0 0 858.82971 0 114 874.00000 858.82971 1.74% - 0s 0 0 858.83730 0 107 874.00000 858.83730 1.73% - 0s H 0 0 873.0000000 858.83730 1.62% - 0s 0 0 858.83730 0 110 873.00000 858.83730 1.62% - 0s 0 0 858.83730 0 109 873.00000 858.83730 1.62% - 0s 0 2 858.84961 0 108 873.00000 858.84961 1.62% - 0s H 27 27 865.0000000 858.99395 0.69% 18.9 0s * 34 32 22 862.0000000 858.99395 0.35% 19.2 0s * 170 0 13 861.0000000 861.00000 0.0% 13.6 1s Cutting planes: Gomory: 4 MIR: 2 Zero half: 16 Explored 171 nodes (3220 simplex iterations) in 1.07 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.610000000000e+02, best bound 8.610000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (6, 61), (6, 85), (7, 97), (9, 46), (9, 47), (15, 39), (15, 45), (17, 45), (17, 62), (18, 85), (18, 87), (21, 33), (21, 67), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 93), (38, 99), (39, 87), (46, 84), (47, 48), (50, 65), (60, 94), (60, 96), (61, 84), (62, 86), (64, 65), (64, 91), (66, 67), (66, 72), (77, 78), (79, 80), (86, 92), (92, 101), (93, 98), (94, 100), (96, 98), (97, 100), (99, 101)] adding cut for [(32, 89), (2, 51), (8, 89), (8, 83), (10, 82), (10, 52), (11, 71), (11, 63), (12, 20), (12, 63), (34, 82), (34, 51), (49, 83), (20, 49), (31, 71), (31, 52)] adding cut for [(25, 56), (25, 30), (5, 55), (5, 57), (40, 68), (13, 81), (13, 55), (24, 68), (24, 57), (26, 40), (26, 56), (30, 69), (69, 81)] Optimize a model with 195 rows, 5050 columns and 51653 nonzeros Presolve time: 0.07s Presolved: 195 rows, 5050 columns, 51653 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.568256e+02, 381 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.82558 0 91 3624.00000 856.82558 76.4% - 0s Another try with MIP start H 0 0 867.0000000 856.82558 1.17% - 0s 0 0 857.79748 0 94 867.00000 857.79748 1.06% - 0s 0 0 857.79748 0 91 867.00000 857.79748 1.06% - 0s 0 0 858.36825 0 105 867.00000 858.36825 1.00% - 0s 0 0 858.70944 0 100 867.00000 858.70944 0.96% - 0s 0 0 858.71372 0 106 867.00000 858.71372 0.96% - 0s 0 0 858.72022 0 103 867.00000 858.72022 0.95% - 0s 0 0 858.84971 0 91 867.00000 858.84971 0.94% - 0s H 0 0 863.0000000 858.84971 0.48% - 0s 0 0 858.85016 0 104 863.00000 858.85016 0.48% - 0s 0 2 859.24868 0 104 863.00000 859.24868 0.43% - 0s * 33 17 26 862.0000000 859.53191 0.29% 32.4 1s * 51 6 24 861.0000000 859.54864 0.17% 27.4 1s Cutting planes: Gomory: 20 MIR: 7 Zero half: 8 Explored 60 nodes (2392 simplex iterations) in 1.11 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.610000000000e+02, best bound 8.610000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (6, 61), (6, 85), (9, 46), (9, 47), (10, 36), (10, 52), (15, 39), (15, 45), (16, 44), (16, 58), (17, 45), (17, 62), (18, 85), (18, 87), (19, 84), (21, 31), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 35), (31, 33), (33, 91), (34, 51), (34, 82), (35, 79), (36, 72), (37, 48), (37, 50), (38, 99), (38, 101), (39, 87), (40, 68), (43, 44), (43, 88), (46, 84), (47, 48), (50, 65), (51, 77), (52, 82), (57, 76), (62, 86), (64, 65), (64, 91), (66, 67), (66, 72), (75, 76), (77, 78), (79, 80), (86, 92), (88, 98), (92, 101), (93, 98), (93, 99)] Optimize a model with 196 rows, 5050 columns and 53669 nonzeros Presolve time: 0.08s Presolved: 196 rows, 5050 columns, 53669 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.568256e+02, 347 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.82558 0 90 3624.00000 856.82558 76.4% - 0s Another try with MIP start H 0 0 878.0000000 856.82558 2.41% - 0s H 0 0 867.0000000 856.82558 1.17% - 0s 0 0 857.79748 0 94 867.00000 857.79748 1.06% - 0s 0 0 857.79748 0 90 867.00000 857.79748 1.06% - 0s 0 0 858.32639 0 98 867.00000 858.32639 1.00% - 0s 0 0 858.70432 0 104 867.00000 858.70432 0.96% - 0s 0 0 858.83029 0 108 867.00000 858.83029 0.94% - 0s 0 0 858.87395 0 102 867.00000 858.87395 0.94% - 0s 0 0 858.88910 0 114 867.00000 858.88910 0.94% - 0s 0 0 858.92970 0 111 867.00000 858.92970 0.93% - 0s 0 0 858.92970 0 115 867.00000 858.92970 0.93% - 0s 0 0 858.92970 0 116 867.00000 858.92970 0.93% - 0s 0 0 858.92970 0 116 867.00000 858.92970 0.93% - 0s 0 2 858.95730 0 116 867.00000 858.95730 0.93% - 0s H 29 29 866.0000000 859.10284 0.80% 17.0 0s * 45 37 29 863.0000000 859.10284 0.45% 17.6 0s * 141 46 16 862.0000000 859.49528 0.29% 16.1 0s H 244 0 861.0000000 860.33333 0.08% 15.2 0s Cutting planes: Gomory: 4 MIR: 4 Zero half: 15 Explored 244 nodes (4511 simplex iterations) in 0.84 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.610000000000e+02, best bound 8.610000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 55), (5, 73), (6, 85), (6, 94), (15, 39), (15, 45), (16, 44), (16, 58), (17, 45), (17, 62), (18, 85), (18, 87), (22, 74), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 69), (38, 99), (38, 101), (39, 87), (40, 68), (43, 44), (43, 88), (55, 81), (57, 76), (60, 94), (60, 100), (62, 86), (69, 81), (73, 75), (74, 75), (86, 92), (88, 98), (92, 101), (93, 96), (93, 99), (95, 97), (96, 98), (97, 100)] adding cut for [(2, 70), (2, 71), (4, 78), (4, 80), (10, 52), (10, 82), (11, 63), (11, 64), (21, 33), (21, 67), (31, 52), (31, 71), (32, 89), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 66), (51, 77), (63, 89), (64, 91), (66, 72), (67, 72), (77, 78), (79, 80)] adding cut for [(37, 48), (37, 50), (8, 83), (8, 19), (9, 46), (9, 47), (12, 65), (12, 20), (46, 84), (47, 48), (49, 83), (50, 65), (20, 49), (61, 84)] Optimize a model with 199 rows, 5050 columns and 55206 nonzeros Presolve time: 0.08s Presolved: 199 rows, 5050 columns, 55206 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569435e+02, 355 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.94355 0 89 3624.00000 856.94355 76.4% - 0s Another try with MIP start H 0 0 866.0000000 856.94355 1.05% - 0s 0 0 858.39270 0 98 866.00000 858.39270 0.88% - 0s 0 0 858.39270 0 90 866.00000 858.39270 0.88% - 0s 0 0 858.80608 0 97 866.00000 858.80608 0.83% - 0s H 0 0 865.0000000 858.80608 0.72% - 0s 0 0 858.89262 0 101 865.00000 858.89262 0.71% - 0s 0 2 859.27450 0 101 865.00000 859.27450 0.66% - 0s * 36 13 23 862.0000000 859.61166 0.28% 30.3 1s Cutting planes: Gomory: 16 MIR: 10 Zero half: 9 Explored 68 nodes (2558 simplex iterations) in 1.09 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.620000000000e+02, best bound 8.620000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (6, 61), (6, 85), (9, 46), (9, 47), (11, 63), (11, 64), (12, 20), (12, 65), (14, 88), (15, 39), (15, 43), (16, 44), (16, 58), (17, 62), (17, 87), (18, 85), (18, 87), (20, 63), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 60), (38, 99), (39, 45), (40, 68), (43, 44), (45, 92), (46, 84), (47, 48), (50, 65), (57, 76), (60, 93), (61, 84), (62, 86), (64, 91), (66, 72), (67, 72), (75, 76), (86, 94), (88, 98), (92, 101), (93, 96), (94, 100), (96, 98), (97, 100), (99, 101)] Optimize a model with 200 rows, 5050 columns and 57159 nonzeros Presolve time: 0.08s Presolved: 200 rows, 5050 columns, 57159 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569435e+02, 330 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.94355 0 90 3624.00000 856.94355 76.4% - 0s Another try with MIP start H 0 0 867.0000000 856.94355 1.16% - 0s 0 0 858.37500 0 86 867.00000 858.37500 0.99% - 0s 0 0 858.37500 0 89 867.00000 858.37500 0.99% - 0s 0 0 858.80126 0 98 867.00000 858.80126 0.95% - 0s 0 0 858.87778 0 104 867.00000 858.87778 0.94% - 0s 0 0 859.27279 0 107 867.00000 859.27279 0.89% - 0s 0 0 859.28667 0 109 867.00000 859.28667 0.89% - 0s 0 2 859.62528 0 109 867.00000 859.62528 0.85% - 0s H 1 2 865.0000000 859.62528 0.62% 1.0 0s * 53 26 35 864.0000000 859.80989 0.48% 31.5 1s * 90 23 35 863.0000000 859.81116 0.37% 27.3 1s * 104 6 24 862.0000000 860.76374 0.14% 27.2 1s Cutting planes: Gomory: 21 MIR: 3 Zero half: 10 Explored 111 nodes (3761 simplex iterations) in 1.37 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.620000000000e+02, best bound 8.620000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (4, 78), (4, 80), (6, 61), (6, 85), (8, 83), (8, 89), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (15, 39), (15, 45), (16, 44), (16, 58), (17, 45), (17, 62), (18, 85), (18, 87), (20, 49), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 80), (31, 52), (31, 71), (32, 89), (33, 91), (34, 79), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 99), (38, 101), (39, 87), (40, 68), (42, 58), (43, 44), (43, 88), (46, 84), (47, 48), (49, 83), (50, 65), (51, 77), (55, 56), (57, 76), (61, 84), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (75, 76), (77, 78), (86, 92), (88, 98), (92, 101), (93, 96), (93, 99), (96, 98)] adding cut for [(13, 81), (13, 69), (69, 81)] Optimize a model with 202 rows, 5050 columns and 60012 nonzeros Presolve time: 0.09s Presolved: 202 rows, 5050 columns, 60012 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569559e+02, 369 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.95588 0 95 3624.00000 856.95588 76.4% - 0s Another try with MIP start H 0 0 865.0000000 856.95588 0.93% - 0s 0 0 858.47208 0 95 865.00000 858.47208 0.75% - 0s 0 0 858.47208 0 95 865.00000 858.47208 0.75% - 0s 0 0 858.79697 0 102 865.00000 858.79697 0.72% - 0s 0 0 858.93273 0 109 865.00000 858.93273 0.70% - 0s 0 2 859.42799 0 109 865.00000 859.42799 0.64% - 0s * 64 24 37 864.0000000 859.98281 0.46% 29.4 1s * 95 23 28 863.0000000 860.03647 0.34% 25.0 1s * 123 11 20 862.0000000 860.75000 0.15% 24.1 1s Cutting planes: Gomory: 8 MIR: 6 Zero half: 15 Explored 135 nodes (3855 simplex iterations) in 1.46 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.620000000000e+02, best bound 8.620000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (11, 63), (11, 64), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (21, 33), (21, 67), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 80), (32, 89), (33, 91), (35, 36), (35, 79), (36, 66), (38, 93), (38, 99), (39, 45), (39, 87), (40, 68), (43, 44), (57, 76), (62, 86), (63, 89), (64, 91), (66, 72), (67, 72), (79, 80), (86, 92), (88, 98), (92, 101), (93, 96), (96, 98), (99, 101)] adding cut for [(6, 61), (6, 94), (8, 19), (8, 83), (9, 46), (9, 47), (12, 20), (12, 65), (18, 46), (18, 85), (20, 49), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (60, 94), (60, 100), (61, 84), (84, 85), (95, 97), (97, 100)] Optimize a model with 204 rows, 5050 columns and 61300 nonzeros Presolve time: 0.09s Presolved: 204 rows, 5050 columns, 61300 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569559e+02, 336 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.95588 0 95 3624.00000 856.95588 76.4% - 0s Another try with MIP start H 0 0 866.0000000 856.95588 1.04% - 0s H 0 0 865.0000000 856.95588 0.93% - 0s 0 0 858.47208 0 100 865.00000 858.47208 0.75% - 0s 0 0 858.47208 0 95 865.00000 858.47208 0.75% - 0s 0 0 858.92532 0 102 865.00000 858.92532 0.70% - 0s 0 0 859.21101 0 101 865.00000 859.21101 0.67% - 0s 0 2 859.59164 0 101 865.00000 859.59164 0.63% - 0s * 50 14 33 863.0000000 860.29762 0.31% 35.1 1s Cutting planes: Gomory: 9 MIR: 15 Zero half: 13 Explored 153 nodes (4078 simplex iterations) in 1.32 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.630000000000e+02, best bound 8.630000000000e+02, gap 0.0% adding cut for [(9, 46), (9, 47), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 72), (37, 47), (37, 50), (38, 60), (38, 99), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (50, 65), (57, 76), (60, 93), (62, 86), (64, 65), (64, 91), (66, 67), (66, 72), (75, 76), (84, 85), (86, 92), (92, 101), (93, 98), (95, 96), (96, 98), (99, 101)] adding cut for [(2, 51), (2, 70), (4, 78), (4, 80), (8, 83), (8, 89), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (20, 48), (31, 52), (31, 71), (32, 89), (34, 80), (34, 82), (48, 49), (49, 83), (51, 77), (77, 78)] Optimize a model with 206 rows, 5050 columns and 62879 nonzeros Presolve time: 0.09s Presolved: 206 rows, 5050 columns, 62879 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569559e+02, 363 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.95588 0 95 3624.00000 856.95588 76.4% - 0s Another try with MIP start H 0 0 865.0000000 856.95588 0.93% - 0s 0 0 858.47208 0 100 865.00000 858.47208 0.75% - 0s 0 0 858.47208 0 96 865.00000 858.47208 0.75% - 0s 0 0 858.92532 0 105 865.00000 858.92532 0.70% - 0s 0 0 859.21101 0 102 865.00000 859.21101 0.67% - 0s 0 2 859.69320 0 102 865.00000 859.69320 0.61% - 0s H 32 19 863.0000000 860.31366 0.31% 39.8 1s Cutting planes: Gomory: 18 Implied bound: 1 MIR: 8 Zero half: 14 Explored 132 nodes (3747 simplex iterations) in 1.40 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.630000000000e+02, best bound 8.630000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (15, 39), (15, 43), (16, 44), (16, 58), (17, 62), (17, 87), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (38, 93), (38, 99), (39, 45), (40, 68), (42, 58), (43, 44), (45, 87), (51, 77), (57, 76), (62, 86), (69, 78), (69, 81), (75, 76), (77, 78), (86, 92), (92, 101), (93, 98), (95, 96), (96, 98), (99, 101)] adding cut for [(4, 34), (4, 80), (8, 83), (8, 89), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (18, 46), (18, 85), (19, 84), (20, 49), (21, 33), (21, 67), (31, 52), (31, 71), (32, 89), (33, 91), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (64, 65), (64, 91), (66, 72), (67, 72), (79, 80), (84, 85)] Optimize a model with 208 rows, 5050 columns and 64285 nonzeros Presolve time: 0.09s Presolved: 208 rows, 5050 columns, 64285 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569559e+02, 367 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.95588 0 95 3624.00000 856.95588 76.4% - 0s Another try with MIP start H 0 0 865.0000000 856.95588 0.93% - 0s 0 0 858.47208 0 96 865.00000 858.47208 0.75% - 0s 0 0 858.47208 0 95 865.00000 858.47208 0.75% - 0s 0 0 858.79911 0 100 865.00000 858.79911 0.72% - 0s 0 0 858.93931 0 104 865.00000 858.93931 0.70% - 0s 0 2 859.42769 0 104 865.00000 859.42769 0.64% - 0s * 99 25 24 863.0000000 860.91835 0.24% 26.9 1s Cutting planes: Gomory: 10 MIR: 10 Zero half: 12 Explored 199 nodes (5018 simplex iterations) in 1.57 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.630000000000e+02, best bound 8.630000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (15, 39), (15, 43), (16, 44), (16, 58), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 35), (34, 80), (34, 82), (35, 79), (38, 93), (38, 99), (39, 45), (40, 68), (43, 44), (45, 92), (51, 77), (57, 76), (60, 93), (60, 96), (77, 78), (79, 82), (88, 98), (92, 101), (96, 98), (99, 101)] adding cut for [(8, 19), (8, 83), (9, 46), (9, 47), (12, 20), (12, 65), (17, 62), (17, 87), (18, 46), (18, 87), (20, 49), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (62, 86), (86, 94), (94, 100), (95, 97), (97, 100)] adding cut for [(64, 91), (33, 91), (2, 70), (2, 71), (36, 72), (63, 89), (10, 36), (10, 52), (11, 64), (11, 63), (66, 67), (66, 72), (32, 89), (21, 33), (21, 67), (31, 71), (31, 52)] adding cut for [(84, 85), (6, 85), (6, 61), (61, 84)] Optimize a model with 212 rows, 5050 columns and 65341 nonzeros Presolve time: 0.09s Presolved: 212 rows, 5050 columns, 65341 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569559e+02, 372 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.95588 0 95 3624.00000 856.95588 76.4% - 0s Another try with MIP start H 0 0 873.0000000 856.95588 1.84% - 0s H 0 0 865.0000000 856.95588 0.93% - 0s 0 0 858.47208 0 95 865.00000 858.47208 0.75% - 0s 0 0 858.47208 0 95 865.00000 858.47208 0.75% - 0s 0 0 859.03661 0 106 865.00000 859.03661 0.69% - 0s 0 0 859.20642 0 106 865.00000 859.20642 0.67% - 0s 0 2 859.69213 0 106 865.00000 859.69213 0.61% - 0s * 40 28 25 864.0000000 860.04640 0.46% 37.2 1s * 45 15 28 863.0000000 860.04640 0.34% 34.0 1s Cutting planes: Gomory: 20 MIR: 11 Zero half: 12 Explored 136 nodes (3897 simplex iterations) in 1.46 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.630000000000e+02, best bound 8.630000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 56), (5, 73), (15, 39), (15, 43), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (38, 96), (38, 99), (39, 45), (40, 68), (43, 44), (45, 87), (57, 76), (62, 86), (73, 74), (75, 76), (86, 92), (92, 101), (95, 96), (99, 101)] adding cut for [(8, 49), (8, 89), (9, 47), (9, 83), (11, 63), (11, 64), (12, 20), (12, 65), (13, 69), (20, 63), (25, 30), (25, 55), (30, 79), (32, 89), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (55, 81), (64, 91), (66, 72), (67, 72), (69, 81)] Optimize a model with 214 rows, 5050 columns and 66272 nonzeros Presolve time: 0.09s Presolved: 214 rows, 5050 columns, 66272 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569559e+02, 347 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.95588 0 95 3624.00000 856.95588 76.4% - 0s Another try with MIP start H 0 0 871.0000000 856.95588 1.61% - 0s H 0 0 865.0000000 856.95588 0.93% - 0s 0 0 858.47208 0 100 865.00000 858.47208 0.75% - 0s 0 0 858.47208 0 95 865.00000 858.47208 0.75% - 0s 0 0 858.92532 0 101 865.00000 858.92532 0.70% - 0s 0 0 859.03676 0 106 865.00000 859.03676 0.69% - 0s 0 2 859.52711 0 103 865.00000 859.52711 0.63% - 0s * 39 23 21 864.0000000 860.04081 0.46% 28.1 1s * 131 29 21 863.0000000 860.63263 0.27% 24.5 1s Cutting planes: Gomory: 18 MIR: 14 Zero half: 15 Explored 224 nodes (5445 simplex iterations) in 1.63 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.630000000000e+02, best bound 8.630000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (4, 78), (4, 80), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (13, 69), (20, 49), (21, 33), (21, 67), (25, 30), (25, 55), (30, 79), (31, 52), (31, 71), (33, 91), (34, 80), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (48, 49), (50, 65), (51, 77), (55, 81), (64, 65), (64, 91), (66, 72), (67, 72), (69, 81), (77, 78)] adding cut for [(3, 42), (3, 58), (5, 56), (5, 73), (15, 39), (15, 43), (16, 44), (16, 58), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (38, 93), (38, 99), (39, 45), (40, 68), (43, 44), (45, 92), (57, 76), (60, 93), (60, 96), (73, 74), (75, 76), (88, 98), (92, 101), (96, 98), (99, 101)] adding cut for [(9, 84), (9, 47), (46, 84), (46, 47)] Optimize a model with 217 rows, 5050 columns and 67446 nonzeros Presolve time: 0.09s Presolved: 217 rows, 5050 columns, 67446 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569559e+02, 365 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.95588 0 95 3624.00000 856.95588 76.4% - 0s Another try with MIP start H 0 0 878.0000000 856.95588 2.40% - 0s H 0 0 865.0000000 856.95588 0.93% - 0s 0 0 858.47458 0 95 865.00000 858.47458 0.75% - 0s 0 0 858.47458 0 96 865.00000 858.47458 0.75% - 0s 0 0 858.79697 0 101 865.00000 858.79697 0.72% - 0s 0 0 858.93305 0 108 865.00000 858.93305 0.70% - 0s 0 2 859.35973 0 108 865.00000 859.35973 0.65% - 0s * 36 22 25 863.0000000 860.19479 0.33% 38.7 1s Cutting planes: Gomory: 13 MIR: 6 Zero half: 14 Explored 140 nodes (3769 simplex iterations) in 1.33 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.630000000000e+02, best bound 8.630000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (6, 61), (6, 94), (9, 47), (9, 84), (11, 63), (11, 64), (12, 20), (12, 65), (13, 55), (20, 63), (21, 33), (21, 67), (25, 30), (25, 55), (30, 81), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (47, 48), (50, 65), (60, 94), (60, 100), (61, 84), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (79, 80), (95, 97), (97, 100)] adding cut for [(3, 88), (5, 56), (5, 73), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 76), (24, 57), (24, 68), (26, 40), (26, 56), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (57, 76), (62, 86), (73, 75), (74, 75), (86, 92), (88, 98), (92, 101), (93, 96), (93, 99), (96, 98)] adding cut for [(18, 85), (18, 46), (46, 85)] Optimize a model with 220 rows, 5050 columns and 68676 nonzeros Presolve time: 0.09s Presolved: 220 rows, 5050 columns, 68676 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569559e+02, 346 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.95588 0 95 3624.00000 856.95588 76.4% - 0s Another try with MIP start H 0 0 865.0000000 856.95588 0.93% - 0s 0 0 858.56614 0 93 865.00000 858.56614 0.74% - 0s 0 0 858.56614 0 96 865.00000 858.56614 0.74% - 0s 0 0 858.99831 0 102 865.00000 858.99831 0.69% - 0s 0 0 859.04823 0 117 865.00000 859.04823 0.69% - 0s 0 2 859.41461 0 117 865.00000 859.41461 0.65% - 0s H 111 58 864.0000000 860.64822 0.39% 25.3 1s * 171 35 22 863.0000000 861.20968 0.21% 23.9 1s Cutting planes: Gomory: 20 MIR: 12 Zero half: 9 Explored 237 nodes (5727 simplex iterations) in 1.61 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.630000000000e+02, best bound 8.630000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (38, 60), (38, 99), (39, 45), (39, 87), (40, 68), (43, 44), (51, 77), (57, 76), (60, 94), (62, 86), (69, 78), (69, 81), (75, 76), (77, 78), (86, 92), (92, 101), (94, 100), (97, 100), (99, 101)] adding cut for [(2, 70), (2, 71), (4, 34), (4, 80), (10, 52), (10, 82), (11, 63), (11, 64), (21, 33), (21, 67), (31, 52), (31, 71), (32, 89), (33, 91), (34, 82), (35, 36), (35, 79), (36, 72), (63, 89), (64, 91), (66, 67), (66, 72), (79, 80)] adding cut for [(37, 50), (37, 48), (6, 85), (6, 61), (8, 83), (8, 53), (9, 46), (9, 47), (12, 65), (12, 20), (50, 65), (47, 48), (49, 83), (18, 46), (18, 85), (19, 84), (20, 49), (61, 84)] Optimize a model with 223 rows, 5050 columns and 69789 nonzeros Presolve time: 0.09s Presolved: 223 rows, 5050 columns, 69789 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569559e+02, 352 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.95588 0 95 3624.00000 856.95588 76.4% - 0s Another try with MIP start H 0 0 865.0000000 856.95588 0.93% - 0s 0 0 858.56614 0 93 865.00000 858.56614 0.74% - 0s 0 0 858.56614 0 96 865.00000 858.56614 0.74% - 0s 0 0 859.13835 0 117 865.00000 859.13835 0.68% - 0s 0 0 859.35489 0 105 865.00000 859.35489 0.65% - 0s 0 2 859.99117 0 105 865.00000 859.99117 0.58% - 0s * 38 18 22 864.0000000 860.22347 0.44% 32.9 1s * 247 13 19 863.0000000 861.78388 0.14% 20.4 1s Cutting planes: Gomory: 10 MIR: 10 Zero half: 11 Explored 262 nodes (5948 simplex iterations) in 1.58 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.630000000000e+02, best bound 8.630000000000e+02, gap 0.0% adding cut for [(4, 30), (4, 80), (8, 49), (8, 89), (9, 47), (9, 83), (11, 63), (11, 64), (12, 20), (12, 65), (16, 44), (16, 58), (20, 63), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (32, 89), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 99), (38, 101), (40, 68), (42, 58), (43, 44), (43, 88), (47, 48), (49, 83), (50, 65), (57, 76), (60, 93), (60, 96), (64, 91), (66, 67), (66, 72), (73, 75), (73, 76), (79, 80), (86, 92), (86, 94), (88, 98), (92, 101), (93, 99), (94, 100), (95, 97), (96, 98), (97, 100)] adding cut for [(6, 85), (6, 61), (39, 87), (46, 84), (15, 39), (15, 45), (17, 45), (17, 62), (18, 46), (18, 87), (61, 84), (62, 85)] adding cut for [(2, 71), (2, 51), (10, 82), (10, 52), (34, 82), (34, 51), (31, 71), (31, 52)] Optimize a model with 226 rows, 5050 columns and 71536 nonzeros Presolve time: 0.09s Presolved: 226 rows, 5050 columns, 71536 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569559e+02, 323 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.95588 0 95 3624.00000 856.95588 76.4% - 0s Another try with MIP start H 0 0 865.0000000 856.95588 0.93% - 0s 0 0 858.56614 0 97 865.00000 858.56614 0.74% - 0s 0 0 858.56614 0 96 865.00000 858.56614 0.74% - 0s 0 0 858.80340 0 101 865.00000 858.80340 0.72% - 0s 0 0 859.10857 0 108 865.00000 859.10857 0.68% - 0s 0 2 859.73421 0 106 865.00000 859.73421 0.61% - 0s * 61 23 33 864.0000000 860.13535 0.45% 27.8 1s * 351 5 26 863.0000000 861.91667 0.13% 20.4 1s Cutting planes: Gomory: 20 MIR: 8 Zero half: 17 Explored 357 nodes (8004 simplex iterations) in 2.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.630000000000e+02, best bound 8.630000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (11, 63), (11, 64), (16, 44), (16, 58), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (32, 89), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (40, 68), (43, 44), (43, 88), (57, 76), (63, 89), (64, 91), (66, 72), (67, 72), (75, 76)] adding cut for [(96, 98), (97, 100), (38, 99), (38, 101), (7, 97), (92, 101), (39, 87), (45, 92), (15, 39), (15, 45), (17, 62), (17, 87), (62, 86), (60, 86), (60, 94), (93, 98), (93, 99), (94, 100), (95, 96)] adding cut for [(37, 50), (37, 47), (6, 85), (6, 61), (8, 83), (9, 46), (9, 47), (12, 65), (12, 20), (50, 65), (48, 49), (49, 83), (18, 46), (18, 85), (19, 84), (20, 48), (61, 84)] Optimize a model with 229 rows, 5050 columns and 72344 nonzeros Presolve time: 0.09s Presolved: 229 rows, 5050 columns, 72344 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569559e+02, 400 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.95588 0 95 3624.00000 856.95588 76.4% - 0s Another try with MIP start H 0 0 865.0000000 856.95588 0.93% - 0s 0 0 858.56614 0 97 865.00000 858.56614 0.74% - 0s 0 0 858.56614 0 96 865.00000 858.56614 0.74% - 0s 0 0 858.80340 0 103 865.00000 858.80340 0.72% - 0s 0 0 859.10857 0 112 865.00000 859.10857 0.68% - 0s 0 2 859.72350 0 112 865.00000 859.72350 0.61% - 0s * 43 28 23 864.0000000 859.96389 0.47% 29.9 1s Cutting planes: Gomory: 19 MIR: 10 Zero half: 22 Mod-K: 1 Explored 538 nodes (10420 simplex iterations) in 2.24 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 30), (4, 80), (6, 61), (6, 94), (7, 97), (8, 19), (8, 89), (11, 63), (11, 64), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (21, 33), (21, 67), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (33, 91), (35, 36), (35, 79), (36, 72), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (43, 44), (46, 84), (57, 76), (60, 93), (60, 100), (61, 84), (62, 85), (63, 89), (64, 91), (66, 67), (66, 72), (79, 80), (86, 92), (86, 94), (92, 101), (93, 99), (97, 100)] adding cut for [(2, 70), (2, 71), (69, 78), (69, 81), (73, 75), (10, 82), (10, 52), (34, 82), (34, 51), (77, 78), (51, 77), (22, 74), (55, 81), (5, 73), (5, 55), (74, 75), (31, 71), (31, 52)] adding cut for [(37, 48), (37, 50), (9, 47), (9, 83), (12, 65), (12, 20), (47, 48), (49, 83), (50, 65), (20, 49)] adding cut for [(88, 96), (88, 98), (96, 98)] Optimize a model with 233 rows, 5050 columns and 74103 nonzeros Presolve time: 0.10s Presolved: 233 rows, 5050 columns, 74103 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569559e+02, 336 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.95588 0 95 3624.00000 856.95588 76.4% - 0s Another try with MIP start H 0 0 873.0000000 856.95588 1.84% - 0s H 0 0 865.0000000 856.95588 0.93% - 0s 0 0 858.56614 0 96 865.00000 858.56614 0.74% - 0s 0 0 858.56614 0 96 865.00000 858.56614 0.74% - 0s 0 0 859.12828 0 108 865.00000 859.12828 0.68% - 0s 0 0 859.36616 0 111 865.00000 859.36616 0.65% - 0s 0 2 859.97067 0 111 865.00000 859.97067 0.58% - 0s * 57 18 34 864.0000000 860.54183 0.40% 30.8 1s Cutting planes: Gomory: 14 MIR: 8 Zero half: 11 Explored 354 nodes (8182 simplex iterations) in 1.80 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(6, 61), (6, 85), (9, 46), (9, 47), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 72), (37, 47), (37, 50), (38, 93), (38, 99), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (50, 65), (57, 76), (60, 93), (60, 94), (61, 84), (62, 86), (64, 65), (64, 91), (66, 67), (66, 72), (73, 74), (73, 76), (74, 75), (86, 92), (92, 101), (94, 100), (97, 100), (99, 101)] adding cut for [(2, 51), (2, 70), (4, 78), (4, 80), (8, 53), (8, 83), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (20, 48), (31, 52), (31, 71), (34, 80), (34, 82), (48, 49), (49, 83), (51, 77), (77, 78)] Optimize a model with 235 rows, 5050 columns and 75874 nonzeros Presolve time: 0.10s Presolved: 235 rows, 5050 columns, 75874 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569559e+02, 348 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.95588 0 95 3624.00000 856.95588 76.4% - 0s Another try with MIP start H 0 0 872.0000000 856.95588 1.73% - 0s H 0 0 865.0000000 856.95588 0.93% - 0s 0 0 858.56614 0 93 865.00000 858.56614 0.74% - 0s 0 0 858.56614 0 95 865.00000 858.56614 0.74% - 0s 0 0 858.80340 0 104 865.00000 858.80340 0.72% - 0s 0 0 859.10857 0 112 865.00000 859.10857 0.68% - 0s 0 2 859.73421 0 112 865.00000 859.73421 0.61% - 0s * 44 21 24 864.0000000 860.14969 0.45% 37.5 1s Cutting planes: Gomory: 15 MIR: 15 Zero half: 18 Explored 362 nodes (7899 simplex iterations) in 1.97 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (5, 57), (5, 73), (6, 61), (6, 85), (7, 97), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 64), (12, 20), (12, 65), (15, 39), (15, 43), (16, 44), (16, 58), (17, 62), (17, 87), (18, 85), (18, 87), (20, 63), (21, 52), (21, 67), (23, 42), (23, 75), (24, 68), (24, 76), (25, 30), (25, 55), (26, 40), (26, 56), (30, 80), (31, 33), (31, 71), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 93), (38, 99), (39, 45), (40, 68), (42, 58), (43, 44), (45, 92), (46, 84), (47, 48), (50, 65), (55, 56), (57, 76), (60, 94), (60, 100), (61, 84), (62, 86), (64, 91), (66, 67), (66, 72), (73, 75), (79, 80), (86, 94), (92, 101), (93, 98), (95, 96), (96, 98), (97, 100), (99, 101)] Optimize a model with 236 rows, 5050 columns and 78575 nonzeros Presolve time: 0.10s Presolved: 236 rows, 5050 columns, 78575 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.569559e+02, 390 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 856.95588 0 95 3624.00000 856.95588 76.4% - 0s Another try with MIP start H 0 0 864.0000000 856.95588 0.82% - 0s 0 0 858.56614 0 92 864.00000 858.56614 0.63% - 0s 0 0 858.56614 0 95 864.00000 858.56614 0.63% - 0s 0 0 858.81030 0 98 864.00000 858.81030 0.60% - 0s 0 0 858.92953 0 104 864.00000 858.92953 0.59% - 0s 0 2 859.61214 0 104 864.00000 859.61214 0.51% - 0s Cutting planes: Gomory: 17 MIR: 8 Zero half: 16 Explored 465 nodes (9425 simplex iterations) in 1.91 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 22), (5, 57), (6, 61), (6, 94), (8, 49), (8, 89), (9, 47), (9, 83), (11, 63), (11, 64), (12, 20), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (20, 63), (21, 33), (21, 67), (22, 74), (23, 42), (23, 75), (24, 68), (24, 76), (25, 30), (25, 56), (26, 40), (26, 56), (30, 80), (32, 89), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 93), (38, 99), (39, 45), (39, 87), (40, 68), (43, 44), (46, 84), (47, 48), (49, 83), (50, 65), (57, 76), (60, 96), (60, 100), (61, 84), (62, 85), (64, 91), (66, 67), (66, 72), (73, 74), (73, 75), (79, 80), (86, 92), (86, 94), (92, 101), (93, 98), (95, 97), (96, 98), (97, 100), (99, 101)] adding cut for [(2, 70), (2, 71), (4, 69), (4, 78), (69, 81), (10, 82), (10, 52), (13, 55), (34, 82), (34, 51), (77, 78), (51, 77), (55, 81), (31, 71), (31, 52)] Optimize a model with 238 rows, 5050 columns and 81251 nonzeros Presolve time: 0.10s Presolved: 238 rows, 5050 columns, 81251 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.570255e+02, 355 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.02548 0 92 3624.00000 857.02548 76.4% - 0s Another try with MIP start H 0 0 871.0000000 857.02548 1.60% - 0s 0 0 858.56614 0 96 871.00000 858.56614 1.43% - 0s 0 0 858.56614 0 92 871.00000 858.56614 1.43% - 0s 0 0 858.85616 0 98 871.00000 858.85616 1.39% - 0s 0 0 859.12058 0 114 871.00000 859.12058 1.36% - 0s 0 0 859.15462 0 120 871.00000 859.15462 1.36% - 0s 0 0 859.30993 0 119 871.00000 859.30993 1.34% - 0s 0 0 859.42010 0 121 871.00000 859.42010 1.33% - 0s 0 0 859.42010 0 125 871.00000 859.42010 1.33% - 0s 0 0 859.47027 0 109 871.00000 859.47027 1.32% - 0s 0 0 859.47027 0 113 871.00000 859.47027 1.32% - 0s 0 0 859.47027 0 112 871.00000 859.47027 1.32% - 0s 0 0 859.47027 0 115 871.00000 859.47027 1.32% - 0s 0 0 859.47027 0 116 871.00000 859.47027 1.32% - 0s 0 0 859.47027 0 114 871.00000 859.47027 1.32% - 0s 0 2 859.47227 0 112 871.00000 859.47227 1.32% - 1s * 163 139 50 869.0000000 860.27758 1.00% 16.1 1s * 174 137 57 868.0000000 860.27758 0.89% 15.6 1s H 179 116 867.0000000 860.27758 0.78% 15.2 1s H 252 114 865.0000000 860.40741 0.53% 16.0 1s * 381 106 15 864.0000000 860.62188 0.39% 18.7 1s Cutting planes: Gomory: 2 MIR: 5 Zero half: 41 Explored 975 nodes (17859 simplex iterations) in 2.66 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(2, 70), (2, 71), (6, 61), (6, 85), (7, 97), (9, 46), (9, 47), (11, 63), (11, 64), (12, 20), (12, 65), (15, 39), (15, 45), (17, 45), (17, 62), (18, 85), (18, 87), (20, 63), (31, 33), (31, 71), (33, 91), (37, 48), (37, 50), (38, 99), (38, 101), (39, 87), (46, 84), (47, 48), (50, 65), (60, 93), (60, 94), (61, 84), (62, 86), (64, 91), (86, 92), (92, 101), (93, 99), (94, 100), (97, 100)] adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (16, 44), (16, 58), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 35), (34, 51), (34, 82), (35, 79), (40, 68), (43, 44), (43, 88), (51, 80), (57, 76), (77, 78), (79, 82), (88, 98), (96, 98)] adding cut for [(66, 67), (66, 72), (36, 72), (10, 36), (10, 52), (21, 67), (21, 52)] Optimize a model with 241 rows, 5050 columns and 82430 nonzeros Presolve time: 0.10s Presolved: 241 rows, 5050 columns, 82430 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.570255e+02, 331 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.02548 0 92 3624.00000 857.02548 76.4% - 0s Another try with MIP start H 0 0 875.0000000 857.02548 2.05% - 0s H 0 0 871.0000000 857.02548 1.60% - 0s 0 0 858.56614 0 92 871.00000 858.56614 1.43% - 0s 0 0 858.56614 0 92 871.00000 858.56614 1.43% - 0s 0 0 858.85616 0 98 871.00000 858.85616 1.39% - 0s 0 0 859.12058 0 114 871.00000 859.12058 1.36% - 0s 0 0 859.15863 0 122 871.00000 859.15863 1.36% - 0s 0 0 859.39016 0 120 871.00000 859.39016 1.33% - 0s 0 0 859.39927 0 121 871.00000 859.39927 1.33% - 0s 0 0 859.39927 0 121 871.00000 859.39927 1.33% - 0s 0 0 859.41523 0 119 871.00000 859.41523 1.33% - 0s 0 0 859.41523 0 122 871.00000 859.41523 1.33% - 0s 0 0 859.41977 0 120 871.00000 859.41977 1.33% - 0s 0 0 859.41977 0 121 871.00000 859.41977 1.33% - 0s 0 0 859.41977 0 120 871.00000 859.41977 1.33% - 0s 0 2 859.53362 0 119 871.00000 859.53362 1.32% - 1s * 46 35 32 865.0000000 860.08658 0.57% 20.7 1s * 182 69 10 864.0000000 860.84294 0.37% 19.2 1s Cutting planes: Gomory: 2 MIR: 5 Zero half: 18 Explored 790 nodes (13818 simplex iterations) in 2.06 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (8, 19), (8, 89), (9, 47), (9, 83), (11, 63), (11, 64), (12, 20), (12, 65), (16, 44), (16, 58), (18, 46), (18, 85), (19, 84), (20, 63), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 80), (32, 89), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (40, 68), (43, 44), (43, 88), (46, 47), (48, 49), (49, 83), (50, 65), (57, 76), (64, 91), (66, 72), (67, 72), (75, 76), (79, 80), (84, 85), (88, 98), (95, 96), (96, 98)] adding cut for [(2, 70), (2, 71), (4, 69), (4, 78), (69, 81), (73, 74), (10, 82), (10, 52), (34, 82), (34, 51), (77, 78), (51, 77), (21, 52), (21, 31), (22, 74), (55, 81), (5, 73), (5, 55), (31, 71)] adding cut for [(97, 100), (99, 101), (6, 86), (6, 61), (39, 87), (60, 93), (60, 94), (45, 92), (15, 39), (15, 45), (17, 87), (17, 62), (94, 100), (38, 99), (38, 93), (92, 101), (62, 86)] Optimize a model with 244 rows, 5050 columns and 84048 nonzeros Presolve time: 0.10s Presolved: 244 rows, 5050 columns, 84048 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.570255e+02, 331 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.02548 0 92 3624.00000 857.02548 76.4% - 0s Another try with MIP start H 0 0 874.0000000 857.02548 1.94% - 0s H 0 0 871.0000000 857.02548 1.60% - 0s 0 0 858.56614 0 92 871.00000 858.56614 1.43% - 0s 0 0 858.56614 0 92 871.00000 858.56614 1.43% - 0s 0 0 859.00855 0 104 871.00000 859.00855 1.38% - 0s 0 0 859.02143 0 109 871.00000 859.02143 1.38% - 0s 0 0 859.23220 0 106 871.00000 859.23220 1.35% - 0s 0 0 859.23220 0 109 871.00000 859.23220 1.35% - 0s 0 0 859.23220 0 108 871.00000 859.23220 1.35% - 0s 0 0 859.23220 0 111 871.00000 859.23220 1.35% - 0s 0 0 859.23220 0 112 871.00000 859.23220 1.35% - 0s 0 0 859.23220 0 112 871.00000 859.23220 1.35% - 0s 0 2 859.27980 0 112 871.00000 859.27980 1.35% - 1s * 66 47 41 866.0000000 860.11553 0.68% 22.3 1s * 170 61 16 864.0000000 860.66667 0.39% 18.9 1s Cutting planes: Gomory: 3 MIR: 4 Zero half: 11 Explored 790 nodes (13435 simplex iterations) in 1.97 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (6, 61), (6, 86), (7, 97), (8, 19), (8, 89), (9, 47), (9, 83), (10, 52), (10, 82), (11, 33), (11, 71), (12, 20), (12, 63), (15, 39), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (20, 49), (21, 31), (21, 67), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 80), (31, 71), (33, 91), (34, 51), (34, 52), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 93), (38, 99), (39, 87), (40, 68), (43, 44), (43, 88), (45, 92), (46, 84), (47, 48), (49, 83), (50, 65), (51, 77), (57, 76), (60, 94), (60, 100), (61, 84), (62, 85), (63, 89), (64, 65), (64, 91), (66, 72), (67, 72), (77, 78), (79, 82), (86, 94), (88, 98), (92, 101), (93, 96), (96, 98), (97, 100), (99, 101)] Optimize a model with 245 rows, 5050 columns and 87051 nonzeros Presolve time: 0.10s Presolved: 245 rows, 5050 columns, 87051 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.570892e+02, 337 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.08922 0 95 3624.00000 857.08922 76.3% - 0s Another try with MIP start H 0 0 876.0000000 857.08922 2.16% - 0s H 0 0 871.0000000 857.08922 1.60% - 0s 0 0 858.18985 0 99 871.00000 858.18985 1.47% - 0s 0 0 858.18985 0 95 871.00000 858.18985 1.47% - 0s 0 0 859.11054 0 101 871.00000 859.11054 1.37% - 0s 0 0 859.13636 0 104 871.00000 859.13636 1.36% - 0s 0 0 859.31336 0 109 871.00000 859.31336 1.34% - 0s 0 0 859.39611 0 116 871.00000 859.39611 1.33% - 0s 0 0 859.39611 0 120 871.00000 859.39611 1.33% - 0s 0 0 859.40389 0 119 871.00000 859.40389 1.33% - 0s 0 0 859.40389 0 124 871.00000 859.40389 1.33% - 0s 0 0 859.44658 0 117 871.00000 859.44658 1.33% - 0s 0 0 859.44658 0 118 871.00000 859.44658 1.33% - 0s 0 0 859.44658 0 121 871.00000 859.44658 1.33% - 1s 0 0 859.44658 0 121 871.00000 859.44658 1.33% - 1s H 0 0 870.0000000 859.44658 1.21% - 1s 0 2 859.49563 0 121 870.00000 859.49563 1.21% - 1s H 58 58 868.0000000 859.70883 0.96% 24.0 1s * 79 68 51 867.0000000 859.70883 0.84% 21.8 1s * 325 162 37 865.0000000 860.65823 0.50% 18.6 1s * 772 275 26 864.0000000 861.13829 0.33% 19.6 3s Cutting planes: Gomory: 14 MIR: 10 Zero half: 16 Explored 1077 nodes (21306 simplex iterations) in 3.74 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(6, 85), (6, 86), (7, 97), (8, 53), (8, 83), (9, 46), (9, 47), (12, 20), (12, 65), (15, 39), (15, 45), (17, 62), (17, 87), (18, 46), (18, 85), (20, 49), (37, 48), (37, 50), (38, 93), (38, 99), (39, 87), (45, 92), (47, 48), (49, 83), (50, 65), (60, 93), (60, 94), (62, 86), (92, 101), (94, 100), (97, 100), (99, 101)] adding cut for [(5, 26), (5, 40), (11, 63), (11, 64), (21, 33), (21, 67), (22, 73), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 56), (30, 79), (32, 89), (33, 91), (35, 36), (35, 79), (36, 66), (40, 68), (42, 75), (57, 76), (63, 89), (64, 91), (66, 72), (67, 72), (73, 74), (74, 75)] adding cut for [(2, 71), (2, 51), (34, 80), (34, 82), (4, 78), (4, 80), (69, 78), (69, 81), (10, 82), (10, 52), (13, 55), (51, 77), (55, 81), (31, 71), (31, 52)] Optimize a model with 248 rows, 5050 columns and 88134 nonzeros Presolve time: 0.10s Presolved: 248 rows, 5050 columns, 88134 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.570892e+02, 328 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.08922 0 95 3624.00000 857.08922 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.08922 1.60% - 0s 0 0 858.18985 0 99 871.00000 858.18985 1.47% - 0s 0 0 858.18985 0 95 871.00000 858.18985 1.47% - 0s 0 0 859.11054 0 103 871.00000 859.11054 1.37% - 0s 0 0 859.13636 0 104 871.00000 859.13636 1.36% - 0s 0 0 859.31336 0 114 871.00000 859.31336 1.34% - 0s 0 0 859.42039 0 116 871.00000 859.42039 1.33% - 0s 0 0 859.42039 0 117 871.00000 859.42039 1.33% - 0s 0 0 859.42039 0 120 871.00000 859.42039 1.33% - 0s 0 0 859.42039 0 117 871.00000 859.42039 1.33% - 0s 0 0 859.42039 0 121 871.00000 859.42039 1.33% - 0s H 0 0 870.0000000 859.42039 1.22% - 1s 0 2 859.50827 0 121 870.00000 859.50827 1.21% - 1s * 40 24 25 865.0000000 859.82041 0.60% 25.9 1s * 154 55 13 864.0000000 860.80123 0.37% 21.4 1s Cutting planes: Gomory: 3 MIR: 6 Zero half: 16 Explored 500 nodes (9746 simplex iterations) in 1.78 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(4, 79), (4, 80), (5, 27), (5, 57), (6, 61), (6, 85), (9, 46), (9, 47), (11, 63), (11, 64), (12, 20), (12, 65), (15, 39), (15, 45), (17, 45), (17, 62), (18, 85), (18, 87), (20, 63), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 80), (33, 67), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 99), (38, 101), (39, 87), (40, 68), (46, 84), (47, 48), (50, 65), (55, 56), (60, 93), (60, 94), (61, 84), (62, 86), (64, 91), (66, 67), (66, 72), (86, 92), (92, 101), (93, 99), (94, 100), (97, 100)] adding cut for [(96, 98), (3, 42), (3, 58), (22, 74), (43, 44), (43, 88), (16, 44), (16, 58), (75, 76), (73, 75), (73, 74), (23, 42), (23, 76), (88, 98), (95, 96)] adding cut for [(2, 71), (69, 78), (69, 81), (10, 82), (10, 52), (13, 81), (34, 82), (34, 51), (77, 78), (51, 77), (21, 52), (21, 31), (31, 71)] Optimize a model with 251 rows, 5050 columns and 89776 nonzeros Presolve time: 0.10s Presolved: 251 rows, 5050 columns, 89776 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.570892e+02, 317 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.08922 0 95 3624.00000 857.08922 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.08922 1.60% - 0s 0 0 858.18985 0 99 871.00000 858.18985 1.47% - 0s 0 0 858.18985 0 95 871.00000 858.18985 1.47% - 0s 0 0 858.95332 0 106 871.00000 858.95332 1.38% - 0s 0 0 859.13636 0 103 871.00000 859.13636 1.36% - 0s 0 0 859.38755 0 108 871.00000 859.38755 1.33% - 0s 0 0 859.38755 0 115 871.00000 859.38755 1.33% - 0s 0 0 859.38758 0 112 871.00000 859.38758 1.33% - 0s 0 0 859.38758 0 116 871.00000 859.38758 1.33% - 0s 0 0 859.41150 0 115 871.00000 859.41150 1.33% - 0s 0 0 859.41150 0 119 871.00000 859.41150 1.33% - 0s 0 0 859.41150 0 118 871.00000 859.41150 1.33% - 1s 0 0 859.41150 0 122 871.00000 859.41150 1.33% - 1s 0 0 859.41222 0 117 871.00000 859.41222 1.33% - 1s 0 0 859.41222 0 118 871.00000 859.41222 1.33% - 1s 0 0 859.41222 0 118 871.00000 859.41222 1.33% - 1s 0 2 859.42531 0 118 871.00000 859.42531 1.33% - 1s H 27 27 868.0000000 859.71126 0.95% 25.3 1s * 301 133 28 865.0000000 860.32638 0.54% 19.2 1s * 912 168 23 864.0000000 861.63142 0.27% 20.2 3s Cutting planes: Gomory: 13 MIR: 8 Zero half: 12 Explored 1131 nodes (22804 simplex iterations) in 3.83 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(5, 55), (5, 56), (6, 85), (6, 100), (9, 46), (9, 47), (14, 88), (15, 43), (15, 44), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (42, 58), (43, 88), (45, 92), (47, 48), (50, 65), (57, 76), (60, 94), (60, 97), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (75, 76), (86, 94), (92, 101), (93, 98), (93, 99), (95, 96), (96, 98), (97, 100)] adding cut for [(32, 89), (34, 80), (34, 82), (4, 78), (4, 80), (69, 78), (69, 81), (8, 83), (8, 89), (10, 82), (10, 52), (11, 71), (11, 63), (12, 20), (12, 63), (13, 81), (20, 49), (49, 83), (31, 71), (31, 52)] Optimize a model with 253 rows, 5050 columns and 91697 nonzeros Presolve time: 0.10s Presolved: 253 rows, 5050 columns, 91697 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.570892e+02, 317 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.08922 0 95 3624.00000 857.08922 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.08922 1.60% - 0s 0 0 858.18985 0 99 871.00000 858.18985 1.47% - 0s 0 0 858.18985 0 95 871.00000 858.18985 1.47% - 0s 0 0 858.88621 0 108 871.00000 858.88621 1.39% - 0s 0 0 859.13866 0 109 871.00000 859.13866 1.36% - 0s 0 0 859.20843 0 120 871.00000 859.20843 1.35% - 0s 0 0 859.26079 0 117 871.00000 859.26079 1.35% - 0s 0 0 859.27682 0 121 871.00000 859.27682 1.35% - 0s 0 0 859.29557 0 131 871.00000 859.29557 1.34% - 0s 0 0 859.30148 0 130 871.00000 859.30148 1.34% - 0s 0 0 859.30148 0 134 871.00000 859.30148 1.34% - 0s 0 0 859.33450 0 122 871.00000 859.33450 1.34% - 0s 0 0 859.33769 0 128 871.00000 859.33769 1.34% - 0s 0 0 859.34676 0 124 871.00000 859.34676 1.34% - 0s 0 0 859.34676 0 129 871.00000 859.34676 1.34% - 0s 0 0 859.47225 0 123 871.00000 859.47225 1.32% - 1s 0 0 859.47225 0 126 871.00000 859.47225 1.32% - 1s 0 0 859.47225 0 123 871.00000 859.47225 1.32% - 1s 0 0 859.47225 0 127 871.00000 859.47225 1.32% - 1s 0 0 859.47225 0 127 871.00000 859.47225 1.32% - 1s H 0 0 870.0000000 859.47225 1.21% - 1s 0 2 859.49842 0 126 870.00000 859.49842 1.21% - 1s H 37 37 867.0000000 859.65972 0.85% 28.5 1s * 216 83 14 865.0000000 860.65602 0.50% 22.2 1s * 585 106 18 864.0000000 861.49628 0.29% 19.4 2s Cutting planes: Gomory: 3 MIR: 8 Zero half: 19 Explored 860 nodes (16446 simplex iterations) in 2.58 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (5, 26), (5, 40), (13, 81), (15, 39), (15, 43), (16, 44), (16, 58), (17, 87), (17, 92), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 35), (35, 79), (38, 93), (38, 99), (39, 45), (40, 68), (42, 58), (43, 44), (45, 87), (55, 56), (57, 76), (60, 93), (60, 100), (69, 78), (69, 81), (79, 80), (92, 101), (97, 100), (99, 101)] adding cut for [(9, 19), (9, 47), (10, 36), (10, 52), (21, 31), (21, 67), (31, 33), (33, 91), (34, 51), (34, 82), (36, 72), (37, 48), (37, 50), (47, 48), (50, 65), (51, 77), (52, 82), (64, 65), (64, 91), (66, 67), (66, 72)] adding cut for [(6, 94), (6, 61), (46, 84), (18, 46), (18, 85), (86, 94), (61, 84), (62, 86), (62, 85)] Optimize a model with 256 rows, 5050 columns and 92667 nonzeros Presolve time: 0.10s Presolved: 256 rows, 5050 columns, 92667 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.570892e+02, 350 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.08922 0 95 3624.00000 857.08922 76.3% - 0s Another try with MIP start H 0 0 866.0000000 857.08922 1.03% - 0s 0 0 858.18985 0 99 866.00000 858.18985 0.90% - 0s 0 0 858.18985 0 95 866.00000 858.18985 0.90% - 0s 0 0 858.67116 0 101 866.00000 858.67116 0.85% - 0s 0 0 858.85405 0 116 866.00000 858.85405 0.83% - 0s 0 0 859.08385 0 120 866.00000 859.08385 0.80% - 0s 0 0 859.08385 0 125 866.00000 859.08385 0.80% - 0s 0 2 859.68103 0 120 866.00000 859.68103 0.73% - 0s H 39 19 865.0000000 860.11029 0.57% 35.7 1s * 168 47 29 864.0000000 861.37484 0.30% 29.2 1s Cutting planes: Gomory: 15 MIR: 5 Zero half: 20 Explored 369 nodes (9000 simplex iterations) in 2.28 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (5, 26), (5, 40), (6, 85), (6, 86), (9, 46), (9, 47), (10, 36), (10, 52), (13, 81), (15, 39), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (21, 31), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 35), (31, 33), (33, 91), (34, 51), (34, 82), (35, 79), (36, 66), (37, 48), (37, 50), (38, 93), (38, 99), (39, 87), (40, 68), (43, 44), (43, 88), (45, 92), (47, 48), (50, 65), (51, 77), (52, 82), (55, 56), (57, 76), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (73, 74), (73, 76), (74, 75), (79, 80), (88, 98), (92, 101), (93, 98), (99, 101)] Optimize a model with 257 rows, 5050 columns and 94945 nonzeros Presolve time: 0.10s Presolved: 257 rows, 5050 columns, 94945 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.570892e+02, 330 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.08922 0 95 3624.00000 857.08922 76.3% - 0s Another try with MIP start H 0 0 883.0000000 857.08922 2.93% - 0s H 0 0 871.0000000 857.08922 1.60% - 0s 0 0 858.18985 0 99 871.00000 858.18985 1.47% - 0s 0 0 858.18985 0 95 871.00000 858.18985 1.47% - 0s 0 0 858.88621 0 108 871.00000 858.88621 1.39% - 0s 0 0 859.20780 0 114 871.00000 859.20780 1.35% - 0s 0 0 859.25179 0 123 871.00000 859.25179 1.35% - 0s 0 0 859.28720 0 121 871.00000 859.28720 1.34% - 0s 0 0 859.32950 0 126 871.00000 859.32950 1.34% - 0s 0 0 859.34402 0 122 871.00000 859.34402 1.34% - 0s 0 0 859.34743 0 131 871.00000 859.34743 1.34% - 0s 0 0 859.36651 0 134 871.00000 859.36651 1.34% - 0s 0 0 859.42038 0 130 871.00000 859.42038 1.33% - 0s 0 0 859.42729 0 137 871.00000 859.42729 1.33% - 0s 0 0 859.43939 0 137 871.00000 859.43939 1.33% - 0s 0 0 859.44785 0 138 871.00000 859.44785 1.33% - 0s 0 0 859.45902 0 132 871.00000 859.45902 1.33% - 1s 0 0 859.45902 0 136 871.00000 859.45902 1.33% - 1s 0 0 859.45902 0 132 871.00000 859.45902 1.33% - 1s 0 0 859.45902 0 136 871.00000 859.45902 1.33% - 1s 0 0 859.45902 0 136 871.00000 859.45902 1.33% - 1s H 0 0 870.0000000 859.45902 1.21% - 1s 0 2 859.46216 0 136 870.00000 859.46216 1.21% - 1s * 88 79 53 869.0000000 860.12435 1.02% 20.8 1s * 213 168 55 868.0000000 860.37816 0.88% 18.9 1s * 292 86 13 865.0000000 860.65982 0.50% 19.4 1s * 293 37 13 864.0000000 860.65982 0.39% 19.3 1s Cutting planes: Gomory: 4 MIR: 6 Zero half: 28 Explored 606 nodes (11770 simplex iterations) in 2.23 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (4, 79), (4, 80), (5, 26), (5, 40), (6, 61), (6, 100), (9, 47), (9, 83), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (15, 43), (15, 45), (16, 44), (16, 58), (17, 87), (17, 92), (18, 46), (18, 85), (20, 49), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 80), (31, 52), (31, 71), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (46, 84), (47, 48), (49, 83), (50, 65), (55, 56), (57, 76), (60, 93), (60, 94), (61, 84), (62, 85), (62, 86), (64, 65), (64, 91), (66, 67), (66, 72), (75, 76), (86, 94), (92, 101), (93, 99), (97, 100)] Optimize a model with 258 rows, 5050 columns and 97573 nonzeros Presolve time: 0.10s Presolved: 258 rows, 5050 columns, 97573 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573246e+02, 336 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.32464 0 99 3624.00000 857.32464 76.3% - 0s Another try with MIP start H 0 0 879.0000000 857.32464 2.47% - 0s H 0 0 871.0000000 857.32464 1.57% - 0s 0 0 858.86972 0 106 871.00000 858.86972 1.39% - 0s 0 0 858.86972 0 99 871.00000 858.86972 1.39% - 0s 0 0 859.56146 0 109 871.00000 859.56146 1.31% - 0s 0 0 859.57121 0 117 871.00000 859.57121 1.31% - 0s 0 0 859.57121 0 123 871.00000 859.57121 1.31% - 0s 0 0 859.57121 0 121 871.00000 859.57121 1.31% - 0s 0 0 859.57121 0 124 871.00000 859.57121 1.31% - 0s 0 0 859.57121 0 129 871.00000 859.57121 1.31% - 0s 0 2 859.59639 0 129 871.00000 859.59639 1.31% - 1s * 93 80 58 870.0000000 860.18256 1.13% 21.6 1s * 210 151 43 868.0000000 860.41892 0.87% 19.0 1s * 361 214 51 867.0000000 860.56511 0.74% 18.2 1s * 735 361 43 866.0000000 861.10244 0.57% 20.3 3s * 869 333 30 865.0000000 861.16613 0.44% 21.1 3s 1209 340 863.94894 31 111 865.00000 861.68818 0.38% 21.5 5s * 1317 245 41 864.0000000 861.96680 0.24% 21.2 5s Cutting planes: Gomory: 6 MIR: 2 Zero half: 8 Explored 1395 nodes (29875 simplex iterations) in 5.23 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (6, 61), (6, 85), (7, 97), (9, 46), (9, 47), (15, 39), (15, 43), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (33, 91), (35, 36), (35, 79), (36, 66), (37, 47), (37, 50), (38, 99), (38, 101), (39, 45), (40, 68), (42, 58), (43, 44), (45, 87), (50, 65), (57, 76), (60, 94), (60, 99), (61, 84), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (75, 76), (79, 80), (86, 92), (92, 101), (94, 100), (97, 100)] Optimize a model with 259 rows, 5050 columns and 99284 nonzeros Presolve time: 0.10s Presolved: 259 rows, 5050 columns, 99284 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573246e+02, 337 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.32464 0 99 3624.00000 857.32464 76.3% - 0s Another try with MIP start H 0 0 870.0000000 857.32464 1.46% - 0s 0 0 858.86972 0 106 870.00000 858.86972 1.28% - 0s 0 0 858.86972 0 99 870.00000 858.86972 1.28% - 0s 0 0 859.52921 0 109 870.00000 859.52921 1.20% - 0s 0 0 859.52921 0 113 870.00000 859.52921 1.20% - 0s 0 0 859.52921 0 112 870.00000 859.52921 1.20% - 0s 0 0 859.52921 0 113 870.00000 859.52921 1.20% - 0s 0 0 859.52921 0 117 870.00000 859.52921 1.20% - 0s 0 0 859.52921 0 111 870.00000 859.52921 1.20% - 0s 0 2 859.59636 0 109 870.00000 859.59636 1.20% - 0s H 27 27 868.0000000 859.96389 0.93% 25.3 1s * 366 234 23 867.0000000 860.52699 0.75% 18.5 1s * 523 235 17 866.0000000 861.14141 0.56% 18.6 1s * 626 102 11 864.0000000 861.38272 0.30% 18.3 2s Cutting planes: Gomory: 3 MIR: 4 Zero half: 22 Explored 933 nodes (16877 simplex iterations) in 2.48 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(2, 70), (2, 71), (8, 49), (8, 89), (9, 47), (9, 83), (10, 52), (10, 82), (11, 63), (11, 64), (12, 20), (12, 65), (20, 63), (21, 33), (21, 67), (31, 52), (31, 71), (32, 89), (33, 91), (34, 79), (34, 82), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (64, 91), (66, 67), (66, 72)] adding cut for [(5, 56), (5, 73), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (57, 76), (60, 96), (60, 99), (62, 86), (73, 74), (75, 76), (86, 92), (92, 101), (95, 96)] Optimize a model with 261 rows, 5050 columns and 100308 nonzeros Presolve time: 0.10s Presolved: 261 rows, 5050 columns, 100308 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573246e+02, 337 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.32464 0 99 3624.00000 857.32464 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.32464 1.57% - 0s 0 0 858.86972 0 106 871.00000 858.86972 1.39% - 0s 0 0 858.86972 0 99 871.00000 858.86972 1.39% - 0s 0 0 859.14419 0 107 871.00000 859.14419 1.36% - 0s 0 0 859.52786 0 113 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 117 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 111 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 113 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 111 871.00000 859.52786 1.32% - 1s 0 0 859.52786 0 114 871.00000 859.52786 1.32% - 1s 0 2 859.54855 0 114 871.00000 859.54855 1.31% - 1s * 62 62 38 869.0000000 859.90326 1.05% 22.5 1s * 175 128 37 868.0000000 860.32678 0.88% 19.4 1s * 302 87 19 865.0000000 860.58571 0.51% 20.3 1s * 597 88 13 864.0000000 861.76846 0.26% 20.7 2s Cutting planes: Gomory: 2 MIR: 6 Zero half: 9 Explored 794 nodes (16247 simplex iterations) in 2.56 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (6, 61), (6, 85), (9, 47), (9, 83), (11, 63), (11, 64), (12, 20), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (20, 63), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (33, 67), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 60), (38, 99), (39, 45), (39, 87), (40, 68), (43, 44), (46, 47), (48, 49), (49, 83), (50, 65), (57, 76), (60, 94), (61, 84), (62, 86), (64, 91), (66, 67), (66, 72), (75, 76), (86, 92), (92, 101), (94, 100), (97, 100), (99, 101)] Optimize a model with 262 rows, 5050 columns and 102078 nonzeros Presolve time: 0.10s Presolved: 262 rows, 5050 columns, 102078 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573246e+02, 337 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.32464 0 99 3624.00000 857.32464 76.3% - 0s Another try with MIP start H 0 0 869.0000000 857.32464 1.34% - 0s 0 0 858.86972 0 106 869.00000 858.86972 1.17% - 0s 0 0 858.86972 0 99 869.00000 858.86972 1.17% - 0s 0 0 859.14419 0 109 869.00000 859.14419 1.13% - 0s 0 0 859.52786 0 114 869.00000 859.52786 1.09% - 0s 0 0 859.52786 0 118 869.00000 859.52786 1.09% - 0s 0 0 859.53369 0 117 869.00000 859.53369 1.09% - 0s 0 0 859.53369 0 121 869.00000 859.53369 1.09% - 0s 0 0 859.53461 0 120 869.00000 859.53461 1.09% - 0s 0 0 859.56195 0 119 869.00000 859.56195 1.09% - 0s 0 0 859.56195 0 122 869.00000 859.56195 1.09% - 0s 0 0 859.56195 0 121 869.00000 859.56195 1.09% - 0s 0 0 859.56195 0 124 869.00000 859.56195 1.09% - 1s 0 0 859.56475 0 125 869.00000 859.56475 1.09% - 1s 0 2 859.57329 0 125 869.00000 859.57329 1.08% - 1s H 312 249 868.0000000 860.38228 0.88% 17.6 1s H 600 377 867.0000000 860.75786 0.72% 16.9 2s * 938 465 34 866.0000000 860.82580 0.60% 20.7 4s * 949 361 44 865.0000000 860.82580 0.48% 20.5 4s 1106 349 862.82619 24 130 865.00000 861.82031 0.37% 20.3 5s * 1762 167 36 864.0000000 862.60349 0.16% 20.7 6s Cutting planes: Gomory: 9 MIR: 1 Zero half: 11 Explored 1824 nodes (37863 simplex iterations) in 6.57 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.640000000000e+02, best bound 8.640000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 26), (5, 40), (6, 85), (6, 100), (7, 97), (9, 46), (9, 47), (11, 63), (11, 64), (12, 20), (12, 65), (15, 43), (15, 44), (16, 44), (16, 58), (18, 46), (18, 85), (20, 63), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 79), (33, 67), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (40, 68), (43, 88), (47, 48), (50, 65), (55, 56), (57, 76), (64, 91), (66, 67), (66, 72), (73, 74), (73, 76), (74, 75), (88, 98), (95, 96), (96, 98), (97, 100)] adding cut for [(2, 71), (2, 51), (34, 80), (34, 82), (4, 78), (4, 80), (69, 78), (69, 81), (10, 82), (10, 52), (13, 81), (51, 77), (21, 52), (21, 31), (31, 71)] adding cut for [(38, 99), (38, 101), (39, 45), (39, 87), (60, 93), (60, 94), (45, 92), (17, 62), (17, 87), (62, 86), (86, 94), (92, 101), (93, 99)] Optimize a model with 265 rows, 5050 columns and 103602 nonzeros Presolve time: 0.09s Presolved: 265 rows, 5050 columns, 103602 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573246e+02, 321 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.32464 0 99 3624.00000 857.32464 76.3% - 0s Another try with MIP start H 0 0 875.0000000 857.32464 2.02% - 0s H 0 0 871.0000000 857.32464 1.57% - 0s 0 0 858.86972 0 106 871.00000 858.86972 1.39% - 0s 0 0 858.86972 0 99 871.00000 858.86972 1.39% - 0s 0 0 859.52786 0 109 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 113 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 111 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 110 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 113 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 111 871.00000 859.52786 1.32% - 1s 0 0 859.52786 0 114 871.00000 859.52786 1.32% - 1s 0 0 859.52786 0 113 871.00000 859.52786 1.32% - 1s H 0 0 870.0000000 859.52786 1.20% - 1s 0 2 859.54777 0 111 870.00000 859.54777 1.20% - 1s * 45 35 28 866.0000000 860.15732 0.67% 26.2 1s 1437 366 863.81579 26 83 866.00000 862.47870 0.41% 21.8 5s * 1735 257 33 865.0000000 862.72988 0.26% 21.2 5s Cutting planes: Gomory: 9 MIR: 2 Zero half: 7 Explored 2378 nodes (48163 simplex iterations) in 6.58 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 30), (4, 80), (9, 46), (9, 47), (16, 44), (16, 58), (19, 84), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (33, 91), (35, 36), (35, 79), (36, 66), (37, 47), (37, 50), (40, 68), (43, 44), (43, 88), (46, 84), (50, 65), (57, 76), (60, 94), (60, 96), (64, 65), (64, 91), (66, 72), (67, 72), (75, 76), (79, 80), (88, 98), (94, 100), (96, 98), (97, 100)] adding cut for [(32, 89), (2, 70), (2, 51), (8, 89), (8, 83), (10, 82), (10, 52), (11, 71), (11, 63), (12, 20), (12, 63), (34, 82), (34, 51), (48, 49), (49, 83), (20, 48), (31, 71), (31, 52)] adding cut for [(99, 101), (6, 85), (6, 61), (39, 87), (93, 95), (15, 39), (15, 45), (17, 45), (17, 62), (18, 85), (18, 87), (86, 92), (38, 99), (38, 93), (92, 101), (62, 86)] Optimize a model with 268 rows, 5050 columns and 104855 nonzeros Presolve time: 0.09s Presolved: 268 rows, 5050 columns, 104855 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573246e+02, 342 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.32464 0 99 3624.00000 857.32464 76.3% - 0s Another try with MIP start H 0 0 872.0000000 857.32464 1.68% - 0s H 0 0 871.0000000 857.32464 1.57% - 0s 0 0 858.86972 0 107 871.00000 858.86972 1.39% - 0s 0 0 858.86972 0 99 871.00000 858.86972 1.39% - 0s 0 0 859.53072 0 110 871.00000 859.53072 1.32% - 0s 0 0 859.53072 0 114 871.00000 859.53072 1.32% - 0s 0 0 859.55289 0 116 871.00000 859.55289 1.31% - 0s 0 0 859.57658 0 117 871.00000 859.57658 1.31% - 0s 0 0 859.57658 0 121 871.00000 859.57658 1.31% - 0s 0 0 859.57658 0 117 871.00000 859.57658 1.31% - 0s 0 0 859.57658 0 123 871.00000 859.57658 1.31% - 0s 0 0 859.57658 0 121 871.00000 859.57658 1.31% - 0s 0 0 859.57658 0 127 871.00000 859.57658 1.31% - 1s 0 0 859.57658 0 125 871.00000 859.57658 1.31% - 1s H 0 0 870.0000000 859.57658 1.20% - 1s 0 2 859.64599 0 125 870.00000 859.64599 1.19% - 1s * 279 119 27 866.0000000 860.28463 0.66% 18.6 1s * 1195 271 30 865.0000000 862.17788 0.33% 20.9 4s 1555 230 863.85714 22 80 865.00000 862.82735 0.25% 20.5 5s Cutting planes: Gomory: 12 MIR: 22 Zero half: 14 Explored 2163 nodes (41857 simplex iterations) in 6.05 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (3, 42), (3, 58), (5, 57), (5, 73), (8, 49), (8, 89), (9, 47), (9, 83), (10, 52), (10, 82), (11, 63), (11, 64), (12, 20), (12, 65), (16, 44), (16, 58), (20, 63), (21, 52), (21, 67), (23, 42), (23, 75), (24, 68), (24, 76), (25, 30), (25, 55), (26, 40), (26, 56), (30, 79), (31, 33), (31, 71), (32, 89), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (40, 68), (43, 44), (43, 88), (47, 48), (49, 83), (50, 65), (55, 56), (57, 76), (64, 91), (66, 72), (67, 72), (73, 74), (74, 75), (88, 98), (95, 97), (96, 97), (96, 98)] adding cut for [(99, 101), (38, 99), (38, 93), (6, 86), (6, 61), (39, 87), (92, 101), (62, 85), (45, 92), (46, 84), (17, 62), (17, 87), (18, 46), (18, 85), (86, 94), (15, 39), (15, 45), (60, 100), (60, 93), (61, 84), (94, 100)] Optimize a model with 270 rows, 5050 columns and 106776 nonzeros Presolve time: 0.09s Presolved: 270 rows, 5050 columns, 106776 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573246e+02, 323 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.32464 0 100 3624.00000 857.32464 76.3% - 0s Another try with MIP start H 0 0 878.0000000 857.32464 2.35% - 0s H 0 0 871.0000000 857.32464 1.57% - 0s 0 0 858.86972 0 107 871.00000 858.86972 1.39% - 0s 0 0 858.86972 0 100 871.00000 858.86972 1.39% - 0s 0 0 859.14419 0 107 871.00000 859.14419 1.36% - 0s 0 0 859.54673 0 110 871.00000 859.54673 1.31% - 0s 0 0 859.58048 0 113 871.00000 859.58048 1.31% - 0s 0 0 859.62317 0 121 871.00000 859.62317 1.31% - 0s 0 0 859.63361 0 124 871.00000 859.63361 1.30% - 0s 0 0 859.63378 0 130 871.00000 859.63378 1.30% - 0s 0 0 859.63621 0 124 871.00000 859.63621 1.30% - 0s 0 0 859.63646 0 129 871.00000 859.63646 1.30% - 0s 0 0 859.63646 0 128 871.00000 859.63646 1.30% - 1s 0 0 859.63646 0 132 871.00000 859.63646 1.30% - 1s H 0 0 870.0000000 859.63646 1.19% - 1s 0 2 859.68341 0 132 870.00000 859.68341 1.19% - 1s H 27 27 868.0000000 860.08192 0.91% 24.7 1s * 434 256 17 867.0000000 860.74887 0.72% 19.7 2s * 492 228 19 866.0000000 860.82768 0.60% 20.1 2s * 1137 259 27 865.0000000 862.14657 0.33% 22.4 4s 1420 191 863.75342 27 99 865.00000 862.55174 0.28% 21.8 5s Cutting planes: Gomory: 9 MIR: 4 Zero half: 5 Explored 2025 nodes (41160 simplex iterations) in 5.82 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0% adding cut for [(3, 58), (3, 74), (4, 78), (4, 80), (10, 52), (10, 82), (14, 88), (15, 39), (15, 43), (16, 44), (16, 58), (17, 62), (17, 87), (21, 52), (21, 67), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (34, 80), (34, 82), (35, 36), (35, 79), (36, 66), (38, 98), (38, 99), (39, 45), (40, 68), (42, 75), (43, 44), (45, 87), (51, 77), (51, 78), (57, 76), (62, 86), (66, 72), (67, 72), (73, 74), (73, 75), (86, 92), (88, 98), (92, 101), (99, 101)] adding cut for [(64, 91), (33, 91), (2, 70), (2, 71), (37, 48), (37, 50), (9, 46), (9, 47), (12, 64), (12, 65), (18, 46), (18, 85), (47, 48), (50, 65), (19, 84), (6, 85), (6, 61), (61, 84), (31, 33), (31, 71)] Optimize a model with 272 rows, 5050 columns and 108162 nonzeros Presolve time: 0.09s Presolved: 272 rows, 5050 columns, 108162 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573246e+02, 350 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.32464 0 100 3624.00000 857.32464 76.3% - 0s Another try with MIP start H 0 0 867.0000000 857.32464 1.12% - 0s 0 0 858.86972 0 104 867.00000 858.86972 0.94% - 0s 0 0 858.86972 0 100 867.00000 858.86972 0.94% - 0s 0 0 859.53789 0 106 867.00000 859.53789 0.86% - 0s H 0 0 866.0000000 859.53789 0.75% - 0s 0 0 859.53789 0 112 866.00000 859.53789 0.75% - 0s 0 2 860.11640 0 112 866.00000 860.11640 0.68% - 0s * 919 215 23 865.0000000 862.86427 0.25% 22.8 3s Cutting planes: Gomory: 10 MIR: 13 Zero half: 19 Explored 1405 nodes (28934 simplex iterations) in 4.39 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0% adding cut for [(3, 88), (4, 78), (4, 80), (6, 61), (6, 85), (9, 47), (9, 83), (11, 63), (11, 64), (12, 20), (12, 65), (16, 44), (16, 58), (18, 46), (18, 85), (19, 84), (20, 63), (21, 33), (21, 67), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (40, 68), (42, 58), (43, 44), (43, 88), (46, 47), (48, 49), (49, 83), (50, 65), (57, 76), (61, 84), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (79, 80)] adding cut for [(96, 98), (97, 100), (38, 99), (38, 101), (39, 87), (60, 94), (60, 86), (45, 92), (15, 39), (15, 45), (17, 87), (17, 62), (94, 100), (92, 101), (93, 98), (93, 99), (62, 86), (95, 96)] Optimize a model with 274 rows, 5050 columns and 109608 nonzeros Presolve time: 0.09s Presolved: 274 rows, 5050 columns, 109608 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573246e+02, 351 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.32464 0 100 3624.00000 857.32464 76.3% - 0s Another try with MIP start H 0 0 873.0000000 857.32464 1.80% - 0s H 0 0 871.0000000 857.32464 1.57% - 0s 0 0 858.86972 0 106 871.00000 858.86972 1.39% - 0s 0 0 858.86972 0 100 871.00000 858.86972 1.39% - 0s 0 0 859.52985 0 110 871.00000 859.52985 1.32% - 0s 0 0 859.56421 0 124 871.00000 859.56421 1.31% - 0s 0 0 859.56421 0 128 871.00000 859.56421 1.31% - 0s 0 0 859.56712 0 122 871.00000 859.56712 1.31% - 0s 0 0 859.56712 0 125 871.00000 859.56712 1.31% - 0s 0 0 859.56712 0 125 871.00000 859.56712 1.31% - 0s 0 0 859.56712 0 125 871.00000 859.56712 1.31% - 0s H 0 0 870.0000000 859.56712 1.20% - 1s 0 2 859.57006 0 125 870.00000 859.57006 1.20% - 1s * 176 110 40 867.0000000 860.43962 0.76% 21.1 1s * 730 364 27 865.0000000 861.02490 0.46% 21.4 3s 982 388 862.55089 30 120 865.00000 861.31932 0.43% 22.7 5s Cutting planes: Gomory: 9 MIR: 12 Zero half: 27 Explored 1889 nodes (39621 simplex iterations) in 6.70 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (6, 61), (6, 85), (9, 46), (9, 47), (12, 64), (12, 65), (15, 39), (15, 44), (16, 42), (16, 44), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 96), (38, 99), (39, 45), (40, 68), (45, 87), (47, 48), (50, 65), (57, 76), (61, 84), (62, 86), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (75, 76), (79, 80), (86, 92), (92, 101), (95, 96), (99, 101)] Optimize a model with 275 rows, 5050 columns and 111148 nonzeros Presolve time: 0.09s Presolved: 275 rows, 5050 columns, 111148 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573246e+02, 341 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.32464 0 100 3624.00000 857.32464 76.3% - 0s Another try with MIP start H 0 0 872.0000000 857.32464 1.68% - 0s H 0 0 871.0000000 857.32464 1.57% - 0s 0 0 858.86972 0 107 871.00000 858.86972 1.39% - 0s 0 0 858.86972 0 100 871.00000 858.86972 1.39% - 0s 0 0 859.22816 0 107 871.00000 859.22816 1.35% - 0s 0 0 859.54673 0 110 871.00000 859.54673 1.31% - 0s 0 0 859.55972 0 116 871.00000 859.55972 1.31% - 0s 0 0 859.58449 0 115 871.00000 859.58449 1.31% - 0s 0 0 859.61366 0 123 871.00000 859.61366 1.31% - 0s 0 0 859.66832 0 117 871.00000 859.66832 1.30% - 0s 0 0 859.67085 0 128 871.00000 859.67085 1.30% - 0s 0 0 859.67365 0 120 871.00000 859.67365 1.30% - 1s 0 0 859.67365 0 126 871.00000 859.67365 1.30% - 1s 0 0 859.67365 0 124 871.00000 859.67365 1.30% - 1s 0 0 859.67365 0 131 871.00000 859.67365 1.30% - 1s 0 0 859.67365 0 130 871.00000 859.67365 1.30% - 1s H 0 0 870.0000000 859.67365 1.19% - 1s 0 2 859.73835 0 128 870.00000 859.73835 1.18% - 1s * 92 52 19 866.0000000 860.22519 0.67% 24.2 1s * 154 62 19 865.0000000 860.85000 0.48% 23.3 1s Cutting planes: Gomory: 2 MIR: 6 Zero half: 15 Explored 1193 nodes (22877 simplex iterations) in 3.35 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0% adding cut for [(4, 30), (4, 80), (5, 26), (5, 40), (6, 85), (6, 86), (9, 46), (9, 47), (12, 64), (12, 65), (15, 39), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (21, 33), (21, 67), (22, 73), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 56), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 99), (38, 101), (39, 87), (40, 68), (42, 58), (43, 44), (43, 88), (45, 92), (47, 48), (50, 65), (57, 76), (62, 86), (64, 91), (66, 67), (66, 72), (73, 76), (74, 75), (79, 80), (88, 98), (92, 101), (93, 98), (93, 99)] adding cut for [(32, 89), (2, 70), (2, 51), (8, 89), (8, 83), (10, 82), (10, 52), (11, 71), (11, 63), (34, 82), (34, 51), (49, 83), (20, 49), (20, 63), (31, 71), (31, 52)] Optimize a model with 277 rows, 5050 columns and 112880 nonzeros Presolve time: 0.09s Presolved: 277 rows, 5050 columns, 112880 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573246e+02, 339 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.32464 0 100 3624.00000 857.32464 76.3% - 0s Another try with MIP start H 0 0 870.0000000 857.32464 1.46% - 0s 0 0 858.86972 0 106 870.00000 858.86972 1.28% - 0s 0 0 858.86972 0 100 870.00000 858.86972 1.28% - 0s 0 0 859.12256 0 107 870.00000 859.12256 1.25% - 0s 0 0 859.52786 0 107 870.00000 859.52786 1.20% - 0s 0 0 859.52786 0 113 870.00000 859.52786 1.20% - 0s 0 0 859.52786 0 111 870.00000 859.52786 1.20% - 0s 0 0 859.52786 0 110 870.00000 859.52786 1.20% - 0s 0 0 859.52786 0 116 870.00000 859.52786 1.20% - 0s 0 0 859.52786 0 113 870.00000 859.52786 1.20% - 1s 0 0 859.52786 0 117 870.00000 859.52786 1.20% - 1s 0 0 859.52786 0 108 870.00000 859.52786 1.20% - 1s 0 2 859.54855 0 108 870.00000 859.54855 1.20% - 1s * 55 47 33 868.0000000 859.97903 0.92% 24.5 1s * 141 81 28 867.0000000 860.07097 0.80% 21.9 1s * 372 143 20 866.0000000 861.08163 0.57% 20.8 2s * 982 192 28 865.0000000 861.84690 0.36% 22.7 4s 1354 127 862.94073 20 104 865.00000 862.57457 0.28% 22.2 5s Cutting planes: Gomory: 8 MIR: 2 Zero half: 6 Explored 1783 nodes (38343 simplex iterations) in 5.86 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (4, 78), (4, 80), (10, 52), (10, 82), (11, 63), (11, 64), (13, 69), (21, 33), (21, 67), (25, 30), (25, 55), (30, 80), (31, 52), (31, 71), (32, 89), (33, 91), (34, 79), (34, 82), (35, 36), (35, 79), (36, 72), (51, 77), (55, 81), (63, 89), (64, 91), (66, 67), (66, 72), (69, 81), (77, 78)] adding cut for [(8, 19), (8, 83), (9, 46), (9, 47), (12, 20), (12, 65), (15, 39), (15, 45), (17, 45), (17, 62), (18, 46), (18, 87), (20, 49), (37, 48), (37, 50), (38, 93), (38, 99), (39, 87), (47, 48), (49, 83), (50, 65), (60, 93), (60, 96), (62, 86), (86, 92), (92, 101), (95, 96), (99, 101)] adding cut for [(3, 42), (3, 58), (5, 56), (5, 73), (14, 98), (16, 44), (16, 58), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (40, 68), (43, 44), (43, 88), (57, 76), (73, 74), (75, 76), (88, 98)] Optimize a model with 280 rows, 5050 columns and 114013 nonzeros Presolve time: 0.09s Presolved: 280 rows, 5050 columns, 114013 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573246e+02, 339 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.32464 0 100 3624.00000 857.32464 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.32464 1.57% - 0s 0 0 858.86972 0 106 871.00000 858.86972 1.39% - 0s 0 0 858.86972 0 100 871.00000 858.86972 1.39% - 0s 0 0 859.52786 0 107 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 111 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 111 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 110 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 113 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 113 871.00000 859.52786 1.32% - 1s 0 0 859.52786 0 111 871.00000 859.52786 1.32% - 1s H 0 0 870.0000000 859.52786 1.20% - 1s 0 2 859.54777 0 111 870.00000 859.54777 1.20% - 1s * 42 34 23 867.0000000 860.14573 0.79% 32.8 1s * 245 123 14 866.0000000 860.91725 0.59% 24.3 1s * 1165 209 32 865.0000000 862.43654 0.30% 22.8 4s 1504 114 863.71077 20 118 865.00000 863.22635 0.21% 22.1 5s Cutting planes: Gomory: 11 MIR: 2 Zero half: 8 Explored 1682 nodes (36582 simplex iterations) in 5.21 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 27), (5, 57), (6, 61), (6, 85), (9, 46), (9, 47), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 62), (18, 85), (21, 33), (21, 67), (22, 41), (22, 73), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (39, 45), (39, 87), (40, 68), (43, 44), (46, 84), (47, 48), (50, 65), (55, 56), (61, 84), (64, 65), (64, 91), (66, 72), (67, 72), (73, 74), (74, 75), (75, 76)] adding cut for [(4, 78), (4, 80), (8, 83), (8, 89), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (13, 81), (20, 49), (31, 52), (31, 71), (32, 89), (34, 51), (34, 82), (49, 83), (51, 77), (69, 80), (69, 81), (77, 78)] adding cut for [(96, 98), (97, 100), (99, 101), (38, 99), (38, 93), (92, 101), (86, 92), (86, 94), (88, 98), (60, 96), (60, 93), (94, 100)] Optimize a model with 283 rows, 5050 columns and 115670 nonzeros Presolve time: 0.09s Presolved: 283 rows, 5050 columns, 115670 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573246e+02, 345 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.32464 0 100 3624.00000 857.32464 76.3% - 0s Another try with MIP start H 0 0 872.0000000 857.32464 1.68% - 0s H 0 0 871.0000000 857.32464 1.57% - 0s 0 0 858.87365 0 108 871.00000 858.87365 1.39% - 0s 0 0 858.87365 0 100 871.00000 858.87365 1.39% - 0s 0 0 859.52786 0 108 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 112 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 107 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 111 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 109 871.00000 859.52786 1.32% - 0s 0 0 859.52786 0 111 871.00000 859.52786 1.32% - 1s 0 0 859.52786 0 110 871.00000 859.52786 1.32% - 1s 0 2 859.54855 0 110 871.00000 859.54855 1.31% - 1s * 154 116 45 870.0000000 860.01793 1.15% 22.4 1s * 201 130 38 869.0000000 860.03551 1.03% 21.2 1s * 202 109 37 868.0000000 860.03551 0.92% 21.1 1s * 240 117 21 867.0000000 860.22209 0.78% 22.0 1s * 316 128 14 866.0000000 860.64114 0.62% 22.3 1s 1373 292 864.73310 25 104 866.00000 862.52703 0.40% 22.4 5s * 2565 198 23 865.0000000 863.42361 0.18% 20.6 7s Cutting planes: Gomory: 7 MIR: 2 Zero half: 6 Explored 2820 nodes (55934 simplex iterations) in 7.43 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0% adding cut for [(6, 61), (6, 85), (11, 63), (11, 64), (12, 20), (12, 65), (13, 69), (18, 46), (18, 85), (20, 63), (21, 33), (21, 67), (25, 30), (25, 55), (30, 79), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (46, 47), (47, 48), (50, 65), (55, 81), (64, 91), (66, 67), (66, 72), (69, 81)] adding cut for [(3, 88), (5, 56), (5, 73), (15, 44), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (39, 45), (39, 87), (40, 68), (42, 58), (43, 88), (43, 101), (57, 76), (62, 86), (73, 74), (75, 76), (86, 92), (92, 101)] Optimize a model with 285 rows, 5050 columns and 116511 nonzeros Presolve time: 0.10s Presolved: 285 rows, 5050 columns, 116511 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573382e+02, 344 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.33820 0 101 3624.00000 857.33820 76.3% - 0s Another try with MIP start H 0 0 875.0000000 857.33820 2.02% - 0s H 0 0 871.0000000 857.33820 1.57% - 0s 0 0 858.40419 0 103 871.00000 858.40419 1.45% - 0s 0 0 858.40419 0 101 871.00000 858.40419 1.45% - 0s 0 0 859.24577 0 110 871.00000 859.24577 1.35% - 0s 0 0 859.33868 0 115 871.00000 859.33868 1.34% - 0s 0 0 859.34002 0 117 871.00000 859.34002 1.34% - 0s 0 0 859.36017 0 120 871.00000 859.36017 1.34% - 0s 0 0 859.44183 0 118 871.00000 859.44183 1.33% - 0s 0 0 859.44183 0 122 871.00000 859.44183 1.33% - 0s 0 0 859.44183 0 121 871.00000 859.44183 1.33% - 1s 0 0 859.44183 0 123 871.00000 859.44183 1.33% - 1s 0 0 859.44183 0 127 871.00000 859.44183 1.33% - 1s 0 0 859.44183 0 125 871.00000 859.44183 1.33% - 1s 0 2 859.49325 0 125 871.00000 859.49325 1.32% - 1s H 203 147 869.0000000 860.91709 0.93% 21.4 1s * 263 152 36 868.0000000 861.00178 0.81% 21.0 1s * 511 212 28 866.0000000 861.28099 0.54% 19.8 2s 1397 355 863.34667 17 109 866.00000 862.36131 0.42% 20.8 5s * 2052 326 24 865.0000000 862.90214 0.24% 20.1 6s Cutting planes: Gomory: 8 MIR: 3 Zero half: 4 Explored 2809 nodes (52539 simplex iterations) in 7.34 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0% adding cut for [(3, 58), (3, 74), (4, 78), (4, 80), (5, 22), (5, 55), (13, 55), (13, 81), (16, 44), (16, 58), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 35), (35, 79), (40, 68), (42, 75), (43, 44), (43, 88), (57, 76), (60, 86), (60, 96), (69, 78), (69, 81), (73, 74), (73, 75), (79, 80), (86, 94), (88, 98), (94, 100), (96, 98), (97, 100)] adding cut for [(6, 61), (6, 85), (9, 46), (9, 47), (10, 36), (10, 52), (15, 39), (15, 45), (17, 62), (17, 87), (18, 62), (18, 85), (21, 31), (21, 67), (31, 33), (33, 91), (34, 51), (34, 82), (36, 66), (37, 47), (37, 50), (38, 93), (38, 99), (39, 87), (45, 92), (46, 84), (50, 65), (51, 77), (52, 82), (61, 84), (64, 65), (64, 91), (66, 72), (67, 72), (92, 101), (93, 95), (99, 101)] adding cut for [(32, 89), (2, 70), (2, 71), (8, 83), (8, 89), (11, 71), (11, 63), (12, 20), (12, 63), (48, 49), (49, 83), (20, 48)] Optimize a model with 288 rows, 5050 columns and 117995 nonzeros Presolve time: 0.10s Presolved: 288 rows, 5050 columns, 117995 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573382e+02, 368 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.33820 0 101 3624.00000 857.33820 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.33820 1.57% - 0s 0 0 858.40419 0 103 871.00000 858.40419 1.45% - 0s 0 0 858.40419 0 101 871.00000 858.40419 1.45% - 0s 0 0 859.19409 0 105 871.00000 859.19409 1.36% - 0s 0 0 859.24142 0 108 871.00000 859.24142 1.35% - 0s 0 0 859.27532 0 121 871.00000 859.27532 1.35% - 0s 0 0 859.55972 0 119 871.00000 859.55972 1.31% - 0s 0 0 859.59229 0 126 871.00000 859.59229 1.31% - 0s 0 0 859.66901 0 126 871.00000 859.66901 1.30% - 0s 0 0 859.69061 0 126 871.00000 859.69061 1.30% - 0s 0 0 859.70553 0 128 871.00000 859.70553 1.30% - 0s 0 0 859.70663 0 133 871.00000 859.70663 1.30% - 0s 0 0 859.70663 0 130 871.00000 859.70663 1.30% - 1s 0 0 859.70663 0 134 871.00000 859.70663 1.30% - 1s 0 0 859.71226 0 129 871.00000 859.71226 1.30% - 1s 0 0 859.71226 0 133 871.00000 859.71226 1.30% - 1s 0 0 859.71226 0 130 871.00000 859.71226 1.30% - 1s 0 0 859.71226 0 134 871.00000 859.71226 1.30% - 1s 0 0 859.71595 0 127 871.00000 859.71595 1.30% - 1s H 0 0 870.0000000 859.71595 1.18% - 1s 0 0 859.71595 0 131 870.00000 859.71595 1.18% - 1s 0 2 860.07154 0 130 870.00000 860.07154 1.14% - 2s * 77 43 42 869.0000000 860.36828 0.99% 33.2 4s H 120 74 868.0000000 860.36989 0.88% 33.2 4s * 227 99 36 866.0000000 861.33581 0.54% 32.2 4s 347 133 863.01979 17 115 866.00000 862.42362 0.41% 28.4 5s * 2045 163 38 865.0000000 863.42308 0.18% 22.1 9s Cutting planes: Gomory: 9 MIR: 3 Zero half: 8 Explored 2289 nodes (48782 simplex iterations) in 9.85 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 74), (4, 30), (4, 80), (5, 26), (5, 40), (8, 49), (8, 89), (9, 47), (9, 83), (11, 63), (11, 64), (12, 20), (12, 65), (20, 63), (21, 33), (21, 67), (22, 41), (22, 73), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (32, 89), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (40, 68), (47, 48), (49, 83), (50, 65), (55, 56), (57, 76), (64, 91), (66, 67), (66, 72), (73, 75), (74, 75), (79, 80)] adding cut for [(96, 98), (39, 45), (43, 88), (43, 58), (45, 87), (46, 84), (15, 39), (15, 44), (16, 44), (16, 58), (17, 87), (17, 62), (18, 46), (18, 85), (19, 84), (88, 98), (62, 85), (95, 96)] Optimize a model with 290 rows, 5050 columns and 119201 nonzeros Presolve time: 0.10s Presolved: 290 rows, 5050 columns, 119201 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573382e+02, 374 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.33820 0 101 3624.00000 857.33820 76.3% - 0s Another try with MIP start H 0 0 873.0000000 857.33820 1.79% - 0s H 0 0 871.0000000 857.33820 1.57% - 0s 0 0 858.40419 0 101 871.00000 858.40419 1.45% - 0s 0 0 858.40419 0 101 871.00000 858.40419 1.45% - 0s 0 0 859.19409 0 108 871.00000 859.19409 1.36% - 0s 0 0 859.54673 0 108 871.00000 859.54673 1.31% - 0s 0 0 859.56370 0 114 871.00000 859.56370 1.31% - 0s 0 0 859.58449 0 108 871.00000 859.58449 1.31% - 0s 0 0 859.61240 0 118 871.00000 859.61240 1.31% - 0s 0 0 859.66832 0 119 871.00000 859.66832 1.30% - 0s 0 0 859.67652 0 127 871.00000 859.67652 1.30% - 1s 0 0 859.70272 0 127 871.00000 859.70272 1.30% - 1s 0 0 859.70272 0 130 871.00000 859.70272 1.30% - 1s 0 0 859.72825 0 125 871.00000 859.72825 1.29% - 1s 0 0 859.72825 0 129 871.00000 859.72825 1.29% - 1s 0 0 859.78883 0 126 871.00000 859.78883 1.29% - 1s 0 0 859.78883 0 130 871.00000 859.78883 1.29% - 1s 0 0 859.79918 0 127 871.00000 859.79918 1.29% - 1s 0 2 859.83198 0 127 871.00000 859.83198 1.28% - 1s * 132 97 37 868.0000000 860.46412 0.87% 22.1 1s * 303 178 36 867.0000000 860.74490 0.72% 22.1 2s H 644 317 866.0000000 861.54884 0.51% 22.1 4s 879 340 862.66098 19 112 866.00000 861.66858 0.50% 22.9 5s 3024 546 864.84545 26 89 866.00000 863.62379 0.27% 19.9 10s * 3786 87 26 865.0000000 863.86905 0.13% 19.3 11s Cutting planes: Gomory: 13 MIR: 14 Zero half: 26 Explored 3877 nodes (74431 simplex iterations) in 11.50 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0% adding cut for [(2, 70), (2, 71), (6, 61), (6, 86), (9, 46), (9, 47), (11, 63), (11, 91), (12, 20), (12, 64), (15, 39), (15, 45), (17, 62), (17, 87), (18, 46), (18, 85), (20, 63), (31, 33), (31, 71), (33, 91), (37, 48), (37, 50), (38, 93), (38, 99), (39, 87), (45, 92), (47, 48), (50, 65), (61, 84), (62, 86), (64, 65), (84, 85), (92, 101), (93, 95), (99, 101)] adding cut for [(4, 78), (4, 80), (5, 55), (5, 73), (10, 52), (10, 82), (13, 55), (21, 52), (21, 67), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (34, 51), (34, 82), (35, 36), (35, 79), (36, 66), (40, 68), (42, 75), (51, 77), (57, 76), (66, 72), (67, 72), (69, 78), (69, 81), (73, 75), (79, 80)] Optimize a model with 292 rows, 5050 columns and 120392 nonzeros Presolve time: 0.10s Presolved: 292 rows, 5050 columns, 120392 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 362 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 868.0000000 857.34012 1.23% - 0s 0 0 858.56264 0 107 868.00000 858.56264 1.09% - 0s 0 0 858.56264 0 102 868.00000 858.56264 1.09% - 0s 0 0 858.98866 0 117 868.00000 858.98866 1.04% - 0s 0 0 859.22420 0 110 868.00000 859.22420 1.01% - 0s 0 0 859.57187 0 116 868.00000 859.57187 0.97% - 0s 0 0 859.57615 0 118 868.00000 859.57615 0.97% - 0s 0 0 859.57615 0 122 868.00000 859.57615 0.97% - 0s 0 0 859.58910 0 120 868.00000 859.58910 0.97% - 0s 0 0 859.63852 0 121 868.00000 859.63852 0.96% - 0s 0 0 859.63852 0 122 868.00000 859.63852 0.96% - 0s 0 2 860.15988 0 122 868.00000 860.15988 0.90% - 1s H 41 29 867.0000000 860.32628 0.77% 35.8 2s * 47 23 27 866.0000000 860.32628 0.66% 35.0 2s 618 225 862.76271 24 129 866.00000 862.76271 0.37% 24.1 5s * 969 181 38 865.0000000 862.76271 0.26% 24.1 5s Cutting planes: Gomory: 10 MIR: 2 Zero half: 10 Explored 1439 nodes (33117 simplex iterations) in 6.85 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0% adding cut for [(3, 88), (4, 78), (4, 80), (6, 61), (6, 85), (9, 46), (9, 47), (12, 64), (12, 65), (15, 39), (15, 43), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 98), (38, 99), (39, 45), (40, 68), (42, 58), (43, 44), (45, 87), (47, 48), (50, 65), (57, 76), (61, 84), (62, 86), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (75, 76), (79, 80), (86, 92), (88, 98), (92, 101), (99, 101)] Optimize a model with 293 rows, 5050 columns and 122045 nonzeros Presolve time: 0.10s Presolved: 293 rows, 5050 columns, 122045 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 339 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 874.0000000 857.34012 1.91% - 0s H 0 0 871.0000000 857.34012 1.57% - 0s 0 0 858.56264 0 107 871.00000 858.56264 1.43% - 0s 0 0 858.56264 0 102 871.00000 858.56264 1.43% - 0s 0 0 859.27804 0 113 871.00000 859.27804 1.35% - 0s 0 0 859.35107 0 116 871.00000 859.35107 1.34% - 0s 0 0 859.57187 0 120 871.00000 859.57187 1.31% - 0s 0 0 859.59188 0 121 871.00000 859.59188 1.31% - 0s 0 0 859.60423 0 131 871.00000 859.60423 1.31% - 0s 0 0 859.60628 0 127 871.00000 859.60628 1.31% - 0s 0 0 859.61378 0 131 871.00000 859.61378 1.31% - 0s 0 0 859.61378 0 133 871.00000 859.61378 1.31% - 1s 0 0 859.61378 0 131 871.00000 859.61378 1.31% - 1s 0 0 859.61378 0 134 871.00000 859.61378 1.31% - 1s 0 0 859.61378 0 132 871.00000 859.61378 1.31% - 1s H 0 0 870.0000000 859.61378 1.19% - 1s 0 2 859.64987 0 131 870.00000 859.64987 1.19% - 1s H 176 132 868.0000000 860.29136 0.89% 20.1 1s * 586 301 25 867.0000000 861.38806 0.65% 21.5 2s H 700 266 866.0000000 861.54572 0.51% 21.3 3s 890 331 861.99219 12 123 866.00000 861.54572 0.51% 23.0 5s 3185 583 864.33742 21 104 866.00000 863.48703 0.29% 21.0 10s Cutting planes: Gomory: 13 MIR: 10 Zero half: 18 Explored 5756 nodes (109916 simplex iterations) in 14.29 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (6, 61), (6, 85), (9, 46), (9, 47), (11, 63), (11, 64), (12, 20), (12, 65), (13, 55), (17, 62), (17, 87), (18, 85), (18, 87), (20, 63), (25, 30), (25, 55), (30, 81), (33, 67), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (46, 84), (47, 48), (50, 65), (60, 94), (60, 100), (61, 84), (62, 86), (64, 91), (66, 67), (66, 72), (69, 78), (69, 81), (79, 80), (86, 94), (97, 100)] adding cut for [(5, 56), (5, 73), (15, 39), (15, 44), (16, 42), (16, 44), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (38, 93), (38, 99), (39, 45), (40, 68), (45, 92), (57, 76), (73, 74), (75, 76), (92, 101), (93, 98), (95, 96), (96, 98), (99, 101)] Optimize a model with 295 rows, 5050 columns and 123257 nonzeros Presolve time: 0.10s Presolved: 295 rows, 5050 columns, 123257 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 326 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 870.0000000 857.34012 1.46% - 0s 0 0 858.56264 0 107 870.00000 858.56264 1.31% - 0s 0 0 858.56264 0 102 870.00000 858.56264 1.31% - 0s 0 0 858.85982 0 110 870.00000 858.85982 1.28% - 0s 0 0 859.22602 0 109 870.00000 859.22602 1.24% - 0s 0 0 859.57187 0 116 870.00000 859.57187 1.20% - 0s 0 0 859.57615 0 122 870.00000 859.57615 1.20% - 0s 0 0 859.59417 0 120 870.00000 859.59417 1.20% - 0s 0 0 859.59417 0 126 870.00000 859.59417 1.20% - 0s 0 0 859.59612 0 126 870.00000 859.59612 1.20% - 1s 0 0 859.59612 0 128 870.00000 859.59612 1.20% - 1s 0 0 859.59612 0 128 870.00000 859.59612 1.20% - 1s 0 2 859.73627 0 128 870.00000 859.73627 1.18% - 1s * 75 65 47 868.0000000 860.31987 0.88% 20.7 1s * 693 427 52 866.0000000 861.54466 0.51% 21.4 3s 813 469 861.58199 15 127 866.00000 861.54466 0.51% 22.1 5s 3333 486 863.92088 32 120 866.00000 863.77847 0.26% 19.1 10s Cutting planes: Gomory: 14 MIR: 6 Zero half: 13 Explored 4887 nodes (85825 simplex iterations) in 12.34 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (5, 55), (5, 73), (6, 61), (6, 85), (9, 47), (9, 83), (11, 63), (11, 64), (12, 20), (12, 65), (13, 55), (18, 46), (18, 85), (19, 84), (20, 63), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (40, 68), (46, 47), (48, 49), (49, 83), (50, 65), (57, 76), (61, 84), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (73, 76), (79, 80)] adding cut for [(3, 88), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 75), (38, 99), (38, 101), (39, 45), (39, 87), (42, 58), (43, 44), (62, 86), (74, 75), (86, 92), (88, 98), (92, 101), (93, 98), (93, 99)] Optimize a model with 297 rows, 5050 columns and 124568 nonzeros Presolve time: 0.10s Presolved: 297 rows, 5050 columns, 124568 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 315 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 867.0000000 857.34012 1.11% - 0s 0 0 858.56264 0 107 867.00000 858.56264 0.97% - 0s 0 0 858.56264 0 102 867.00000 858.56264 0.97% - 0s 0 0 859.22420 0 106 867.00000 859.22420 0.90% - 0s 0 0 859.57187 0 112 867.00000 859.57187 0.86% - 0s 0 0 859.57187 0 121 867.00000 859.57187 0.86% - 0s 0 2 860.12568 0 121 867.00000 860.12568 0.79% - 1s H 96 56 866.0000000 860.53439 0.63% 33.7 2s 1216 284 864.75261 25 102 866.00000 863.17857 0.33% 23.4 5s Cutting planes: Gomory: 10 MIR: 7 Zero half: 15 Explored 2853 nodes (59411 simplex iterations) in 8.28 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(5, 55), (5, 73), (6, 61), (6, 85), (9, 46), (9, 47), (12, 64), (12, 65), (13, 69), (18, 46), (18, 85), (19, 84), (21, 33), (21, 67), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (40, 68), (47, 48), (50, 65), (55, 81), (57, 76), (61, 84), (64, 91), (66, 67), (66, 72), (69, 81), (73, 76)] adding cut for [(15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 75), (38, 96), (38, 99), (39, 45), (39, 87), (42, 58), (43, 44), (62, 86), (74, 75), (86, 92), (92, 101), (95, 96), (99, 101)] adding cut for [(2, 70), (2, 51), (34, 80), (34, 82), (4, 78), (4, 80), (8, 53), (8, 83), (10, 82), (10, 52), (11, 71), (11, 63), (77, 78), (49, 83), (51, 77), (20, 49), (20, 63), (31, 71), (31, 52)] Optimize a model with 300 rows, 5050 columns and 125730 nonzeros Presolve time: 0.08s Presolved: 300 rows, 5050 columns, 125730 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 346 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 872.0000000 857.34012 1.68% - 0s H 0 0 871.0000000 857.34012 1.57% - 0s 0 0 858.56264 0 107 871.00000 858.56264 1.43% - 0s 0 0 858.56264 0 102 871.00000 858.56264 1.43% - 0s 0 0 859.57187 0 115 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 119 871.00000 859.57187 1.31% - 0s 0 0 859.59188 0 115 871.00000 859.59188 1.31% - 0s 0 0 859.60423 0 125 871.00000 859.60423 1.31% - 0s 0 0 859.60423 0 127 871.00000 859.60423 1.31% - 0s 0 0 859.60423 0 126 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 126 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 130 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 130 871.00000 859.60423 1.31% - 1s H 0 0 870.0000000 859.60423 1.19% - 1s 0 2 859.62796 0 130 870.00000 859.62796 1.19% - 1s * 177 123 28 868.0000000 860.36880 0.88% 22.3 1s * 582 300 31 867.0000000 861.21571 0.67% 21.9 2s * 981 426 34 866.0000000 861.59737 0.51% 23.9 4s 988 418 861.97960 20 117 866.00000 861.62418 0.51% 23.7 5s 3201 559 cutoff 25 866.00000 863.53731 0.28% 20.7 10s 5727 103 864.86238 30 104 866.00000 864.63415 0.16% 18.7 15s Cutting planes: Gomory: 13 MIR: 16 Zero half: 22 Explored 5868 nodes (109128 simplex iterations) in 15.30 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(2, 70), (2, 71), (6, 61), (6, 85), (9, 47), (9, 83), (10, 52), (10, 82), (11, 63), (11, 64), (12, 20), (12, 65), (18, 46), (18, 85), (19, 84), (20, 63), (21, 33), (21, 67), (31, 52), (31, 71), (33, 91), (34, 80), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (46, 47), (48, 49), (49, 83), (50, 65), (61, 84), (64, 91), (66, 72), (67, 72), (79, 80)] adding cut for [(4, 69), (4, 78), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (51, 77), (57, 76), (62, 86), (69, 81), (75, 76), (77, 78), (86, 92), (92, 101), (93, 95), (93, 99)] Optimize a model with 302 rows, 5050 columns and 127028 nonzeros Presolve time: 0.08s Presolved: 302 rows, 5050 columns, 127028 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 356 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 872.0000000 857.34012 1.68% - 0s H 0 0 871.0000000 857.34012 1.57% - 0s 0 0 858.56264 0 108 871.00000 858.56264 1.43% - 0s 0 0 858.56264 0 102 871.00000 858.56264 1.43% - 0s 0 0 859.31642 0 114 871.00000 859.31642 1.34% - 0s 0 0 859.42878 0 117 871.00000 859.42878 1.33% - 0s 0 0 859.57187 0 118 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 123 871.00000 859.57187 1.31% - 0s 0 0 859.59188 0 115 871.00000 859.59188 1.31% - 0s 0 0 859.60423 0 123 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 126 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 122 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 126 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 122 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 125 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 124 871.00000 859.60423 1.31% - 1s H 0 0 870.0000000 859.60423 1.19% - 1s 0 2 859.62671 0 122 870.00000 859.62671 1.19% - 1s * 255 191 36 868.0000000 860.38803 0.88% 22.6 2s H 542 295 867.0000000 860.94178 0.70% 21.8 3s * 664 250 26 866.0000000 861.29867 0.54% 21.7 3s 1002 358 863.25249 27 92 866.00000 861.69305 0.50% 23.4 5s 3201 451 cutoff 22 866.00000 863.65000 0.27% 21.0 10s Cutting planes: Gomory: 14 MIR: 8 Zero half: 14 Explored 4882 nodes (95101 simplex iterations) in 12.91 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (8, 53), (8, 83), (12, 64), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (20, 48), (20, 49), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 98), (38, 99), (39, 45), (39, 87), (40, 68), (43, 44), (49, 83), (50, 65), (57, 76), (62, 86), (64, 91), (66, 67), (66, 72), (75, 76), (86, 92), (88, 98), (92, 101), (99, 101)] adding cut for [(32, 89), (2, 70), (2, 51), (34, 80), (34, 82), (4, 78), (4, 80), (10, 82), (10, 52), (11, 71), (11, 63), (77, 78), (51, 77), (63, 89), (31, 71), (31, 52)] Optimize a model with 304 rows, 5050 columns and 128389 nonzeros Presolve time: 0.10s Presolved: 304 rows, 5050 columns, 128389 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 348 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 875.0000000 857.34012 2.02% - 0s H 0 0 871.0000000 857.34012 1.57% - 0s 0 0 858.56264 0 107 871.00000 858.56264 1.43% - 0s 0 0 858.56264 0 102 871.00000 858.56264 1.43% - 0s 0 0 859.31642 0 115 871.00000 859.31642 1.34% - 0s 0 0 859.42878 0 118 871.00000 859.42878 1.33% - 0s 0 0 859.57187 0 119 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 120 871.00000 859.57187 1.31% - 0s 0 0 859.59207 0 117 871.00000 859.59207 1.31% - 1s 0 0 859.60447 0 128 871.00000 859.60447 1.31% - 1s 0 0 859.60447 0 132 871.00000 859.60447 1.31% - 1s 0 0 859.60739 0 131 871.00000 859.60739 1.31% - 1s 0 0 859.60739 0 129 871.00000 859.60739 1.31% - 1s 0 0 859.60739 0 133 871.00000 859.60739 1.31% - 1s 0 0 859.61055 0 129 871.00000 859.61055 1.31% - 1s 0 0 859.61055 0 131 871.00000 859.61055 1.31% - 1s 0 0 859.61055 0 131 871.00000 859.61055 1.31% - 1s H 0 0 870.0000000 859.61055 1.19% - 1s 0 2 859.63836 0 131 870.00000 859.63836 1.19% - 1s H 27 27 868.0000000 859.72016 0.95% 20.0 1s * 211 146 40 867.0000000 859.98505 0.81% 20.9 2s * 568 252 38 866.0000000 861.34241 0.54% 20.3 2s 986 382 864.00365 23 94 866.00000 862.22439 0.44% 22.5 5s 3341 600 864.46526 27 95 866.00000 863.60854 0.28% 19.7 10s Cutting planes: Gomory: 16 MIR: 10 Zero half: 21 Explored 6019 nodes (107372 simplex iterations) in 14.96 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(9, 46), (9, 47), (12, 64), (12, 65), (15, 39), (15, 44), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 87), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 93), (38, 99), (39, 45), (40, 68), (42, 58), (43, 88), (43, 101), (45, 92), (47, 48), (50, 65), (57, 76), (60, 93), (60, 100), (62, 86), (64, 91), (66, 67), (66, 72), (73, 74), (73, 76), (74, 75), (86, 94), (88, 98), (92, 101), (94, 99), (95, 96), (96, 98), (97, 100)] adding cut for [(32, 89), (2, 70), (2, 51), (34, 80), (34, 82), (4, 78), (4, 80), (8, 89), (8, 83), (10, 82), (10, 52), (11, 71), (11, 63), (77, 78), (49, 83), (51, 77), (20, 49), (20, 63), (31, 71), (31, 52)] Optimize a model with 306 rows, 5050 columns and 130195 nonzeros Presolve time: 0.10s Presolved: 306 rows, 5050 columns, 130195 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 341 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 875.0000000 857.34012 2.02% - 0s H 0 0 871.0000000 857.34012 1.57% - 0s 0 0 858.56264 0 107 871.00000 858.56264 1.43% - 0s 0 0 858.56264 0 102 871.00000 858.56264 1.43% - 0s 0 0 859.57187 0 112 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 116 871.00000 859.57187 1.31% - 0s 0 0 859.57615 0 118 871.00000 859.57615 1.31% - 0s 0 0 859.57615 0 122 871.00000 859.57615 1.31% - 0s 0 0 859.58910 0 120 871.00000 859.58910 1.31% - 1s 0 0 859.63852 0 122 871.00000 859.63852 1.30% - 1s 0 0 859.63852 0 123 871.00000 859.63852 1.30% - 1s 0 0 859.63852 0 122 871.00000 859.63852 1.30% - 1s 0 0 859.63852 0 123 871.00000 859.63852 1.30% - 1s 0 0 859.64472 0 124 871.00000 859.64472 1.30% - 1s H 0 0 870.0000000 859.64472 1.19% - 1s 0 0 859.64633 0 128 870.00000 859.64633 1.19% - 1s 0 2 860.15905 0 128 870.00000 860.15905 1.13% - 2s H 40 27 868.0000000 860.66639 0.84% 40.1 3s * 58 25 31 867.0000000 860.66639 0.73% 33.3 3s * 374 142 31 866.0000000 862.10778 0.45% 27.9 4s 506 166 864.37046 18 115 866.00000 862.45455 0.41% 27.1 5s 2188 276 cutoff 27 866.00000 863.68438 0.27% 22.6 10s Cutting planes: Gomory: 9 MIR: 2 Zero half: 13 Explored 3111 nodes (65093 simplex iterations) in 11.50 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(5, 22), (5, 55), (6, 85), (6, 94), (9, 46), (9, 47), (13, 69), (18, 46), (18, 85), (22, 73), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (33, 67), (33, 91), (35, 36), (35, 79), (36, 72), (37, 47), (37, 50), (40, 68), (50, 65), (55, 81), (57, 76), (60, 96), (60, 97), (64, 65), (64, 91), (66, 67), (66, 72), (69, 81), (73, 76), (94, 100), (97, 100)] adding cut for [(2, 51), (2, 70), (4, 78), (4, 80), (8, 83), (8, 89), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (20, 48), (21, 31), (21, 52), (31, 71), (32, 89), (34, 80), (34, 82), (48, 49), (49, 83), (51, 77), (77, 78)] adding cut for [(3, 74), (14, 88), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (23, 42), (23, 75), (38, 99), (38, 101), (39, 45), (39, 87), (42, 58), (43, 44), (62, 86), (74, 75), (86, 92), (88, 98), (92, 101), (93, 98), (93, 99)] Optimize a model with 309 rows, 5050 columns and 131488 nonzeros Presolve time: 0.10s Presolved: 309 rows, 5050 columns, 131488 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 328 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 869.0000000 857.34012 1.34% - 0s 0 0 858.56264 0 107 869.00000 858.56264 1.20% - 0s 0 0 858.56264 0 102 869.00000 858.56264 1.20% - 0s 0 0 858.85982 0 110 869.00000 858.85982 1.17% - 0s 0 0 859.22602 0 109 869.00000 859.22602 1.12% - 0s 0 0 859.57187 0 112 869.00000 859.57187 1.08% - 0s 0 0 859.57187 0 116 869.00000 859.57187 1.08% - 0s 0 0 859.57615 0 118 869.00000 859.57615 1.08% - 0s 0 0 859.57947 0 121 869.00000 859.57947 1.08% - 0s 0 0 859.57947 0 125 869.00000 859.57947 1.08% - 1s 0 0 859.58866 0 124 869.00000 859.58866 1.08% - 1s 0 0 859.59666 0 122 869.00000 859.59666 1.08% - 1s 0 0 859.59666 0 126 869.00000 859.59666 1.08% - 1s 0 0 859.59666 0 125 869.00000 859.59666 1.08% - 1s 0 0 859.59666 0 123 869.00000 859.59666 1.08% - 1s 0 0 859.59666 0 126 869.00000 859.59666 1.08% - 1s H 0 0 868.0000000 859.59666 0.97% - 1s 0 0 859.59666 0 126 868.00000 859.59666 0.97% - 1s 0 2 860.13408 0 126 868.00000 860.13408 0.91% - 1s H 1 2 867.0000000 860.13408 0.79% 4.0 2s * 78 43 24 866.0000000 860.50191 0.63% 33.6 3s 750 221 863.08255 23 101 866.00000 862.86472 0.36% 23.5 5s Cutting planes: Gomory: 13 MIR: 8 Zero half: 22 Explored 2495 nodes (47732 simplex iterations) in 8.32 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(5, 27), (5, 57), (6, 61), (6, 85), (9, 46), (9, 47), (10, 52), (10, 72), (12, 64), (12, 65), (18, 46), (18, 85), (19, 84), (21, 31), (21, 52), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 79), (31, 33), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (40, 68), (47, 48), (50, 65), (55, 56), (61, 84), (64, 91), (66, 67), (67, 72)] adding cut for [(3, 42), (3, 58), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 76), (38, 99), (38, 101), (39, 45), (39, 87), (43, 44), (60, 94), (60, 99), (62, 86), (73, 74), (73, 75), (75, 76), (86, 92), (92, 101), (94, 100), (97, 100)] Optimize a model with 311 rows, 5050 columns and 132542 nonzeros Presolve time: 0.10s Presolved: 311 rows, 5050 columns, 132542 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 346 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 870.0000000 857.34012 1.46% - 0s 0 0 858.56264 0 107 870.00000 858.56264 1.31% - 0s 0 0 858.56264 0 102 870.00000 858.56264 1.31% - 0s 0 0 858.98866 0 117 870.00000 858.98866 1.27% - 0s 0 0 859.26873 0 115 870.00000 859.26873 1.23% - 0s 0 0 859.61901 0 118 870.00000 859.61901 1.19% - 0s 0 0 859.61901 0 122 870.00000 859.61901 1.19% - 0s 0 0 859.61901 0 114 870.00000 859.61901 1.19% - 1s 0 0 859.61901 0 117 870.00000 859.61901 1.19% - 1s 0 0 859.61901 0 118 870.00000 859.61901 1.19% - 1s 0 0 859.61901 0 118 870.00000 859.61901 1.19% - 1s 0 0 859.61901 0 117 870.00000 859.61901 1.19% - 1s 0 2 859.67101 0 117 870.00000 859.67101 1.19% - 1s H 208 138 868.0000000 860.53930 0.86% 19.8 1s H 600 338 867.0000000 861.29109 0.66% 19.7 2s 825 433 865.96861 26 84 867.00000 861.29109 0.66% 22.9 5s H 935 367 866.0000000 861.29109 0.54% 23.1 5s 2799 562 863.83741 24 98 866.00000 862.92285 0.36% 21.3 10s 5126 597 864.35000 22 99 866.00000 863.72826 0.26% 19.7 15s Cutting planes: Gomory: 15 MIR: 4 Zero half: 14 Explored 7138 nodes (131145 simplex iterations) in 18.97 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (5, 22), (5, 55), (15, 39), (15, 43), (16, 44), (16, 58), (17, 87), (17, 92), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 35), (35, 79), (38, 99), (38, 101), (39, 45), (40, 68), (43, 44), (45, 87), (55, 81), (57, 76), (60, 93), (60, 100), (69, 78), (69, 81), (73, 74), (73, 76), (74, 75), (79, 80), (92, 101), (93, 99), (97, 100)] adding cut for [(6, 61), (6, 94), (9, 46), (9, 47), (10, 36), (10, 52), (18, 46), (18, 85), (19, 84), (21, 31), (21, 67), (31, 33), (33, 91), (34, 51), (34, 82), (36, 72), (37, 48), (37, 50), (47, 48), (50, 65), (51, 77), (52, 82), (61, 84), (62, 85), (62, 86), (64, 65), (64, 91), (66, 67), (66, 72), (86, 94)] Optimize a model with 313 rows, 5050 columns and 133868 nonzeros Presolve time: 0.10s Presolved: 313 rows, 5050 columns, 133868 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 346 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 877.0000000 857.34012 2.24% - 0s H 0 0 871.0000000 857.34012 1.57% - 0s 0 0 858.56264 0 107 871.00000 858.56264 1.43% - 0s 0 0 858.56264 0 102 871.00000 858.56264 1.43% - 0s 0 0 859.31642 0 113 871.00000 859.31642 1.34% - 0s 0 0 859.42878 0 116 871.00000 859.42878 1.33% - 0s 0 0 859.57187 0 119 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 120 871.00000 859.57187 1.31% - 0s 0 0 859.59207 0 117 871.00000 859.59207 1.31% - 0s 0 0 859.60447 0 128 871.00000 859.60447 1.31% - 1s 0 0 859.60447 0 132 871.00000 859.60447 1.31% - 1s 0 0 859.60739 0 131 871.00000 859.60739 1.31% - 1s 0 0 859.60739 0 129 871.00000 859.60739 1.31% - 1s 0 0 859.60739 0 133 871.00000 859.60739 1.31% - 1s 0 0 859.61055 0 129 871.00000 859.61055 1.31% - 1s 0 0 859.61055 0 131 871.00000 859.61055 1.31% - 1s 0 0 859.61055 0 131 871.00000 859.61055 1.31% - 1s H 0 0 870.0000000 859.61055 1.19% - 1s 0 2 859.63836 0 131 870.00000 859.63836 1.19% - 1s H 27 27 869.0000000 859.72439 1.07% 27.1 1s * 182 144 55 868.0000000 860.50166 0.86% 19.4 2s * 583 312 18 867.0000000 861.25909 0.66% 20.5 2s * 817 390 41 866.0000000 861.53622 0.52% 21.4 4s 820 392 861.82241 15 108 866.00000 861.53622 0.52% 21.4 5s 2936 454 864.81573 22 99 866.00000 863.40594 0.30% 20.7 10s Cutting planes: Gomory: 16 MIR: 10 Zero half: 21 Explored 5460 nodes (101490 simplex iterations) in 14.89 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (4, 69), (4, 78), (6, 61), (6, 85), (15, 39), (15, 43), (16, 44), (16, 58), (17, 62), (17, 87), (18, 85), (18, 87), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (38, 99), (38, 101), (39, 45), (40, 68), (42, 58), (43, 44), (45, 92), (51, 77), (57, 76), (62, 86), (69, 81), (77, 78), (86, 99), (92, 101)] adding cut for [(8, 83), (8, 89), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (19, 84), (20, 49), (21, 33), (21, 67), (31, 52), (31, 71), (32, 89), (33, 91), (34, 80), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (46, 84), (47, 48), (49, 83), (50, 65), (64, 65), (64, 91), (66, 72), (67, 72), (79, 80)] Optimize a model with 315 rows, 5050 columns and 135166 nonzeros Presolve time: 0.10s Presolved: 315 rows, 5050 columns, 135166 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 340 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 875.0000000 857.34012 2.02% - 0s H 0 0 871.0000000 857.34012 1.57% - 0s 0 0 858.56264 0 107 871.00000 858.56264 1.43% - 0s 0 0 858.56264 0 102 871.00000 858.56264 1.43% - 0s 0 0 859.57187 0 115 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 119 871.00000 859.57187 1.31% - 0s 0 0 859.59188 0 115 871.00000 859.59188 1.31% - 0s 0 0 859.60423 0 126 871.00000 859.60423 1.31% - 0s 0 0 859.60423 0 126 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 123 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 126 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 128 871.00000 859.60423 1.31% - 1s H 0 0 870.0000000 859.60423 1.19% - 1s 0 2 859.62796 0 127 870.00000 859.62796 1.19% - 1s * 177 123 37 868.0000000 860.37010 0.88% 22.8 1s * 420 236 14 867.0000000 860.58787 0.74% 21.6 2s 774 389 863.34167 22 109 867.00000 861.59079 0.62% 24.0 5s * 1582 437 36 866.0000000 862.82353 0.37% 22.7 7s 2892 615 864.70588 23 91 866.00000 863.54517 0.28% 21.0 10s Cutting planes: Gomory: 13 MIR: 16 Zero half: 19 Mod-K: 1 Explored 5386 nodes (101024 simplex iterations) in 14.95 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(5, 26), (5, 40), (6, 85), (6, 86), (7, 97), (9, 46), (9, 47), (12, 64), (12, 65), (15, 39), (15, 45), (17, 62), (17, 87), (18, 46), (18, 85), (21, 33), (21, 67), (22, 41), (22, 73), (23, 75), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 80), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 99), (38, 101), (39, 87), (40, 68), (45, 92), (47, 48), (50, 65), (55, 56), (57, 76), (60, 93), (60, 94), (62, 86), (64, 91), (66, 67), (66, 72), (73, 74), (74, 75), (79, 80), (92, 101), (93, 99), (94, 100), (97, 100)] adding cut for [(32, 89), (2, 51), (8, 89), (8, 83), (10, 82), (10, 52), (11, 71), (11, 63), (34, 82), (34, 51), (49, 83), (20, 49), (20, 63), (31, 71), (31, 52)] Optimize a model with 317 rows, 5050 columns and 136826 nonzeros Presolve time: 0.10s Presolved: 317 rows, 5050 columns, 136826 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 363 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 880.0000000 857.34012 2.57% - 0s H 0 0 871.0000000 857.34012 1.57% - 0s 0 0 858.56264 0 107 871.00000 858.56264 1.43% - 0s 0 0 858.56264 0 102 871.00000 858.56264 1.43% - 0s 0 0 859.57187 0 114 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 118 871.00000 859.57187 1.31% - 0s 0 0 859.57947 0 117 871.00000 859.57947 1.31% - 0s 0 0 859.57947 0 121 871.00000 859.57947 1.31% - 0s 0 0 859.57947 0 121 871.00000 859.57947 1.31% - 1s 0 0 859.57947 0 125 871.00000 859.57947 1.31% - 1s 0 0 859.57947 0 125 871.00000 859.57947 1.31% - 1s H 0 0 870.0000000 859.57947 1.20% - 1s 0 2 859.61332 0 125 870.00000 859.61332 1.19% - 1s * 189 151 40 869.0000000 860.50431 0.98% 20.1 1s * 317 218 48 868.0000000 860.72510 0.84% 20.2 2s H 600 326 867.0000000 861.27653 0.66% 20.4 2s 1074 474 864.40196 24 100 867.00000 861.62500 0.62% 22.5 5s * 1243 405 29 866.0000000 861.77241 0.49% 22.1 5s 3395 746 864.35328 24 92 866.00000 863.22124 0.32% 20.3 10s 6045 760 865.00000 29 98 866.00000 863.85156 0.25% 18.9 15s 7918 200 cutoff 27 866.00000 864.50000 0.17% 18.4 20s Cutting planes: Gomory: 13 MIR: 7 Zero half: 12 Mod-K: 3 Explored 8213 nodes (149532 simplex iterations) in 20.33 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (5, 26), (5, 40), (13, 55), (22, 73), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 56), (30, 35), (35, 79), (40, 68), (42, 75), (55, 81), (57, 76), (69, 78), (69, 81), (73, 74), (74, 75), (79, 80)] adding cut for [(9, 46), (9, 47), (10, 36), (10, 52), (19, 84), (21, 33), (21, 67), (33, 91), (34, 51), (34, 82), (36, 66), (37, 48), (37, 50), (46, 84), (47, 48), (50, 65), (51, 77), (52, 82), (64, 65), (64, 91), (66, 72), (67, 72)] adding cut for [(97, 100), (99, 101), (6, 85), (6, 61), (39, 87), (60, 94), (60, 93), (7, 97), (94, 100), (45, 92), (15, 39), (15, 45), (17, 86), (17, 87), (18, 85), (18, 62), (38, 99), (38, 93), (92, 101), (62, 86)] Optimize a model with 320 rows, 5050 columns and 137589 nonzeros Presolve time: 0.10s Presolved: 320 rows, 5050 columns, 137589 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 363 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 872.0000000 857.34012 1.68% - 0s H 0 0 871.0000000 857.34012 1.57% - 0s 0 0 858.56264 0 107 871.00000 858.56264 1.43% - 0s 0 0 858.56264 0 102 871.00000 858.56264 1.43% - 0s 0 0 859.27804 0 110 871.00000 859.27804 1.35% - 0s 0 0 859.27804 0 117 871.00000 859.27804 1.35% - 0s 0 0 859.43227 0 124 871.00000 859.43227 1.33% - 0s 0 0 859.68322 0 121 871.00000 859.68322 1.30% - 0s 0 0 859.68322 0 125 871.00000 859.68322 1.30% - 1s 0 0 859.68322 0 122 871.00000 859.68322 1.30% - 1s 0 0 859.68322 0 123 871.00000 859.68322 1.30% - 1s 0 0 859.68322 0 127 871.00000 859.68322 1.30% - 1s 0 2 859.72324 0 125 871.00000 859.72324 1.29% - 1s H 52 50 868.0000000 859.93518 0.93% 24.9 1s * 365 206 17 867.0000000 860.90032 0.70% 22.0 2s * 404 183 26 866.0000000 860.90502 0.59% 22.3 2s 1002 319 863.14087 16 116 866.00000 862.33858 0.42% 23.3 5s 3680 47 cutoff 26 866.00000 864.76442 0.14% 18.9 10s Cutting planes: Gomory: 7 MIR: 4 Zero half: 8 Explored 3748 nodes (70926 simplex iterations) in 10.04 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 30), (4, 80), (11, 63), (11, 64), (16, 44), (16, 58), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (32, 89), (33, 91), (35, 36), (35, 79), (36, 66), (40, 68), (43, 44), (43, 88), (57, 76), (63, 89), (64, 91), (66, 72), (67, 72), (75, 76), (79, 80), (88, 98), (95, 96), (96, 98)] adding cut for [(8, 53), (8, 83), (9, 46), (9, 47), (12, 20), (12, 65), (15, 39), (15, 45), (17, 62), (17, 87), (18, 46), (18, 62), (20, 49), (37, 48), (37, 50), (38, 93), (38, 99), (39, 87), (45, 92), (47, 48), (49, 83), (50, 65), (60, 86), (60, 93), (86, 94), (92, 101), (94, 100), (97, 100), (99, 101)] adding cut for [(2, 70), (2, 71), (69, 78), (69, 81), (73, 74), (10, 82), (10, 52), (34, 82), (34, 51), (77, 78), (51, 77), (22, 74), (55, 81), (5, 73), (5, 55), (31, 71), (31, 52)] Optimize a model with 323 rows, 5050 columns and 138843 nonzeros Presolve time: 0.10s Presolved: 323 rows, 5050 columns, 138843 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 363 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.34012 1.57% - 0s 0 0 858.56264 0 107 871.00000 858.56264 1.43% - 0s 0 0 858.56264 0 102 871.00000 858.56264 1.43% - 0s 0 0 859.57187 0 113 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 117 871.00000 859.57187 1.31% - 0s 0 0 859.57615 0 118 871.00000 859.57615 1.31% - 0s 0 0 859.57615 0 122 871.00000 859.57615 1.31% - 0s 0 0 859.58910 0 120 871.00000 859.58910 1.31% - 1s 0 0 859.63852 0 122 871.00000 859.63852 1.30% - 1s 0 0 859.63852 0 123 871.00000 859.63852 1.30% - 1s 0 0 859.63852 0 122 871.00000 859.63852 1.30% - 1s 0 0 859.63852 0 123 871.00000 859.63852 1.30% - 1s 0 0 859.64472 0 124 871.00000 859.64472 1.30% - 1s 0 0 859.64633 0 134 871.00000 859.64633 1.30% - 1s 0 0 859.64633 0 129 871.00000 859.64633 1.30% - 1s H 0 0 870.0000000 859.64633 1.19% - 1s 0 0 859.64633 0 131 870.00000 859.64633 1.19% - 1s 0 2 860.15905 0 129 870.00000 860.15905 1.13% - 2s * 66 44 38 868.0000000 860.45602 0.87% 36.0 4s 296 200 864.84444 20 92 868.00000 861.57619 0.74% 29.7 5s * 322 173 29 867.0000000 861.57619 0.63% 29.2 5s H 386 134 866.0000000 862.17406 0.44% 28.6 5s 1961 309 cutoff 30 866.00000 863.49039 0.29% 22.8 10s Cutting planes: Gomory: 11 MIR: 2 Zero half: 8 Mod-K: 1 Explored 3357 nodes (68821 simplex iterations) in 12.56 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(2, 51), (4, 78), (4, 80), (15, 39), (15, 43), (16, 44), (16, 58), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 35), (34, 80), (34, 82), (35, 79), (38, 99), (38, 101), (39, 45), (40, 68), (42, 58), (43, 44), (45, 92), (51, 77), (57, 76), (75, 76), (77, 78), (79, 82), (92, 101), (93, 98), (93, 99), (95, 96), (96, 98)] adding cut for [(8, 83), (8, 89), (9, 46), (9, 47), (10, 36), (10, 52), (11, 63), (11, 71), (12, 20), (12, 63), (17, 62), (17, 87), (18, 46), (18, 87), (20, 48), (21, 33), (21, 67), (31, 52), (31, 71), (32, 89), (33, 91), (36, 66), (37, 47), (37, 50), (48, 49), (49, 83), (50, 65), (60, 94), (60, 100), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (86, 94), (97, 100)] Optimize a model with 325 rows, 5050 columns and 140175 nonzeros Presolve time: 0.11s Presolved: 325 rows, 5050 columns, 140175 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 341 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 872.0000000 857.34012 1.68% - 0s H 0 0 871.0000000 857.34012 1.57% - 0s 0 0 858.56264 0 107 871.00000 858.56264 1.43% - 0s 0 0 858.56264 0 102 871.00000 858.56264 1.43% - 0s 0 0 859.57187 0 112 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 116 871.00000 859.57187 1.31% - 0s 0 0 859.57615 0 118 871.00000 859.57615 1.31% - 0s 0 0 859.57615 0 122 871.00000 859.57615 1.31% - 0s 0 0 859.58910 0 120 871.00000 859.58910 1.31% - 1s 0 0 859.63852 0 122 871.00000 859.63852 1.30% - 1s 0 0 859.63852 0 123 871.00000 859.63852 1.30% - 1s 0 0 859.63852 0 122 871.00000 859.63852 1.30% - 1s 0 0 859.63852 0 123 871.00000 859.63852 1.30% - 1s 0 0 859.64472 0 128 871.00000 859.64472 1.30% - 1s 0 0 859.64633 0 133 871.00000 859.64633 1.30% - 1s 0 0 859.64633 0 128 871.00000 859.64633 1.30% - 1s 0 0 859.64633 0 132 871.00000 859.64633 1.30% - 1s 0 0 859.64633 0 131 871.00000 859.64633 1.30% - 1s 0 0 859.65398 0 122 871.00000 859.65398 1.30% - 1s 0 0 859.65398 0 126 871.00000 859.65398 1.30% - 2s 0 0 859.67452 0 130 871.00000 859.67452 1.30% - 2s 0 0 859.67452 0 135 871.00000 859.67452 1.30% - 2s 0 0 859.67452 0 131 871.00000 859.67452 1.30% - 2s 0 0 859.67452 0 134 871.00000 859.67452 1.30% - 2s 0 0 859.67452 0 133 871.00000 859.67452 1.30% - 2s 0 0 859.67452 0 136 871.00000 859.67452 1.30% - 2s 0 0 859.67452 0 136 871.00000 859.67452 1.30% - 2s H 0 0 870.0000000 859.67452 1.19% - 2s 0 2 859.73915 0 136 870.00000 859.73915 1.18% - 2s * 187 150 40 869.0000000 860.16251 1.02% 24.1 3s * 378 235 25 868.0000000 860.54079 0.86% 23.9 3s * 467 226 26 867.0000000 860.78865 0.72% 23.8 3s 610 288 861.51124 9 130 867.00000 861.34770 0.65% 23.3 5s * 722 311 26 866.0000000 861.34770 0.54% 25.8 6s 2117 359 864.54709 25 87 866.00000 863.58217 0.28% 22.9 10s Cutting planes: Gomory: 14 MIR: 12 Zero half: 22 Explored 3466 nodes (70813 simplex iterations) in 12.51 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (6, 61), (6, 85), (11, 63), (11, 64), (12, 20), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (20, 63), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 96), (38, 99), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (46, 47), (47, 48), (50, 65), (57, 76), (62, 86), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (75, 76), (79, 80), (86, 92), (92, 101), (95, 96), (99, 101)] Optimize a model with 326 rows, 5050 columns and 141828 nonzeros Presolve time: 0.11s Presolved: 326 rows, 5050 columns, 141828 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573401e+02, 366 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34012 0 102 3624.00000 857.34012 76.3% - 0s Another try with MIP start H 0 0 872.0000000 857.34012 1.68% - 0s H 0 0 871.0000000 857.34012 1.57% - 0s 0 0 858.56264 0 107 871.00000 858.56264 1.43% - 0s 0 0 858.56264 0 102 871.00000 858.56264 1.43% - 0s 0 0 859.57187 0 115 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 119 871.00000 859.57187 1.31% - 0s 0 0 859.59188 0 115 871.00000 859.59188 1.31% - 0s 0 0 859.60423 0 123 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 126 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 126 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 122 871.00000 859.60423 1.31% - 1s 0 0 859.60423 0 125 871.00000 859.60423 1.31% - 1s 0 2 859.62671 0 125 871.00000 859.62671 1.31% - 1s * 76 70 44 868.0000000 860.17198 0.90% 24.5 1s * 120 84 31 867.0000000 860.36123 0.77% 23.4 1s 847 387 862.55919 14 110 867.00000 861.73829 0.61% 23.2 5s * 1075 325 30 866.0000000 862.25369 0.43% 23.2 5s 3040 373 864.80000 20 100 866.00000 863.90993 0.24% 20.6 10s Cutting planes: Gomory: 17 MIR: 10 Zero half: 13 Mod-K: 1 Explored 4156 nodes (80106 simplex iterations) in 12.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (4, 78), (4, 80), (8, 49), (8, 89), (10, 52), (10, 82), (11, 32), (11, 63), (12, 20), (12, 63), (19, 83), (20, 48), (21, 33), (21, 67), (25, 30), (25, 81), (30, 79), (31, 52), (31, 71), (32, 89), (33, 91), (34, 80), (34, 82), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (49, 83), (50, 65), (51, 77), (64, 65), (64, 91), (66, 67), (66, 72), (69, 78), (69, 81)] adding cut for [(3, 74), (6, 85), (6, 86), (9, 47), (9, 84), (15, 39), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (23, 42), (23, 76), (38, 93), (38, 99), (39, 87), (42, 58), (43, 44), (43, 88), (45, 92), (46, 47), (60, 93), (60, 94), (61, 84), (62, 86), (73, 74), (73, 75), (75, 76), (88, 98), (92, 101), (94, 100), (96, 97), (96, 98), (97, 100), (99, 101)] Optimize a model with 328 rows, 5050 columns and 143311 nonzeros Presolve time: 0.11s Presolved: 328 rows, 5050 columns, 143311 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573500e+02, 349 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.34995 0 104 3624.00000 857.34995 76.3% - 0s Another try with MIP start H 0 0 870.0000000 857.34995 1.45% - 0s 0 0 858.56518 0 109 870.00000 858.56518 1.31% - 0s 0 0 858.56518 0 104 870.00000 858.56518 1.31% - 0s 0 0 859.00223 0 110 870.00000 859.00223 1.26% - 0s 0 0 859.57563 0 114 870.00000 859.57563 1.20% - 0s 0 0 859.57563 0 118 870.00000 859.57563 1.20% - 0s 0 0 859.57563 0 120 870.00000 859.57563 1.20% - 1s 0 0 859.57563 0 122 870.00000 859.57563 1.20% - 1s 0 0 859.57563 0 122 870.00000 859.57563 1.20% - 1s 0 2 859.67858 0 122 870.00000 859.67858 1.19% - 1s H 41 34 868.0000000 860.29136 0.89% 25.2 1s * 210 125 25 867.0000000 860.65613 0.73% 24.4 1s * 256 111 19 866.0000000 860.72076 0.61% 24.3 1s 1049 320 863.61889 16 120 866.00000 862.34946 0.42% 23.7 5s 3160 438 865.00000 31 65 866.00000 863.78750 0.26% 21.2 10s Cutting planes: Gomory: 13 MIR: 9 Zero half: 22 Explored 4500 nodes (89274 simplex iterations) in 12.72 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (3, 58), (3, 74), (4, 78), (4, 80), (6, 85), (6, 94), (10, 52), (10, 82), (11, 63), (11, 64), (12, 20), (12, 65), (13, 81), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (20, 63), (21, 52), (21, 67), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 79), (31, 33), (31, 71), (33, 91), (34, 80), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 93), (38, 99), (39, 45), (39, 87), (40, 68), (42, 75), (43, 44), (46, 47), (47, 48), (50, 65), (51, 77), (55, 56), (57, 76), (62, 86), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (73, 74), (73, 75), (86, 92), (92, 101), (93, 94), (99, 101)] Optimize a model with 329 rows, 5050 columns and 145796 nonzeros Presolve time: 0.11s Presolved: 329 rows, 5050 columns, 145796 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573751e+02, 326 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.37515 0 105 3624.00000 857.37515 76.3% - 0s Another try with MIP start H 0 0 890.0000000 857.37515 3.67% - 0s H 0 0 871.0000000 857.37515 1.56% - 0s 0 0 858.95044 0 116 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 103 871.00000 858.95044 1.38% - 0s 0 0 859.21012 0 112 871.00000 859.21012 1.35% - 0s 0 0 859.64457 0 119 871.00000 859.64457 1.30% - 0s 0 0 859.64457 0 123 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 121 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 122 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 121 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 125 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 122 871.00000 859.64457 1.30% - 1s H 0 0 870.0000000 859.64457 1.19% - 1s 0 2 859.71798 0 121 870.00000 859.71798 1.18% - 1s * 91 70 58 869.0000000 859.90115 1.05% 19.3 2s * 198 123 38 868.0000000 860.35666 0.88% 19.5 2s 731 419 861.81810 18 117 868.00000 861.72878 0.72% 23.6 5s * 822 403 41 867.0000000 861.72878 0.61% 24.1 5s * 1401 340 37 866.0000000 862.62791 0.39% 22.9 6s 2201 331 863.98196 35 107 866.00000 862.83388 0.37% 23.5 10s Cutting planes: Gomory: 9 MIR: 3 Zero half: 10 Explored 3818 nodes (83770 simplex iterations) in 13.57 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(5, 55), (5, 57), (9, 46), (9, 47), (12, 64), (12, 65), (13, 69), (15, 39), (15, 45), (17, 62), (17, 87), (18, 46), (18, 85), (21, 31), (21, 67), (24, 68), (24, 76), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (31, 33), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 93), (38, 99), (39, 87), (40, 68), (45, 92), (47, 48), (50, 65), (55, 81), (57, 76), (62, 86), (64, 91), (66, 72), (67, 72), (69, 81), (85, 86), (92, 101), (93, 98), (95, 96), (96, 98), (99, 101)] adding cut for [(32, 89), (2, 71), (2, 51), (4, 78), (4, 80), (8, 89), (8, 83), (10, 82), (10, 52), (11, 71), (11, 63), (34, 80), (34, 82), (77, 78), (49, 83), (51, 52), (20, 49), (20, 63)] Optimize a model with 331 rows, 5050 columns and 147192 nonzeros Presolve time: 0.11s Presolved: 331 rows, 5050 columns, 147192 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573751e+02, 337 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.37515 0 103 3624.00000 857.37515 76.3% - 0s Another try with MIP start H 0 0 874.0000000 857.37515 1.90% - 0s H 0 0 871.0000000 857.37515 1.56% - 0s 0 0 858.95044 0 113 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 103 871.00000 858.95044 1.38% - 0s 0 0 859.57187 0 114 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 118 871.00000 859.57187 1.31% - 0s 0 0 859.59188 0 116 871.00000 859.59188 1.31% - 0s 0 0 859.60513 0 124 871.00000 859.60513 1.31% - 1s 0 0 859.60513 0 128 871.00000 859.60513 1.31% - 1s 0 0 859.60513 0 119 871.00000 859.60513 1.31% - 1s 0 0 859.60513 0 120 871.00000 859.60513 1.31% - 1s 0 0 859.60513 0 123 871.00000 859.60513 1.31% - 1s 0 0 859.60513 0 125 871.00000 859.60513 1.31% - 1s 0 0 859.60513 0 125 871.00000 859.60513 1.31% - 1s 0 2 859.61381 0 125 871.00000 859.61381 1.31% - 1s * 68 68 43 870.0000000 860.20534 1.13% 25.9 1s * 219 173 39 869.0000000 860.29589 1.00% 22.1 2s H 379 215 867.0000000 860.99450 0.69% 22.0 2s 781 395 864.90000 22 93 867.00000 861.36118 0.65% 23.1 5s H 910 366 866.0000000 861.75000 0.49% 23.6 5s 2838 581 864.35026 24 99 866.00000 863.38917 0.30% 19.8 10s 5029 123 cutoff 24 866.00000 864.54348 0.17% 18.3 15s Cutting planes: Gomory: 14 MIR: 15 Zero half: 18 Explored 5181 nodes (94360 simplex iterations) in 15.14 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 40), (5, 73), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (38, 98), (38, 99), (39, 45), (39, 87), (40, 68), (43, 44), (57, 76), (62, 86), (73, 74), (75, 76), (86, 92), (88, 98), (92, 101), (99, 101)] adding cut for [(6, 61), (6, 85), (9, 46), (9, 47), (13, 69), (18, 46), (18, 85), (19, 84), (21, 33), (21, 67), (25, 26), (25, 30), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 66), (37, 47), (37, 50), (50, 65), (55, 56), (55, 81), (61, 84), (64, 65), (64, 91), (66, 72), (67, 72), (69, 81)] adding cut for [(48, 49), (2, 70), (2, 51), (34, 80), (34, 82), (4, 78), (4, 80), (8, 83), (10, 82), (10, 52), (11, 71), (11, 63), (12, 20), (12, 63), (77, 78), (49, 83), (51, 77), (20, 48), (31, 71), (31, 52)] Optimize a model with 334 rows, 5050 columns and 148272 nonzeros Presolve time: 0.11s Presolved: 334 rows, 5050 columns, 148272 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573860e+02, 349 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.38600 0 99 3624.00000 857.38600 76.3% - 0s Another try with MIP start H 0 0 879.0000000 857.38600 2.46% - 0s H 0 0 871.0000000 857.38600 1.56% - 0s 0 0 858.95044 0 113 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 99 871.00000 858.95044 1.38% - 0s 0 0 859.57187 0 112 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 121 871.00000 859.57187 1.31% - 0s 0 0 859.58632 0 122 871.00000 859.58632 1.31% - 1s 0 0 859.59944 0 118 871.00000 859.59944 1.31% - 1s 0 0 859.59944 0 120 871.00000 859.59944 1.31% - 1s 0 0 859.59944 0 124 871.00000 859.59944 1.31% - 1s 0 0 859.59944 0 122 871.00000 859.59944 1.31% - 1s 0 0 859.59944 0 123 871.00000 859.59944 1.31% - 1s 0 0 859.59944 0 120 871.00000 859.59944 1.31% - 1s H 0 0 870.0000000 859.59944 1.20% - 1s 0 2 859.63855 0 120 870.00000 859.63855 1.19% - 1s * 374 266 45 869.0000000 860.58220 0.97% 20.0 2s H 377 216 868.0000000 860.62741 0.85% 19.9 2s * 417 196 23 867.0000000 860.62741 0.74% 20.3 2s * 554 184 21 866.0000000 861.17663 0.56% 20.1 3s 844 291 862.97872 13 103 866.00000 861.74220 0.49% 22.1 5s 3245 529 cutoff 20 866.00000 863.59395 0.28% 19.5 10s Cutting planes: Gomory: 11 MIR: 1 Zero half: 4 Explored 5479 nodes (96641 simplex iterations) in 13.80 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 56), (5, 73), (6, 61), (6, 94), (9, 46), (9, 84), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (39, 45), (39, 87), (40, 68), (43, 44), (57, 76), (61, 84), (62, 85), (73, 74), (75, 76), (94, 100), (97, 100)] adding cut for [(8, 83), (8, 89), (10, 36), (10, 52), (11, 63), (11, 71), (12, 64), (12, 65), (20, 48), (20, 49), (21, 33), (21, 67), (31, 52), (31, 71), (33, 91), (36, 72), (37, 47), (37, 50), (47, 48), (49, 83), (50, 65), (63, 89), (64, 91), (66, 67), (66, 72)] adding cut for [(35, 79), (2, 70), (2, 51), (34, 80), (34, 82), (4, 78), (4, 80), (69, 81), (13, 69), (77, 78), (79, 82), (51, 77), (55, 81), (25, 55), (25, 30), (30, 35)] adding cut for [(86, 99), (86, 92), (92, 101), (38, 99), (38, 101)] Optimize a model with 338 rows, 5050 columns and 149313 nonzeros Presolve time: 0.11s Presolved: 338 rows, 5050 columns, 149313 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573860e+02, 354 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.38600 0 99 3624.00000 857.38600 76.3% - 0s Another try with MIP start H 0 0 878.0000000 857.38600 2.35% - 0s H 0 0 871.0000000 857.38600 1.56% - 0s 0 0 858.95044 0 113 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 99 871.00000 858.95044 1.38% - 0s 0 0 859.29915 0 108 871.00000 859.29915 1.34% - 0s 0 0 859.29915 0 112 871.00000 859.29915 1.34% - 0s 0 0 859.29915 0 111 871.00000 859.29915 1.34% - 0s 0 0 859.29915 0 110 871.00000 859.29915 1.34% - 1s 0 0 859.29915 0 114 871.00000 859.29915 1.34% - 1s 0 0 859.29915 0 112 871.00000 859.29915 1.34% - 1s 0 0 859.29915 0 116 871.00000 859.29915 1.34% - 1s 0 0 859.29915 0 114 871.00000 859.29915 1.34% - 1s 0 2 859.30327 0 113 871.00000 859.30327 1.34% - 1s H 27 27 870.0000000 859.48761 1.21% 28.0 1s * 65 53 41 867.0000000 859.48761 0.87% 24.8 1s H 429 215 866.0000000 860.99023 0.58% 22.8 2s 767 338 863.08333 19 107 866.00000 861.29915 0.54% 23.8 5s 2945 686 864.65385 22 94 866.00000 863.33073 0.31% 20.2 10s 5099 433 864.18088 25 102 866.00000 864.10542 0.22% 19.3 15s Cutting planes: Gomory: 13 MIR: 7 Zero half: 22 Explored 5920 nodes (110351 simplex iterations) in 16.78 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (6, 61), (6, 85), (9, 46), (9, 47), (10, 52), (10, 72), (11, 33), (11, 71), (18, 46), (18, 85), (19, 84), (21, 31), (21, 52), (31, 71), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (47, 48), (50, 65), (61, 84), (64, 65), (64, 91), (66, 67), (67, 72), (79, 82)] adding cut for [(15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 75), (38, 60), (38, 99), (39, 45), (39, 87), (42, 58), (43, 44), (60, 94), (62, 86), (74, 75), (86, 92), (92, 101), (94, 100), (97, 100), (99, 101)] adding cut for [(4, 78), (4, 80), (5, 73), (5, 55), (40, 68), (73, 76), (55, 81), (77, 78), (13, 69), (24, 68), (24, 57), (57, 76), (25, 56), (25, 30), (26, 40), (26, 56), (30, 80), (69, 81)] Optimize a model with 341 rows, 5050 columns and 150288 nonzeros Presolve time: 0.11s Presolved: 341 rows, 5050 columns, 150288 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573860e+02, 354 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.38600 0 99 3624.00000 857.38600 76.3% - 0s Another try with MIP start H 0 0 885.0000000 857.38600 3.12% - 0s H 0 0 871.0000000 857.38600 1.56% - 0s 0 0 858.95044 0 115 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 99 871.00000 858.95044 1.38% - 0s 0 0 859.05087 0 114 871.00000 859.05087 1.37% - 0s 0 0 859.57187 0 114 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 118 871.00000 859.57187 1.31% - 0s 0 0 859.57947 0 117 871.00000 859.57947 1.31% - 1s 0 0 859.57947 0 121 871.00000 859.57947 1.31% - 1s 0 0 859.57947 0 121 871.00000 859.57947 1.31% - 1s 0 0 859.57947 0 125 871.00000 859.57947 1.31% - 1s 0 0 859.57947 0 125 871.00000 859.57947 1.31% - 1s 0 2 859.61010 0 125 871.00000 859.61010 1.31% - 1s H 100 76 868.0000000 860.63345 0.85% 26.4 1s 735 493 866.30000 35 71 868.00000 861.22222 0.78% 23.9 5s * 1396 563 36 867.0000000 862.23673 0.55% 23.6 6s H 1704 430 866.0000000 862.44643 0.41% 23.2 7s 2279 562 864.14474 44 104 866.00000 862.52863 0.40% 23.5 10s 4483 634 864.74667 41 118 866.00000 863.41580 0.30% 21.7 15s Cutting planes: Gomory: 11 MIR: 2 Zero half: 4 Explored 6903 nodes (137618 simplex iterations) in 19.18 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(5, 26), (5, 40), (6, 85), (6, 94), (9, 46), (9, 47), (12, 64), (12, 65), (15, 43), (15, 44), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 79), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 93), (38, 99), (39, 45), (39, 87), (40, 68), (42, 58), (43, 88), (45, 92), (47, 48), (50, 65), (55, 56), (57, 76), (62, 86), (64, 91), (66, 72), (67, 72), (86, 94), (88, 98), (92, 101), (93, 98), (99, 101)] adding cut for [(32, 89), (34, 80), (34, 82), (4, 78), (4, 80), (69, 78), (69, 81), (8, 83), (8, 89), (10, 82), (10, 52), (11, 71), (11, 63), (13, 81), (21, 52), (21, 31), (20, 49), (20, 63), (49, 83), (31, 71)] Optimize a model with 343 rows, 5050 columns and 151824 nonzeros Presolve time: 0.11s Presolved: 343 rows, 5050 columns, 151824 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573860e+02, 381 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.38600 0 99 3624.00000 857.38600 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.38600 1.56% - 0s 0 0 858.95044 0 116 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 99 871.00000 858.95044 1.38% - 0s 0 0 859.22464 0 115 871.00000 859.22464 1.35% - 0s 0 0 859.64457 0 118 871.00000 859.64457 1.30% - 0s 0 0 859.64457 0 122 871.00000 859.64457 1.30% - 0s 0 0 859.64457 0 121 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 122 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 125 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 123 871.00000 859.64457 1.30% - 1s H 0 0 870.0000000 859.64457 1.19% - 1s 0 2 859.75724 0 123 870.00000 859.75724 1.18% - 1s H 64 56 869.0000000 859.77837 1.06% 26.7 1s * 120 68 41 867.0000000 859.82393 0.83% 24.1 2s 774 383 865.74281 30 90 867.00000 861.81609 0.60% 25.6 5s * 824 350 38 866.0000000 861.81609 0.48% 25.8 5s Cutting planes: Gomory: 9 MIR: 2 Zero half: 7 Explored 2979 nodes (64264 simplex iterations) in 9.97 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 26), (5, 40), (8, 63), (8, 89), (11, 63), (11, 64), (16, 44), (16, 58), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 80), (32, 89), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (40, 68), (43, 44), (43, 88), (55, 56), (57, 76), (64, 91), (66, 72), (67, 72), (75, 76), (79, 80), (88, 98), (95, 96), (96, 98)] adding cut for [(6, 85), (6, 86), (7, 97), (9, 46), (9, 47), (12, 20), (12, 65), (15, 39), (15, 45), (17, 62), (17, 87), (18, 46), (18, 85), (19, 83), (19, 84), (20, 49), (37, 48), (37, 50), (38, 99), (38, 101), (39, 87), (45, 92), (47, 48), (49, 83), (50, 65), (60, 93), (60, 94), (61, 84), (62, 86), (92, 101), (93, 99), (94, 100), (97, 100)] adding cut for [(2, 71), (2, 51), (10, 82), (10, 52), (34, 82), (34, 51), (21, 52), (21, 31), (31, 71)] Optimize a model with 346 rows, 5050 columns and 153124 nonzeros Presolve time: 0.11s Presolved: 346 rows, 5050 columns, 153124 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573860e+02, 381 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.38600 0 99 3624.00000 857.38600 76.3% - 0s Another try with MIP start H 0 0 877.0000000 857.38600 2.24% - 0s H 0 0 871.0000000 857.38600 1.56% - 0s 0 0 858.95044 0 116 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 99 871.00000 858.95044 1.38% - 0s 0 0 859.22464 0 115 871.00000 859.22464 1.35% - 0s 0 0 859.64457 0 118 871.00000 859.64457 1.30% - 0s 0 0 859.64457 0 122 871.00000 859.64457 1.30% - 0s 0 0 859.64457 0 121 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 122 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 125 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 123 871.00000 859.64457 1.30% - 1s H 0 0 870.0000000 859.64457 1.19% - 1s 0 2 859.75724 0 123 870.00000 859.75724 1.18% - 1s * 360 226 28 868.0000000 860.76888 0.83% 24.4 2s H 600 273 867.0000000 861.73572 0.61% 23.8 3s 694 319 865.83333 26 68 867.00000 861.73572 0.61% 25.5 5s * 1190 326 35 866.0000000 862.49681 0.40% 24.9 6s 2600 293 cutoff 27 866.00000 863.71667 0.26% 23.1 10s Cutting planes: Gomory: 12 MIR: 2 Zero half: 7 Explored 3419 nodes (75180 simplex iterations) in 11.72 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(2, 70), (2, 71), (6, 61), (6, 85), (7, 97), (9, 46), (9, 47), (10, 36), (10, 52), (11, 63), (11, 64), (12, 20), (12, 65), (17, 62), (17, 87), (18, 85), (18, 87), (20, 63), (21, 33), (21, 67), (31, 52), (31, 71), (33, 91), (36, 72), (37, 48), (37, 50), (46, 84), (47, 48), (50, 65), (60, 94), (60, 100), (61, 84), (62, 86), (64, 91), (66, 67), (66, 72), (86, 94), (97, 100)] adding cut for [(3, 42), (3, 58), (5, 56), (5, 73), (15, 39), (15, 43), (16, 44), (16, 58), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (38, 99), (38, 101), (39, 45), (40, 68), (43, 44), (45, 92), (57, 76), (73, 74), (75, 76), (92, 101), (93, 99)] adding cut for [(34, 80), (34, 82), (35, 79), (4, 78), (4, 80), (69, 81), (13, 69), (77, 78), (79, 82), (51, 77), (55, 81), (25, 55), (25, 30), (30, 35)] Optimize a model with 349 rows, 5050 columns and 154321 nonzeros Presolve time: 0.11s Presolved: 349 rows, 5050 columns, 154321 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573860e+02, 383 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.38600 0 99 3624.00000 857.38600 76.3% - 0s Another try with MIP start H 0 0 870.0000000 857.38600 1.45% - 0s 0 0 858.95044 0 116 870.00000 858.95044 1.27% - 0s 0 0 858.95044 0 99 870.00000 858.95044 1.27% - 0s 0 0 859.57187 0 114 870.00000 859.57187 1.20% - 0s 0 0 859.57187 0 118 870.00000 859.57187 1.20% - 0s 0 0 859.59188 0 116 870.00000 859.59188 1.20% - 1s 0 0 859.60513 0 124 870.00000 859.60513 1.19% - 1s 0 0 859.60513 0 128 870.00000 859.60513 1.19% - 1s 0 0 859.60513 0 119 870.00000 859.60513 1.19% - 1s 0 0 859.60513 0 120 870.00000 859.60513 1.19% - 1s 0 0 859.60513 0 123 870.00000 859.60513 1.19% - 1s 0 0 859.60513 0 125 870.00000 859.60513 1.19% - 1s 0 0 859.60513 0 124 870.00000 859.60513 1.19% - 1s 0 2 859.64303 0 123 870.00000 859.64303 1.19% - 1s * 130 106 38 869.0000000 860.23907 1.01% 22.7 2s H 387 234 867.0000000 861.01318 0.69% 21.0 2s 790 389 865.37203 43 100 867.00000 861.58090 0.63% 22.9 5s * 1462 377 53 866.0000000 862.27816 0.43% 22.4 6s 2925 678 864.83518 33 89 866.00000 863.25709 0.32% 20.4 10s 5177 491 864.63636 27 77 866.00000 864.15686 0.21% 19.3 15s Cutting planes: Gomory: 11 MIR: 1 Zero half: 5 Explored 5970 nodes (111144 simplex iterations) in 16.31 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (3, 42), (3, 58), (4, 78), (4, 80), (10, 52), (10, 82), (11, 63), (11, 71), (16, 44), (16, 58), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (31, 52), (31, 71), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 66), (40, 68), (43, 44), (43, 88), (57, 76), (60, 94), (60, 96), (63, 64), (64, 91), (66, 72), (67, 72), (69, 77), (69, 81), (75, 76), (77, 78), (79, 80), (88, 98), (94, 100), (96, 98), (97, 100)] adding cut for [(8, 83), (8, 89), (9, 46), (9, 47), (12, 20), (12, 65), (15, 39), (15, 45), (17, 45), (17, 62), (18, 46), (18, 87), (20, 49), (32, 89), (37, 48), (37, 50), (38, 93), (38, 99), (39, 87), (47, 48), (49, 83), (50, 65), (62, 86), (86, 92), (92, 101), (93, 95), (99, 101)] Optimize a model with 351 rows, 5050 columns and 155974 nonzeros Presolve time: 0.11s Presolved: 351 rows, 5050 columns, 155974 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573860e+02, 370 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.38600 0 99 3624.00000 857.38600 76.3% - 0s Another try with MIP start H 0 0 874.0000000 857.38600 1.90% - 0s H 0 0 871.0000000 857.38600 1.56% - 0s 0 0 858.95044 0 115 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 99 871.00000 858.95044 1.38% - 0s 0 0 859.28355 0 118 871.00000 859.28355 1.35% - 0s 0 0 859.57187 0 118 871.00000 859.57187 1.31% - 0s 0 0 859.59188 0 120 871.00000 859.59188 1.31% - 0s 0 0 859.60513 0 128 871.00000 859.60513 1.31% - 0s 0 0 859.60513 0 129 871.00000 859.60513 1.31% - 1s 0 0 859.60551 0 123 871.00000 859.60551 1.31% - 1s 0 0 859.60551 0 125 871.00000 859.60551 1.31% - 1s 0 0 859.60551 0 124 871.00000 859.60551 1.31% - 1s 0 0 859.60551 0 124 871.00000 859.60551 1.31% - 1s 0 0 859.60551 0 125 871.00000 859.60551 1.31% - 1s 0 0 859.60551 0 123 871.00000 859.60551 1.31% - 1s H 0 0 870.0000000 859.60551 1.19% - 1s 0 2 859.63475 0 123 870.00000 859.63475 1.19% - 1s H 27 27 869.0000000 859.98997 1.04% 36.7 1s H 302 210 868.0000000 860.93311 0.81% 23.9 2s H 326 186 867.0000000 860.93311 0.70% 23.3 2s 683 345 865.65000 21 100 867.00000 861.60714 0.62% 23.5 5s * 1873 455 35 866.0000000 862.83594 0.37% 23.2 8s 2642 481 cutoff 23 866.00000 863.36265 0.30% 22.6 10s Cutting planes: Gomory: 10 MIR: 1 Zero half: 6 Explored 4375 nodes (90227 simplex iterations) in 13.64 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(8, 83), (8, 89), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 71), (12, 64), (12, 65), (15, 39), (15, 45), (17, 62), (17, 87), (18, 46), (18, 85), (20, 49), (20, 63), (21, 33), (21, 67), (31, 52), (31, 71), (32, 89), (33, 91), (34, 79), (34, 82), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 99), (38, 101), (39, 87), (45, 92), (47, 48), (49, 83), (50, 65), (60, 93), (60, 96), (62, 86), (64, 91), (66, 67), (66, 72), (85, 86), (92, 101), (93, 99), (95, 96)] adding cut for [(2, 51), (4, 78), (4, 80), (14, 98), (16, 44), (16, 58), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 80), (40, 68), (42, 58), (43, 44), (43, 88), (51, 77), (57, 76), (75, 76), (77, 78), (88, 98)] Optimize a model with 353 rows, 5050 columns and 157450 nonzeros Presolve time: 0.12s Presolved: 353 rows, 5050 columns, 157450 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573860e+02, 334 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.38600 0 99 3624.00000 857.38600 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.38600 1.56% - 0s 0 0 858.95044 0 113 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 99 871.00000 858.95044 1.38% - 0s 0 0 859.29915 0 110 871.00000 859.29915 1.34% - 0s 0 0 859.29915 0 114 871.00000 859.29915 1.34% - 0s 0 0 859.29915 0 109 871.00000 859.29915 1.34% - 1s 0 0 859.29915 0 113 871.00000 859.29915 1.34% - 1s 0 0 859.29915 0 113 871.00000 859.29915 1.34% - 1s 0 0 859.29915 0 117 871.00000 859.29915 1.34% - 1s 0 0 859.29915 0 117 871.00000 859.29915 1.34% - 1s H 0 0 870.0000000 859.29915 1.23% - 1s 0 2 859.33468 0 117 870.00000 859.33468 1.23% - 1s * 268 216 32 869.0000000 860.26267 1.01% 22.3 2s * 322 215 24 868.0000000 860.26776 0.89% 23.5 2s 621 374 862.42056 11 140 868.00000 861.27542 0.77% 21.6 5s * 786 405 48 867.0000000 861.67430 0.61% 24.7 6s * 1094 385 25 866.0000000 862.13663 0.45% 24.6 7s 1698 428 862.72861 29 109 866.00000 862.54838 0.40% 25.2 10s Cutting planes: Gomory: 11 MIR: 1 Zero half: 12 Explored 3889 nodes (85682 simplex iterations) in 14.91 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (8, 83), (8, 89), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (15, 39), (15, 45), (17, 62), (17, 87), (18, 46), (18, 85), (20, 48), (21, 31), (21, 67), (31, 33), (32, 89), (33, 91), (34, 51), (34, 52), (35, 36), (35, 79), (36, 66), (37, 47), (37, 50), (38, 99), (38, 101), (39, 87), (45, 92), (48, 49), (49, 83), (50, 65), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (79, 82), (85, 86), (92, 101), (93, 98), (93, 99), (95, 96), (96, 98)] adding cut for [(4, 78), (4, 80), (5, 55), (5, 57), (40, 68), (55, 81), (77, 78), (13, 69), (24, 68), (24, 76), (57, 76), (25, 56), (25, 30), (26, 40), (26, 56), (30, 80), (69, 81)] Optimize a model with 355 rows, 5050 columns and 158878 nonzeros Presolve time: 0.12s Presolved: 355 rows, 5050 columns, 158878 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573860e+02, 389 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.38600 0 99 3624.00000 857.38600 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.38600 1.56% - 0s 0 0 858.95044 0 113 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 99 871.00000 858.95044 1.38% - 0s 0 0 859.28355 0 114 871.00000 859.28355 1.35% - 0s 0 0 859.57187 0 118 871.00000 859.57187 1.31% - 0s 0 0 859.57947 0 121 871.00000 859.57947 1.31% - 1s 0 0 859.57947 0 125 871.00000 859.57947 1.31% - 1s 0 0 859.58745 0 130 871.00000 859.58745 1.31% - 1s 0 0 859.58745 0 132 871.00000 859.58745 1.31% - 1s 0 0 859.58872 0 132 871.00000 859.58872 1.31% - 1s 0 0 859.59507 0 130 871.00000 859.59507 1.31% - 1s 0 0 859.60289 0 127 871.00000 859.60289 1.31% - 1s 0 0 859.60289 0 131 871.00000 859.60289 1.31% - 1s 0 0 859.60723 0 134 871.00000 859.60723 1.31% - 1s 0 0 859.60723 0 136 871.00000 859.60723 1.31% - 1s 0 0 859.61694 0 127 871.00000 859.61694 1.31% - 1s 0 0 859.61979 0 133 871.00000 859.61979 1.31% - 1s 0 0 859.61993 0 134 871.00000 859.61993 1.31% - 1s H 0 0 870.0000000 859.61993 1.19% - 1s 0 0 859.61993 0 132 870.00000 859.61993 1.19% - 2s 0 2 860.13360 0 131 870.00000 860.13360 1.13% - 2s 23 19 862.66177 18 101 870.00000 860.46769 1.10% 43.9 5s H 42 29 869.0000000 860.46769 0.98% 39.7 5s * 63 38 38 868.0000000 860.46769 0.87% 37.4 5s * 202 113 38 867.0000000 861.09739 0.68% 31.3 5s 1159 398 864.37795 42 101 867.00000 862.40120 0.53% 27.4 10s * 1187 311 50 866.0000000 862.41176 0.41% 27.2 10s Cutting planes: Gomory: 11 MIR: 1 Zero half: 9 Explored 3081 nodes (70178 simplex iterations) in 14.39 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(2, 70), (2, 71), (4, 78), (4, 80), (6, 61), (6, 94), (9, 46), (9, 47), (10, 36), (10, 52), (11, 63), (11, 64), (12, 20), (12, 65), (15, 44), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (20, 63), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 35), (31, 52), (31, 71), (33, 91), (34, 80), (34, 82), (35, 79), (36, 66), (37, 48), (37, 50), (39, 45), (39, 87), (40, 68), (42, 58), (47, 48), (50, 65), (51, 77), (57, 76), (61, 84), (62, 86), (64, 91), (66, 72), (67, 72), (73, 75), (73, 76), (77, 78), (79, 82), (84, 85), (86, 94)] Optimize a model with 356 rows, 5050 columns and 160831 nonzeros Presolve time: 0.12s Presolved: 356 rows, 5050 columns, 160831 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573860e+02, 385 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.38600 0 99 3624.00000 857.38600 76.3% - 0s Another try with MIP start H 0 0 875.0000000 857.38600 2.01% - 0s H 0 0 871.0000000 857.38600 1.56% - 0s 0 0 858.95044 0 115 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 99 871.00000 858.95044 1.38% - 0s 0 0 859.21012 0 112 871.00000 859.21012 1.35% - 0s 0 0 859.64457 0 118 871.00000 859.64457 1.30% - 0s 0 0 859.64457 0 122 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 121 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 119 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 122 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 121 871.00000 859.64457 1.30% - 1s 0 0 859.64457 0 122 871.00000 859.64457 1.30% - 1s H 0 0 870.0000000 859.64457 1.19% - 1s 0 0 859.64457 0 125 870.00000 859.64457 1.19% - 1s 0 2 860.12568 0 120 870.00000 860.12568 1.13% - 2s 94 60 864.12482 22 100 870.00000 860.46201 1.10% 38.3 5s * 146 83 48 869.0000000 860.46201 0.98% 33.5 5s * 226 121 53 868.0000000 861.38498 0.76% 32.0 5s * 719 325 35 867.0000000 862.29007 0.54% 26.3 7s * 973 364 38 866.0000000 862.45029 0.41% 26.5 9s 1217 373 cutoff 30 866.00000 862.45029 0.41% 26.0 10s 3141 170 864.57042 31 102 866.00000 864.12500 0.22% 22.6 15s Cutting planes: Gomory: 12 MIR: 2 Zero half: 7 Explored 3522 nodes (77576 simplex iterations) in 15.72 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(3, 88), (4, 30), (4, 80), (5, 26), (5, 40), (8, 49), (8, 89), (9, 47), (9, 83), (11, 63), (11, 64), (12, 20), (12, 65), (16, 44), (16, 58), (20, 63), (22, 73), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 56), (32, 89), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (40, 68), (42, 58), (43, 44), (43, 88), (47, 48), (49, 83), (50, 65), (57, 76), (64, 91), (66, 72), (67, 72), (73, 76), (74, 75), (79, 80)] adding cut for [(2, 71), (69, 78), (69, 81), (10, 82), (10, 52), (13, 55), (34, 82), (34, 51), (77, 78), (51, 77), (21, 52), (21, 31), (55, 81), (31, 71)] adding cut for [(6, 86), (6, 61), (39, 87), (45, 92), (46, 84), (15, 39), (15, 45), (17, 87), (17, 62), (18, 46), (18, 85), (19, 84), (86, 92), (62, 85)] adding cut for [(99, 101), (38, 99), (38, 101)] Optimize a model with 360 rows, 5050 columns and 162172 nonzeros Presolve time: 0.12s Presolved: 360 rows, 5050 columns, 162172 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573860e+02, 364 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.38600 0 99 3624.00000 857.38600 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.38600 1.56% - 0s 0 0 858.95044 0 115 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 99 871.00000 858.95044 1.38% - 0s 0 0 859.05087 0 116 871.00000 859.05087 1.37% - 0s 0 0 859.57187 0 114 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 117 871.00000 859.57187 1.31% - 0s 0 0 859.57187 0 120 871.00000 859.57187 1.31% - 1s 0 0 859.57615 0 122 871.00000 859.57615 1.31% - 1s 0 0 859.57615 0 122 871.00000 859.57615 1.31% - 1s 0 0 859.59711 0 122 871.00000 859.59711 1.31% - 1s 0 0 859.59711 0 123 871.00000 859.59711 1.31% - 1s 0 0 859.59711 0 124 871.00000 859.59711 1.31% - 1s 0 0 859.59711 0 126 871.00000 859.59711 1.31% - 1s 0 0 859.59711 0 123 871.00000 859.59711 1.31% - 1s 0 0 859.59711 0 127 871.00000 859.59711 1.31% - 1s 0 0 859.59711 0 125 871.00000 859.59711 1.31% - 1s H 0 0 870.0000000 859.59711 1.20% - 1s 0 2 859.60078 0 125 870.00000 859.60078 1.20% - 2s H 299 208 868.0000000 860.48233 0.87% 22.1 2s 612 415 865.56000 16 133 868.00000 860.98113 0.81% 21.7 5s * 1300 543 34 867.0000000 861.77027 0.60% 24.3 7s 2158 700 865.37209 24 93 867.00000 862.76696 0.49% 23.7 10s 3961 1305 865.11765 33 79 867.00000 863.46667 0.41% 22.4 15s * 4695 940 30 866.0000000 863.63566 0.27% 21.9 16s 6028 688 864.96339 24 104 866.00000 864.22680 0.20% 21.3 20s Cutting planes: Gomory: 14 MIR: 5 Zero half: 14 Explored 7044 nodes (141933 simplex iterations) in 22.12 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(5, 55), (5, 56), (8, 49), (8, 89), (9, 47), (9, 83), (11, 63), (11, 64), (12, 20), (12, 65), (20, 63), (22, 41), (22, 74), (23, 75), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 80), (32, 89), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (40, 68), (47, 48), (49, 83), (50, 65), (57, 76), (64, 91), (66, 72), (67, 72), (73, 74), (73, 75), (79, 80)] adding cut for [(3, 42), (3, 88), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (38, 93), (38, 99), (39, 45), (39, 87), (42, 58), (43, 44), (46, 84), (60, 94), (60, 96), (62, 85), (86, 92), (86, 94), (88, 98), (92, 101), (93, 98), (95, 96), (99, 101)] adding cut for [(2, 71), (4, 69), (4, 78), (69, 81), (10, 82), (10, 52), (13, 81), (34, 82), (34, 51), (77, 78), (51, 77), (21, 52), (21, 31), (31, 71)] Optimize a model with 363 rows, 5050 columns and 163544 nonzeros Presolve time: 0.12s Presolved: 363 rows, 5050 columns, 163544 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573860e+02, 364 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.38600 0 99 3624.00000 857.38600 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.38600 1.56% - 0s 0 0 858.95044 0 116 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 99 871.00000 858.95044 1.38% - 0s 0 0 859.28355 0 111 871.00000 859.28355 1.35% - 0s 0 0 859.28355 0 120 871.00000 859.28355 1.35% - 0s 0 0 859.68322 0 120 871.00000 859.68322 1.30% - 1s 0 0 859.68322 0 122 871.00000 859.68322 1.30% - 1s 0 0 859.68322 0 122 871.00000 859.68322 1.30% - 1s 0 0 859.68322 0 124 871.00000 859.68322 1.30% - 1s 0 0 859.68322 0 122 871.00000 859.68322 1.30% - 1s 0 0 859.68322 0 126 871.00000 859.68322 1.30% - 1s 0 0 859.68322 0 121 871.00000 859.68322 1.30% - 1s H 0 0 870.0000000 859.68322 1.19% - 1s 0 2 859.71359 0 121 870.00000 859.71359 1.18% - 1s * 220 146 30 868.0000000 860.54177 0.86% 24.3 2s 667 371 865.95614 38 75 868.00000 861.55346 0.74% 24.6 5s * 1179 458 32 867.0000000 862.25682 0.55% 24.4 6s * 1522 304 28 866.0000000 862.63643 0.39% 24.1 7s 1981 410 862.86992 23 109 866.00000 862.86992 0.36% 24.4 10s 3982 359 cutoff 39 866.00000 863.68442 0.27% 22.4 15s Cutting planes: Gomory: 9 MIR: 2 Zero half: 7 Explored 5173 nodes (111098 simplex iterations) in 17.56 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(4, 30), (4, 80), (6, 61), (6, 85), (9, 46), (9, 47), (14, 98), (15, 39), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 62), (18, 85), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 93), (38, 99), (39, 87), (40, 68), (42, 58), (43, 44), (43, 88), (45, 92), (46, 84), (47, 48), (50, 65), (57, 76), (60, 86), (60, 96), (61, 84), (64, 65), (64, 91), (66, 67), (66, 72), (73, 74), (73, 76), (74, 75), (79, 80), (86, 94), (88, 98), (92, 101), (93, 96), (94, 100), (97, 100), (99, 101)] adding cut for [(3, 22), (5, 22), (5, 55), (8, 83), (8, 89), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (13, 55), (13, 81), (20, 49), (31, 52), (31, 71), (32, 89), (34, 51), (34, 82), (49, 83), (51, 77), (69, 78), (69, 81), (77, 78)] Optimize a model with 365 rows, 5050 columns and 165735 nonzeros Presolve time: 0.12s Presolved: 365 rows, 5050 columns, 165735 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573860e+02, 364 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.38600 0 99 3624.00000 857.38600 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.38600 1.56% - 0s 0 0 858.95044 0 116 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 99 871.00000 858.95044 1.38% - 0s 0 0 859.28355 0 111 871.00000 859.28355 1.35% - 0s 0 0 859.28355 0 120 871.00000 859.28355 1.35% - 0s 0 0 859.68322 0 120 871.00000 859.68322 1.30% - 1s 0 0 859.68322 0 122 871.00000 859.68322 1.30% - 1s 0 0 859.68322 0 124 871.00000 859.68322 1.30% - 1s 0 0 859.68322 0 122 871.00000 859.68322 1.30% - 1s 0 0 859.68322 0 126 871.00000 859.68322 1.30% - 1s 0 0 859.68322 0 121 871.00000 859.68322 1.30% - 1s H 0 0 870.0000000 859.68322 1.19% - 1s 0 2 859.71359 0 121 870.00000 859.71359 1.18% - 1s * 143 100 39 868.0000000 860.53462 0.86% 24.8 2s * 377 176 17 867.0000000 861.09786 0.68% 23.1 2s H 600 203 866.0000000 861.68831 0.50% 23.1 3s 743 254 863.15714 20 112 866.00000 861.68831 0.50% 24.7 5s 2719 319 864.62533 23 104 866.00000 863.74286 0.26% 21.3 10s Cutting planes: Gomory: 10 MIR: 2 Zero half: 7 Mod-K: 1 Explored 3719 nodes (74668 simplex iterations) in 12.05 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(5, 26), (5, 40), (6, 85), (6, 94), (9, 46), (9, 47), (17, 62), (17, 87), (18, 46), (18, 85), (21, 33), (21, 67), (22, 73), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 72), (37, 47), (37, 50), (38, 93), (38, 99), (39, 45), (39, 87), (40, 68), (42, 75), (45, 92), (50, 65), (57, 76), (62, 86), (64, 65), (64, 91), (66, 67), (66, 72), (73, 74), (74, 75), (86, 94), (92, 101), (93, 95), (99, 101)] adding cut for [(4, 78), (4, 80), (8, 83), (8, 89), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (13, 55), (20, 48), (31, 52), (31, 71), (32, 89), (34, 80), (34, 82), (48, 49), (49, 83), (55, 81), (69, 78), (69, 81)] Optimize a model with 367 rows, 5050 columns and 167116 nonzeros Presolve time: 0.12s Presolved: 367 rows, 5050 columns, 167116 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.573860e+02, 343 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.38600 0 99 3624.00000 857.38600 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.38600 1.56% - 0s 0 0 858.95044 0 115 871.00000 858.95044 1.38% - 0s 0 0 858.95044 0 99 871.00000 858.95044 1.38% - 0s 0 0 859.29915 0 107 871.00000 859.29915 1.34% - 0s 0 0 859.29915 0 109 871.00000 859.29915 1.34% - 0s 0 0 859.29915 0 111 871.00000 859.29915 1.34% - 1s 0 0 859.29915 0 113 871.00000 859.29915 1.34% - 1s 0 0 859.29915 0 111 871.00000 859.29915 1.34% - 1s 0 0 859.29915 0 115 871.00000 859.29915 1.34% - 1s 0 0 859.29915 0 113 871.00000 859.29915 1.34% - 1s H 0 0 870.0000000 859.29915 1.23% - 1s 0 2 859.33468 0 111 870.00000 859.33468 1.23% - 1s * 208 158 52 868.0000000 860.01325 0.92% 21.8 2s 717 469 865.86598 37 87 868.00000 860.77682 0.83% 23.0 5s * 829 458 43 867.0000000 861.37823 0.65% 23.1 5s 2543 841 865.59402 31 99 867.00000 863.11126 0.45% 22.5 10s 4585 1364 865.23900 28 82 867.00000 863.66180 0.39% 21.3 15s 6662 1685 864.58227 24 106 867.00000 863.97764 0.35% 20.7 20s * 7284 1033 29 866.0000000 864.06710 0.22% 20.6 21s Cutting planes: Gomory: 8 MIR: 1 Zero half: 4 Explored 9012 nodes (173007 simplex iterations) in 24.39 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(6, 85), (6, 94), (8, 19), (8, 83), (9, 46), (9, 47), (11, 32), (11, 33), (12, 20), (12, 63), (15, 39), (15, 45), (17, 45), (17, 62), (18, 46), (18, 87), (20, 49), (32, 89), (33, 91), (37, 48), (37, 50), (38, 99), (38, 101), (39, 87), (47, 48), (49, 83), (50, 65), (60, 93), (60, 94), (61, 84), (62, 86), (63, 89), (64, 65), (64, 91), (84, 85), (86, 92), (92, 101), (93, 99)] adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (16, 44), (16, 58), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 35), (35, 79), (40, 68), (43, 44), (43, 88), (57, 76), (75, 76), (77, 78), (79, 80), (88, 98), (96, 98), (96, 100), (97, 100)] adding cut for [(2, 71), (2, 51), (67, 72), (66, 72), (10, 52), (10, 36), (34, 82), (34, 51), (52, 82), (21, 67), (21, 31), (36, 66), (31, 71)] Optimize a model with 370 rows, 5050 columns and 168313 nonzeros Presolve time: 0.12s Presolved: 370 rows, 5050 columns, 168313 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 349 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 110 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 873.0000000 857.62658 1.76% - 0s H 0 0 870.0000000 857.62658 1.42% - 0s 0 0 858.94943 0 111 870.00000 858.94943 1.27% - 0s 0 0 858.94943 0 108 870.00000 858.94943 1.27% - 1s 0 0 859.71132 0 113 870.00000 859.71132 1.18% - 1s 0 0 859.85831 0 120 870.00000 859.85831 1.17% - 1s 0 0 859.85831 0 125 870.00000 859.85831 1.17% - 1s 0 0 859.86215 0 120 870.00000 859.86215 1.17% - 1s 0 0 859.86215 0 124 870.00000 859.86215 1.17% - 1s 0 0 859.86216 0 125 870.00000 859.86216 1.17% - 1s 0 0 859.86216 0 129 870.00000 859.86216 1.17% - 1s 0 0 859.86216 0 128 870.00000 859.86216 1.17% - 1s 0 2 859.86490 0 128 870.00000 859.86490 1.16% - 1s H 241 179 869.0000000 860.84408 0.94% 24.3 2s * 461 278 38 868.0000000 861.17172 0.79% 21.8 2s 648 392 864.23077 31 71 868.00000 861.30122 0.77% 23.1 5s * 685 371 49 867.0000000 861.30122 0.66% 23.2 5s * 2094 462 35 866.0000000 863.20641 0.32% 22.3 8s 2306 480 864.59584 22 131 866.00000 863.40567 0.30% 21.8 10s 4293 74 cutoff 36 866.00000 864.32530 0.19% 21.6 15s Cutting planes: Gomory: 8 MIR: 2 Zero half: 4 Explored 4395 nodes (94809 simplex iterations) in 15.26 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (8, 83), (8, 89), (9, 46), (9, 47), (10, 36), (10, 52), (11, 63), (11, 71), (12, 64), (12, 65), (18, 46), (18, 85), (19, 84), (20, 49), (20, 63), (21, 31), (21, 67), (31, 33), (32, 89), (33, 91), (34, 51), (34, 82), (36, 66), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (52, 82), (64, 91), (66, 72), (67, 72), (84, 85)] adding cut for [(3, 42), (3, 58), (14, 88), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 75), (38, 99), (38, 101), (39, 45), (39, 87), (43, 44), (62, 86), (73, 74), (73, 75), (86, 92), (88, 98), (92, 101), (93, 98), (93, 99)] adding cut for [(35, 79), (4, 78), (4, 80), (5, 55), (5, 57), (40, 68), (55, 81), (77, 78), (79, 80), (24, 68), (24, 76), (57, 76), (25, 56), (25, 30), (26, 40), (26, 56), (13, 69), (30, 35), (69, 81)] Optimize a model with 373 rows, 5050 columns and 169458 nonzeros Presolve time: 0.12s Presolved: 373 rows, 5050 columns, 169458 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 319 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 108 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 870.0000000 857.62658 1.42% - 0s 0 0 858.94943 0 108 870.00000 858.94943 1.27% - 0s 0 0 858.94943 0 108 870.00000 858.94943 1.27% - 0s 0 0 859.48585 0 120 870.00000 859.48585 1.21% - 1s 0 0 859.71132 0 116 870.00000 859.71132 1.18% - 1s 0 0 859.86897 0 123 870.00000 859.86897 1.16% - 1s 0 0 859.86897 0 127 870.00000 859.86897 1.16% - 1s 0 0 859.86897 0 125 870.00000 859.86897 1.16% - 1s 0 0 859.86897 0 129 870.00000 859.86897 1.16% - 1s 0 0 859.86925 0 124 870.00000 859.86925 1.16% - 1s 0 0 859.86925 0 127 870.00000 859.86925 1.16% - 1s 0 0 859.86925 0 127 870.00000 859.86925 1.16% - 1s 0 2 859.87245 0 127 870.00000 859.87245 1.16% - 1s H 348 204 868.0000000 860.87279 0.82% 22.0 2s 617 363 861.35185 16 130 868.00000 861.35185 0.77% 21.4 5s 2385 953 863.63486 20 117 868.00000 863.27687 0.54% 22.4 10s * 2590 816 34 867.0000000 863.34783 0.42% 22.4 10s H 3081 549 866.0000000 863.50459 0.29% 22.2 12s 4193 424 864.72966 33 95 866.00000 864.11538 0.22% 21.5 15s Cutting planes: Gomory: 10 MIR: 2 Zero half: 8 Explored 5021 nodes (102880 simplex iterations) in 16.79 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(5, 26), (5, 40), (6, 85), (6, 86), (9, 46), (9, 47), (15, 39), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (22, 73), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 56), (30, 80), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 47), (37, 50), (38, 99), (38, 101), (39, 87), (40, 68), (42, 58), (43, 44), (43, 88), (45, 92), (50, 65), (57, 76), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (73, 76), (74, 75), (79, 80), (88, 98), (92, 101), (93, 98), (93, 99)] adding cut for [(32, 89), (2, 70), (2, 51), (8, 89), (8, 83), (10, 82), (10, 52), (11, 71), (11, 63), (12, 20), (12, 63), (34, 82), (34, 51), (48, 49), (49, 83), (21, 52), (21, 31), (20, 48), (31, 71)] Optimize a model with 375 rows, 5050 columns and 171026 nonzeros Presolve time: 0.12s Presolved: 375 rows, 5050 columns, 171026 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 387 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 109 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 874.0000000 857.62658 1.87% - 0s H 0 0 870.0000000 857.62658 1.42% - 0s 0 0 858.94943 0 112 870.00000 858.94943 1.27% - 0s 0 0 858.94943 0 109 870.00000 858.94943 1.27% - 0s 0 0 859.48585 0 117 870.00000 859.48585 1.21% - 1s 0 0 859.71132 0 117 870.00000 859.71132 1.18% - 1s 0 0 859.86897 0 124 870.00000 859.86897 1.16% - 1s 0 0 859.86897 0 129 870.00000 859.86897 1.16% - 1s 0 0 859.86912 0 126 870.00000 859.86912 1.16% - 1s 0 0 859.86912 0 130 870.00000 859.86912 1.16% - 1s 0 0 859.86912 0 129 870.00000 859.86912 1.16% - 1s 0 0 859.86912 0 133 870.00000 859.86912 1.16% - 1s 0 2 859.87388 0 133 870.00000 859.87388 1.16% - 1s H 156 119 869.0000000 860.52080 0.98% 23.8 2s 612 429 867.50000 27 133 869.00000 861.80819 0.83% 22.0 5s * 825 479 62 868.0000000 861.80819 0.71% 24.7 6s * 1985 607 29 867.0000000 862.93257 0.47% 23.7 9s 2077 636 864.29630 31 90 867.00000 863.08730 0.45% 23.6 10s 3149 713 cutoff 30 867.00000 863.40000 0.42% 23.9 15s 5272 800 865.27149 40 99 867.00000 864.28509 0.31% 22.2 20s * 6807 240 34 866.0000000 864.71015 0.15% 21.5 23s Cutting planes: Gomory: 6 MIR: 1 Zero half: 11 Explored 7064 nodes (148666 simplex iterations) in 23.72 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(6, 62), (6, 85), (9, 46), (9, 47), (12, 64), (12, 65), (15, 39), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 80), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 93), (38, 99), (39, 87), (40, 68), (42, 58), (43, 44), (43, 88), (45, 92), (47, 48), (50, 65), (57, 76), (64, 91), (66, 72), (67, 72), (75, 76), (79, 80), (88, 98), (92, 101), (93, 98), (99, 101)] adding cut for [(32, 89), (2, 70), (2, 51), (8, 89), (8, 83), (10, 82), (10, 52), (11, 71), (11, 63), (34, 82), (34, 51), (49, 83), (21, 52), (21, 31), (20, 49), (20, 63), (31, 71)] Optimize a model with 377 rows, 5050 columns and 172404 nonzeros Presolve time: 0.12s Presolved: 377 rows, 5050 columns, 172404 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 348 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 110 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 876.0000000 857.62658 2.10% - 0s H 0 0 870.0000000 857.62658 1.42% - 0s 0 0 858.94943 0 114 870.00000 858.94943 1.27% - 0s 0 0 858.94943 0 109 870.00000 858.94943 1.27% - 0s 0 0 859.29153 0 120 870.00000 859.29153 1.23% - 1s 0 0 859.58555 0 134 870.00000 859.58555 1.20% - 1s 0 0 859.58665 0 137 870.00000 859.58665 1.20% - 1s 0 0 859.61320 0 134 870.00000 859.61320 1.19% - 1s 0 0 859.65431 0 135 870.00000 859.65431 1.19% - 1s 0 0 859.95248 0 124 870.00000 859.95248 1.15% - 1s 0 0 859.95248 0 126 870.00000 859.95248 1.15% - 1s 0 0 859.95248 0 128 870.00000 859.95248 1.15% - 1s 0 0 859.95248 0 130 870.00000 859.95248 1.15% - 1s 0 2 859.99232 0 128 870.00000 859.99232 1.15% - 1s * 65 59 39 868.0000000 860.33337 0.88% 27.6 2s H 296 190 867.0000000 861.27766 0.66% 23.6 2s 615 339 865.94884 25 138 867.00000 861.93333 0.58% 21.6 5s * 1906 363 27 866.0000000 863.19671 0.32% 23.9 9s 2061 368 864.16907 23 100 866.00000 863.26127 0.32% 23.6 10s Cutting planes: Gomory: 10 MIR: 2 Zero half: 9 Explored 3332 nodes (74810 simplex iterations) in 12.89 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.660000000000e+02, best bound 8.660000000000e+02, gap 0.0% adding cut for [(3, 58), (3, 74), (4, 30), (4, 80), (5, 26), (5, 40), (9, 47), (9, 84), (15, 44), (15, 45), (16, 42), (16, 44), (17, 87), (17, 92), (18, 46), (18, 85), (21, 33), (21, 67), (22, 73), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (43, 58), (43, 88), (46, 84), (47, 48), (50, 65), (55, 56), (57, 76), (60, 94), (60, 96), (62, 85), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (73, 75), (74, 75), (79, 80), (86, 94), (88, 98), (92, 101), (93, 95), (93, 99), (96, 98)] adding cut for [(32, 89), (51, 77), (34, 51), (34, 82), (69, 81), (69, 78), (8, 83), (8, 89), (10, 82), (10, 52), (11, 71), (11, 63), (12, 20), (12, 63), (77, 78), (13, 81), (49, 83), (20, 49), (31, 71), (31, 52)] Optimize a model with 379 rows, 5050 columns and 174505 nonzeros Presolve time: 0.12s Presolved: 379 rows, 5050 columns, 174505 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 401 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 110 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 873.0000000 857.62658 1.76% - 0s H 0 0 870.0000000 857.62658 1.42% - 0s 0 0 858.94943 0 114 870.00000 858.94943 1.27% - 0s 0 0 858.94943 0 110 870.00000 858.94943 1.27% - 0s 0 0 859.49472 0 120 870.00000 859.49472 1.21% - 1s 0 0 859.71132 0 114 870.00000 859.71132 1.18% - 1s 0 0 859.86897 0 121 870.00000 859.86897 1.16% - 1s 0 0 859.86897 0 123 870.00000 859.86897 1.16% - 1s 0 0 859.86897 0 125 870.00000 859.86897 1.16% - 1s 0 0 859.86897 0 129 870.00000 859.86897 1.16% - 1s 0 0 859.86912 0 124 870.00000 859.86912 1.16% - 1s 0 0 859.86912 0 127 870.00000 859.86912 1.16% - 1s 0 0 859.86912 0 127 870.00000 859.86912 1.16% - 1s 0 2 859.87388 0 126 870.00000 859.87388 1.16% - 1s * 125 104 33 869.0000000 860.41546 0.99% 23.8 2s H 231 158 868.0000000 860.60404 0.85% 23.0 2s * 275 162 29 867.0000000 860.97214 0.70% 22.5 2s 618 311 861.69532 14 127 867.00000 861.69532 0.61% 22.6 5s 2570 831 864.61975 19 100 867.00000 863.36559 0.42% 21.8 10s 4696 1225 864.55892 22 98 867.00000 863.99450 0.35% 20.8 15s 6944 1333 cutoff 27 867.00000 864.40955 0.30% 20.2 20s 9437 1230 865.87040 22 106 867.00000 864.79389 0.25% 19.4 25s 12641 209 865.76190 32 60 867.00000 865.58333 0.16% 18.4 30s Cutting planes: Gomory: 6 MIR: 4 Zero half: 7 Explored 12913 nodes (234953 simplex iterations) in 30.32 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(5, 26), (5, 40), (6, 85), (6, 94), (9, 46), (9, 47), (12, 64), (12, 65), (18, 46), (18, 85), (21, 31), (21, 67), (22, 73), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 56), (30, 79), (31, 33), (33, 91), (35, 36), (35, 79), (36, 66), (37, 47), (37, 50), (40, 68), (42, 76), (50, 65), (57, 76), (60, 96), (60, 97), (64, 91), (66, 72), (67, 72), (73, 74), (74, 75), (94, 100), (95, 96), (97, 100)] adding cut for [(3, 58), (38, 99), (38, 93), (39, 45), (39, 87), (43, 44), (14, 88), (15, 43), (15, 45), (16, 44), (16, 58), (17, 87), (17, 62), (99, 101), (86, 92), (88, 98), (92, 101), (93, 98), (62, 86)] adding cut for [(34, 80), (34, 82), (4, 78), (4, 80), (69, 78), (69, 81), (10, 82), (10, 52), (13, 55), (51, 77), (51, 52), (55, 81)] Optimize a model with 382 rows, 5050 columns and 175676 nonzeros Presolve time: 0.13s Presolved: 382 rows, 5050 columns, 175676 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 350 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 109 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 872.0000000 857.62658 1.65% - 0s H 0 0 870.0000000 857.62658 1.42% - 0s 0 0 858.94943 0 110 870.00000 858.94943 1.27% - 0s 0 0 858.94943 0 109 870.00000 858.94943 1.27% - 0s 0 0 859.27861 0 120 870.00000 859.27861 1.23% - 1s 0 0 859.71132 0 114 870.00000 859.71132 1.18% - 1s 0 0 859.86897 0 121 870.00000 859.86897 1.16% - 1s 0 0 859.86897 0 124 870.00000 859.86897 1.16% - 1s 0 0 859.86897 0 125 870.00000 859.86897 1.16% - 1s 0 0 859.86897 0 128 870.00000 859.86897 1.16% - 1s 0 0 859.86901 0 126 870.00000 859.86901 1.16% - 1s 0 0 859.86901 0 129 870.00000 859.86901 1.16% - 1s 0 0 859.86901 0 129 870.00000 859.86901 1.16% - 1s 0 2 859.87333 0 129 870.00000 859.87333 1.16% - 1s H 124 93 868.0000000 860.41546 0.87% 24.3 2s 622 409 861.35616 15 122 868.00000 861.35616 0.77% 21.2 5s * 1915 644 46 867.0000000 862.79436 0.49% 22.6 8s 2394 808 863.56953 18 109 867.00000 863.08726 0.45% 22.0 10s 4342 1379 865.79365 30 89 867.00000 863.70580 0.38% 21.0 15s 6362 1761 864.38562 29 98 867.00000 864.06269 0.34% 20.4 20s 8531 1915 865.99834 31 105 867.00000 864.38750 0.30% 19.8 25s 11155 1864 865.47184 25 100 867.00000 864.71650 0.26% 19.4 30s 13933 1459 cutoff 35 867.00000 865.06618 0.22% 18.8 35s 16771 359 cutoff 28 867.00000 865.59172 0.16% 18.0 40s Cutting planes: Gomory: 6 MIR: 5 Zero half: 4 Mod-K: 1 Explored 17223 nodes (306741 simplex iterations) in 40.48 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(2, 51), (4, 78), (4, 80), (10, 52), (10, 72), (14, 88), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (34, 80), (34, 82), (35, 36), (35, 79), (36, 66), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (51, 77), (52, 82), (57, 76), (62, 86), (66, 67), (67, 72), (75, 76), (77, 78), (86, 92), (88, 98), (92, 101), (93, 98), (93, 99)] adding cut for [(8, 83), (8, 89), (9, 46), (9, 47), (11, 63), (11, 71), (12, 20), (12, 63), (18, 46), (18, 85), (19, 61), (20, 48), (21, 31), (21, 33), (31, 71), (32, 89), (33, 91), (37, 47), (37, 50), (48, 49), (49, 83), (50, 65), (61, 84), (64, 65), (64, 91), (84, 85)] Optimize a model with 384 rows, 5050 columns and 177108 nonzeros Presolve time: 0.13s Presolved: 384 rows, 5050 columns, 177108 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 355 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 110 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 876.0000000 857.62658 2.10% - 0s H 0 0 870.0000000 857.62658 1.42% - 0s 0 0 858.94943 0 114 870.00000 858.94943 1.27% - 0s 0 0 858.94943 0 109 870.00000 858.94943 1.27% - 1s 0 0 859.49472 0 118 870.00000 859.49472 1.21% - 1s 0 0 859.71132 0 114 870.00000 859.71132 1.18% - 1s 0 0 859.86897 0 121 870.00000 859.86897 1.16% - 1s 0 0 859.86897 0 123 870.00000 859.86897 1.16% - 1s 0 0 859.86897 0 127 870.00000 859.86897 1.16% - 1s 0 0 859.86901 0 126 870.00000 859.86901 1.16% - 1s 0 0 859.86901 0 129 870.00000 859.86901 1.16% - 1s 0 0 859.86901 0 130 870.00000 859.86901 1.16% - 1s 0 0 859.86901 0 130 870.00000 859.86901 1.16% - 1s 0 2 859.87333 0 130 870.00000 859.87333 1.16% - 2s * 152 114 36 869.0000000 860.45808 0.98% 20.9 2s 609 448 864.87500 16 124 869.00000 861.36401 0.88% 20.4 5s 2161 1039 863.58593 21 114 869.00000 862.51725 0.75% 21.6 10s * 2180 892 40 868.0000000 862.51725 0.63% 21.6 10s H 2716 881 867.0000000 862.80282 0.48% 21.3 11s 3590 1081 865.51538 50 70 867.00000 862.90120 0.47% 21.6 15s 5600 899 865.07977 42 106 867.00000 863.74983 0.37% 21.3 20s 7718 1077 865.96286 41 101 867.00000 864.31761 0.31% 20.9 25s 10142 819 865.25372 39 85 867.00000 864.83893 0.25% 20.4 30s Cutting planes: Gomory: 4 MIR: 4 Zero half: 5 Explored 12102 nodes (237586 simplex iterations) in 33.28 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (6, 61), (6, 100), (9, 46), (9, 47), (10, 52), (10, 72), (11, 33), (11, 71), (12, 64), (12, 65), (18, 46), (18, 85), (21, 31), (21, 52), (31, 71), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (47, 48), (50, 65), (60, 94), (60, 96), (61, 84), (64, 91), (66, 67), (67, 72), (79, 82), (84, 85), (94, 100), (95, 96), (95, 97)] adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 80), (38, 93), (38, 99), (39, 45), (39, 87), (40, 68), (43, 44), (57, 76), (62, 86), (75, 76), (77, 78), (86, 92), (88, 98), (92, 101), (93, 98), (99, 101)] Optimize a model with 386 rows, 5050 columns and 178444 nonzeros Presolve time: 0.13s Presolved: 386 rows, 5050 columns, 178444 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 328 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 110 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 872.0000000 857.62658 1.65% - 0s 0 0 858.94943 0 107 872.00000 858.94943 1.50% - 0s 0 0 858.94943 0 111 872.00000 858.94943 1.50% - 1s 0 0 859.49472 0 119 872.00000 859.49472 1.43% - 1s 0 0 859.71132 0 115 872.00000 859.71132 1.41% - 1s 0 0 859.86897 0 122 872.00000 859.86897 1.39% - 1s 0 0 859.86897 0 124 872.00000 859.86897 1.39% - 1s 0 0 859.86897 0 125 872.00000 859.86897 1.39% - 1s 0 0 859.86897 0 124 872.00000 859.86897 1.39% - 1s 0 0 859.86897 0 128 872.00000 859.86897 1.39% - 1s 0 0 859.86901 0 126 872.00000 859.86901 1.39% - 1s 0 0 859.86901 0 129 872.00000 859.86901 1.39% - 1s 0 0 859.86901 0 129 872.00000 859.86901 1.39% - 1s 0 2 859.87333 0 129 872.00000 859.87333 1.39% - 2s H 454 342 871.0000000 861.25102 1.12% 20.4 3s * 487 222 27 867.0000000 861.25102 0.66% 20.4 3s 607 250 863.36861 12 127 867.00000 861.34828 0.65% 20.1 5s 2012 677 863.89324 16 110 867.00000 863.01220 0.46% 22.5 10s 3866 1241 865.16031 25 97 867.00000 863.65618 0.39% 21.6 15s 5632 1452 864.26392 25 107 867.00000 864.02232 0.34% 21.6 20s 7752 1463 865.77876 26 83 867.00000 864.38854 0.30% 21.3 25s 9789 1249 866.00000 28 58 867.00000 864.73828 0.26% 21.1 30s 12906 134 865.70998 27 98 867.00000 865.65079 0.16% 20.2 35s Cutting planes: Gomory: 8 MIR: 2 Zero half: 9 Explored 13073 nodes (262535 simplex iterations) in 35.42 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(5, 57), (6, 85), (6, 86), (7, 97), (9, 46), (9, 47), (12, 64), (12, 65), (15, 39), (15, 45), (17, 62), (17, 87), (18, 46), (18, 85), (21, 33), (21, 67), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 99), (38, 101), (39, 87), (40, 68), (45, 92), (47, 48), (50, 65), (55, 56), (60, 94), (60, 99), (62, 86), (64, 91), (66, 72), (67, 72), (92, 101), (94, 100), (97, 100)] adding cut for [(32, 89), (34, 80), (34, 82), (4, 78), (4, 80), (69, 78), (69, 81), (8, 83), (8, 89), (10, 82), (10, 52), (11, 71), (11, 63), (13, 81), (20, 49), (20, 63), (49, 83), (31, 71), (31, 52)] adding cut for [(96, 98), (3, 42), (3, 58), (22, 74), (43, 44), (43, 88), (93, 96), (93, 95), (16, 44), (16, 58), (75, 76), (73, 75), (73, 74), (23, 42), (23, 76), (88, 98)] Optimize a model with 389 rows, 5050 columns and 179851 nonzeros Presolve time: 0.13s Presolved: 389 rows, 5050 columns, 179851 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 360 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 108 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 873.0000000 857.62658 1.76% - 0s 0 0 858.94943 0 110 873.00000 858.94943 1.61% - 0s 0 0 858.94943 0 111 873.00000 858.94943 1.61% - 0s 0 0 859.71132 0 113 873.00000 859.71132 1.52% - 1s 0 0 859.86897 0 120 873.00000 859.86897 1.50% - 1s 0 0 859.86897 0 123 873.00000 859.86897 1.50% - 1s 0 0 859.86897 0 122 873.00000 859.86897 1.50% - 1s 0 0 859.86897 0 125 873.00000 859.86897 1.50% - 1s 0 0 859.86897 0 126 873.00000 859.86897 1.50% - 1s 0 0 859.86897 0 126 873.00000 859.86897 1.50% - 1s 0 2 859.87173 0 126 873.00000 859.87173 1.50% - 1s * 207 171 54 871.0000000 860.31281 1.23% 21.7 2s H 280 201 870.0000000 860.36773 1.11% 21.2 2s 613 434 861.94403 10 137 870.00000 861.07479 1.03% 20.6 5s * 1004 425 34 867.0000000 861.84507 0.59% 24.7 7s 1321 509 864.05796 34 101 867.00000 862.04646 0.57% 25.3 10s 3410 815 865.80000 37 57 867.00000 863.65681 0.39% 22.1 15s 5692 1081 865.27454 41 93 867.00000 864.29879 0.31% 20.9 20s 7920 924 865.30824 32 112 867.00000 864.80557 0.25% 20.1 25s Cutting planes: Gomory: 10 MIR: 4 Zero half: 6 Explored 10376 nodes (196744 simplex iterations) in 29.73 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (5, 55), (5, 73), (14, 88), (15, 39), (15, 43), (16, 44), (16, 58), (17, 87), (17, 92), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 35), (35, 79), (38, 99), (38, 101), (39, 45), (40, 68), (43, 44), (45, 87), (55, 81), (57, 76), (69, 78), (69, 81), (73, 74), (75, 76), (79, 80), (88, 98), (92, 101), (93, 98), (93, 99)] adding cut for [(9, 46), (9, 47), (10, 36), (10, 52), (12, 64), (12, 65), (18, 46), (18, 85), (21, 31), (21, 67), (31, 33), (33, 91), (34, 51), (34, 82), (36, 66), (37, 47), (37, 50), (50, 65), (51, 77), (52, 82), (60, 94), (60, 96), (62, 85), (62, 86), (64, 91), (66, 72), (67, 72), (86, 94), (95, 96)] Optimize a model with 391 rows, 5050 columns and 181147 nonzeros Presolve time: 0.13s Presolved: 391 rows, 5050 columns, 181147 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 356 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 109 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 876.0000000 857.62658 2.10% - 0s H 0 0 873.0000000 857.62658 1.76% - 0s 0 0 858.94943 0 111 873.00000 858.94943 1.61% - 0s 0 0 858.94943 0 109 873.00000 858.94943 1.61% - 1s 0 0 859.71132 0 116 873.00000 859.71132 1.52% - 1s 0 0 859.86897 0 123 873.00000 859.86897 1.50% - 1s 0 0 859.86897 0 128 873.00000 859.86897 1.50% - 1s 0 0 859.86901 0 126 873.00000 859.86901 1.50% - 1s 0 0 859.86901 0 130 873.00000 859.86901 1.50% - 1s 0 0 859.86901 0 129 873.00000 859.86901 1.50% - 1s 0 0 859.86901 0 133 873.00000 859.86901 1.50% - 1s 0 0 859.86901 0 133 873.00000 859.86901 1.50% - 2s 0 2 859.87333 0 133 873.00000 859.87333 1.50% - 2s * 111 96 71 871.0000000 860.40862 1.22% 20.9 2s * 329 243 57 870.0000000 860.74750 1.06% 21.1 3s H 358 243 869.0000000 861.10417 0.91% 21.5 3s * 572 340 22 868.0000000 861.35166 0.77% 21.7 3s 705 405 865.60534 15 121 868.00000 861.63527 0.73% 21.1 5s * 1072 478 30 867.0000000 862.35496 0.54% 23.4 7s 1970 541 865.92105 34 100 867.00000 863.25782 0.43% 22.6 10s 3891 981 865.86568 23 109 867.00000 863.88409 0.36% 21.7 15s 5933 1228 865.59443 29 94 867.00000 864.31989 0.31% 20.9 20s 8074 1260 865.56000 32 101 867.00000 864.65585 0.27% 20.2 25s 10534 1014 865.92102 31 100 867.00000 865.00000 0.23% 19.6 30s Cutting planes: Gomory: 9 MIR: 2 Zero half: 10 Mod-K: 1 Explored 12863 nodes (241997 simplex iterations) in 33.49 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (5, 55), (5, 56), (9, 47), (9, 84), (10, 36), (10, 52), (12, 64), (12, 65), (13, 81), (15, 39), (15, 43), (16, 42), (16, 44), (17, 87), (17, 92), (18, 46), (18, 85), (21, 31), (21, 67), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 35), (31, 33), (33, 91), (34, 51), (34, 82), (35, 79), (36, 66), (37, 48), (37, 50), (38, 99), (38, 101), (39, 45), (40, 68), (43, 44), (45, 87), (46, 84), (47, 48), (50, 65), (51, 77), (52, 82), (57, 76), (62, 85), (62, 86), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (79, 80), (86, 99), (92, 101)] Optimize a model with 392 rows, 5050 columns and 182977 nonzeros Presolve time: 0.13s Presolved: 392 rows, 5050 columns, 182977 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 388 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 110 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.62658 1.54% - 0s 0 0 858.94943 0 111 871.00000 858.94943 1.38% - 0s 0 0 858.94943 0 110 871.00000 858.94943 1.38% - 1s 0 0 859.28558 0 122 871.00000 859.28558 1.34% - 1s 0 0 859.42302 0 126 871.00000 859.42302 1.33% - 1s 0 0 859.42302 0 130 871.00000 859.42302 1.33% - 1s 0 0 859.42805 0 126 871.00000 859.42805 1.33% - 1s 0 0 859.43069 0 135 871.00000 859.43069 1.33% - 1s 0 0 859.43709 0 134 871.00000 859.43709 1.33% - 1s 0 0 859.43921 0 136 871.00000 859.43921 1.33% - 1s 0 0 859.44842 0 130 871.00000 859.44842 1.33% - 1s 0 0 859.44842 0 134 871.00000 859.44842 1.33% - 1s 0 0 859.44986 0 133 871.00000 859.44986 1.33% - 1s 0 0 859.45089 0 134 871.00000 859.45089 1.33% - 2s 0 0 859.45098 0 140 871.00000 859.45098 1.33% - 2s 0 0 859.45098 0 140 871.00000 859.45098 1.33% - 2s 0 2 859.45466 0 140 871.00000 859.45466 1.33% - 2s * 242 185 57 869.0000000 860.51691 0.98% 21.4 3s * 478 277 28 868.0000000 860.86409 0.82% 21.3 3s H 600 257 867.0000000 861.09897 0.68% 21.0 4s 606 261 863.17648 17 131 867.00000 861.09897 0.68% 20.8 5s 2201 630 863.77501 21 108 867.00000 863.35883 0.42% 22.4 10s 4123 985 865.44444 25 94 867.00000 864.00560 0.35% 21.5 15s 6231 1140 864.75000 22 80 867.00000 864.44715 0.29% 20.8 20s 8473 998 865.72789 29 106 867.00000 864.82456 0.25% 20.0 25s 10786 394 cutoff 29 867.00000 865.34500 0.19% 19.3 30s Cutting planes: Gomory: 9 MIR: 2 Zero half: 6 Explored 11379 nodes (216758 simplex iterations) in 30.90 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (8, 53), (8, 83), (9, 46), (9, 47), (11, 63), (11, 64), (12, 20), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (20, 49), (21, 33), (21, 67), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (32, 89), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (47, 48), (49, 83), (50, 65), (57, 76), (62, 85), (63, 89), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (79, 80)] Optimize a model with 393 rows, 5050 columns and 184462 nonzeros Presolve time: 0.13s Presolved: 393 rows, 5050 columns, 184462 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 356 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 110 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 873.0000000 857.62658 1.76% - 0s 0 0 858.94943 0 111 873.00000 858.94943 1.61% - 0s 0 0 858.94943 0 109 873.00000 858.94943 1.61% - 0s 0 0 859.71132 0 113 873.00000 859.71132 1.52% - 1s 0 0 859.85831 0 119 873.00000 859.85831 1.51% - 1s 0 0 859.85831 0 124 873.00000 859.85831 1.51% - 1s 0 0 859.86008 0 122 873.00000 859.86008 1.51% - 1s 0 0 859.86011 0 127 873.00000 859.86011 1.51% - 1s 0 0 859.86460 0 120 873.00000 859.86460 1.50% - 1s 0 0 859.86467 0 123 873.00000 859.86467 1.50% - 1s 0 0 859.86467 0 124 873.00000 859.86467 1.50% - 1s 0 0 859.86467 0 127 873.00000 859.86467 1.50% - 1s 0 0 859.86467 0 127 873.00000 859.86467 1.50% - 1s 0 2 859.87046 0 127 873.00000 859.87046 1.50% - 2s H 27 27 871.0000000 860.25604 1.23% 23.0 2s H 244 188 869.0000000 860.37047 0.99% 21.2 3s * 310 201 31 868.0000000 860.54050 0.86% 22.5 3s 607 383 863.60000 14 129 868.00000 861.30712 0.77% 21.5 5s * 869 441 30 867.0000000 861.81054 0.60% 23.8 6s 2057 656 cutoff 29 867.00000 863.29155 0.43% 21.8 10s 3962 1230 864.54936 23 98 867.00000 863.87398 0.36% 20.1 15s 6137 1663 864.22222 32 95 867.00000 864.19231 0.32% 19.3 20s 8252 1898 865.35943 21 103 867.00000 864.44015 0.30% 18.7 25s 10546 2042 cutoff 23 867.00000 864.65000 0.27% 18.1 30s 13481 1955 865.98000 21 105 867.00000 864.88246 0.24% 17.5 35s 16676 1421 865.72727 24 87 867.00000 865.17045 0.21% 17.0 40s Cutting planes: Gomory: 8 MIR: 3 Zero half: 7 Explored 19399 nodes (318219 simplex iterations) in 43.76 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (10, 52), (10, 72), (16, 44), (16, 58), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 80), (34, 51), (34, 82), (35, 36), (35, 79), (36, 66), (38, 96), (38, 99), (40, 68), (42, 58), (43, 44), (43, 88), (52, 82), (57, 76), (60, 93), (60, 99), (66, 67), (67, 72), (75, 76), (79, 80), (88, 98), (93, 98), (95, 96)] adding cut for [(6, 62), (6, 85), (8, 83), (8, 89), (9, 46), (9, 47), (11, 63), (11, 71), (12, 20), (12, 63), (15, 39), (15, 45), (17, 62), (17, 87), (18, 46), (18, 85), (20, 49), (21, 31), (21, 33), (31, 71), (32, 89), (33, 91), (37, 48), (37, 50), (39, 87), (45, 92), (47, 48), (49, 83), (50, 65), (64, 65), (64, 91), (86, 94), (86, 101), (92, 101), (94, 100), (97, 100)] Optimize a model with 395 rows, 5050 columns and 185831 nonzeros Presolve time: 0.13s Presolved: 395 rows, 5050 columns, 185831 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 364 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 108 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 873.0000000 857.62658 1.76% - 0s 0 0 858.94943 0 111 873.00000 858.94943 1.61% - 0s 0 0 858.94943 0 110 873.00000 858.94943 1.61% - 0s 0 0 859.30560 0 119 873.00000 859.30560 1.57% - 1s 0 0 859.37459 0 124 873.00000 859.37459 1.56% - 1s 0 0 859.43604 0 121 873.00000 859.43604 1.55% - 1s 0 0 859.44216 0 130 873.00000 859.44216 1.55% - 1s 0 0 859.64514 0 128 873.00000 859.64514 1.53% - 1s 0 0 859.95816 0 120 873.00000 859.95816 1.49% - 1s 0 0 859.95816 0 124 873.00000 859.95816 1.49% - 1s 0 0 859.96743 0 122 873.00000 859.96743 1.49% - 1s 0 0 859.96743 0 126 873.00000 859.96743 1.49% - 1s 0 0 859.96743 0 127 873.00000 859.96743 1.49% - 1s 0 0 859.96743 0 121 873.00000 859.96743 1.49% - 1s 0 0 859.96743 0 128 873.00000 859.96743 1.49% - 2s 0 0 859.96743 0 128 873.00000 859.96743 1.49% - 2s 0 2 859.97111 0 126 873.00000 859.97111 1.49% - 2s * 88 81 59 870.0000000 860.25316 1.12% 22.5 2s * 295 199 42 869.0000000 860.88690 0.93% 22.0 3s H 505 274 868.0000000 861.34132 0.77% 21.8 3s 606 339 864.95225 19 129 868.00000 861.36277 0.76% 22.0 5s * 1176 427 38 867.0000000 862.47399 0.52% 25.0 7s 1911 542 864.10809 18 117 867.00000 863.37914 0.42% 24.0 10s 3688 971 865.66667 23 81 867.00000 863.97414 0.35% 22.4 15s 5544 1008 864.96454 20 111 867.00000 864.42222 0.30% 21.9 20s 7213 841 865.83979 24 101 867.00000 864.79000 0.25% 21.6 25s 9337 253 cutoff 21 867.00000 865.42032 0.18% 20.8 30s Cutting planes: Gomory: 11 MIR: 7 Zero half: 23 Explored 9728 nodes (199182 simplex iterations) in 31.20 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(5, 26), (5, 40), (6, 61), (6, 62), (9, 46), (9, 47), (12, 64), (12, 65), (18, 46), (18, 85), (22, 74), (23, 75), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 80), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 47), (37, 50), (40, 68), (50, 65), (55, 56), (57, 76), (61, 84), (62, 86), (64, 91), (66, 72), (67, 72), (73, 74), (73, 75), (79, 80), (84, 85), (86, 94), (94, 100), (97, 100)] adding cut for [(96, 98), (3, 42), (3, 88), (38, 101), (38, 99), (39, 45), (92, 101), (42, 58), (43, 44), (45, 87), (15, 39), (15, 43), (16, 44), (16, 58), (17, 92), (17, 87), (88, 98), (60, 93), (60, 95), (93, 99), (95, 96)] adding cut for [(19, 83), (34, 82), (34, 51), (4, 69), (4, 78), (69, 81), (8, 83), (8, 89), (10, 82), (10, 52), (11, 71), (11, 63), (77, 78), (13, 81), (51, 77), (21, 52), (21, 31), (63, 89), (31, 71)] adding cut for [(48, 49), (20, 48), (20, 49)] Optimize a model with 399 rows, 5050 columns and 187137 nonzeros Presolve time: 0.13s Presolved: 399 rows, 5050 columns, 187137 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 365 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 109 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 871.0000000 857.62658 1.54% - 0s 0 0 858.94943 0 111 871.00000 858.94943 1.38% - 0s 0 0 858.94943 0 110 871.00000 858.94943 1.38% - 1s 0 0 859.71132 0 116 871.00000 859.71132 1.30% - 1s 0 0 859.86897 0 123 871.00000 859.86897 1.28% - 1s 0 0 859.86897 0 127 871.00000 859.86897 1.28% - 1s 0 0 859.86897 0 127 871.00000 859.86897 1.28% - 1s 0 0 859.86897 0 131 871.00000 859.86897 1.28% - 1s 0 0 859.87099 0 131 871.00000 859.87099 1.28% - 1s 0 0 859.87099 0 131 871.00000 859.87099 1.28% - 1s 0 2 859.87149 0 131 871.00000 859.87149 1.28% - 1s * 276 223 30 870.0000000 860.56881 1.08% 21.7 2s H 429 282 869.0000000 860.87468 0.94% 22.1 3s 612 387 861.02290 12 142 869.00000 861.01413 0.92% 21.8 5s * 698 390 57 867.0000000 861.01413 0.69% 23.4 6s 1620 529 864.69599 35 104 867.00000 862.98043 0.46% 24.7 10s 3664 717 865.28571 48 68 867.00000 864.16110 0.33% 22.1 15s 5926 580 865.49766 42 114 867.00000 864.93662 0.24% 20.7 20s Cutting planes: Gomory: 7 MIR: 2 Zero half: 7 Explored 7389 nodes (146122 simplex iterations) in 23.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (4, 30), (4, 80), (5, 26), (5, 40), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (20, 48), (21, 33), (21, 67), (22, 73), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 56), (31, 52), (31, 71), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (40, 68), (42, 76), (50, 65), (57, 76), (64, 65), (64, 91), (66, 67), (66, 72), (73, 74), (74, 75), (79, 80)] adding cut for [(6, 85), (6, 86), (8, 83), (8, 89), (9, 46), (9, 47), (15, 39), (15, 45), (17, 62), (17, 87), (18, 46), (18, 85), (32, 89), (38, 93), (38, 99), (39, 87), (45, 92), (47, 49), (49, 83), (62, 86), (92, 101), (93, 95), (99, 101)] Optimize a model with 401 rows, 5050 columns and 188403 nonzeros Presolve time: 0.14s Presolved: 401 rows, 5050 columns, 188403 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.576266e+02, 368 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.62658 0 110 3624.00000 857.62658 76.3% - 0s Another try with MIP start H 0 0 876.0000000 857.62658 2.10% - 0s H 0 0 873.0000000 857.62658 1.76% - 0s 0 0 858.94943 0 111 873.00000 858.94943 1.61% - 0s 0 0 858.94943 0 110 873.00000 858.94943 1.61% - 1s 0 0 859.22266 0 124 873.00000 859.22266 1.58% - 1s 0 0 859.80375 0 118 873.00000 859.80375 1.51% - 1s 0 0 859.92446 0 121 873.00000 859.92446 1.50% - 1s 0 0 859.92446 0 124 873.00000 859.92446 1.50% - 1s 0 0 859.92626 0 123 873.00000 859.92626 1.50% - 1s 0 0 859.92626 0 127 873.00000 859.92626 1.50% - 1s 0 0 859.93164 0 122 873.00000 859.93164 1.50% - 1s 0 0 859.93164 0 126 873.00000 859.93164 1.50% - 1s 0 0 859.93644 0 127 873.00000 859.93644 1.50% - 1s 0 0 859.93644 0 132 873.00000 859.93644 1.50% - 1s 0 0 859.93972 0 128 873.00000 859.93972 1.50% - 2s 0 0 859.93972 0 131 873.00000 859.93972 1.50% - 2s 0 0 859.94034 0 131 873.00000 859.94034 1.50% - 2s 0 2 859.95017 0 131 873.00000 859.95017 1.49% - 2s H 54 54 872.0000000 860.12368 1.36% 29.4 3s * 136 103 41 870.0000000 860.46398 1.10% 24.6 3s * 251 146 44 868.0000000 860.52982 0.86% 24.0 3s * 559 234 20 867.0000000 861.62749 0.62% 23.5 4s 701 293 863.65294 16 111 867.00000 861.89682 0.59% 23.4 5s 1924 497 cutoff 24 867.00000 863.20690 0.44% 23.3 10s 3845 904 865.12195 23 104 867.00000 864.07875 0.34% 21.8 15s 6180 917 865.52941 26 74 867.00000 864.65957 0.27% 20.7 20s 8481 377 cutoff 28 867.00000 865.27778 0.20% 19.8 25s Cutting planes: Gomory: 9 MIR: 3 Zero half: 6 Explored 9015 nodes (175320 simplex iterations) in 26.23 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 74), (4, 78), (4, 80), (5, 22), (5, 55), (6, 62), (6, 85), (8, 83), (8, 89), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (13, 55), (13, 81), (15, 44), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (20, 49), (21, 33), (21, 67), (22, 73), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (31, 52), (31, 71), (32, 89), (33, 91), (34, 80), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (39, 45), (39, 87), (40, 68), (43, 58), (43, 88), (47, 48), (49, 83), (50, 65), (57, 76), (64, 65), (64, 91), (66, 72), (67, 72), (69, 77), (69, 81), (73, 74), (75, 76), (77, 78)] Optimize a model with 402 rows, 5050 columns and 190888 nonzeros Presolve time: 0.14s Presolved: 402 rows, 5050 columns, 190888 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 373 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 102 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 874.0000000 858.45843 1.78% - 0s 0 0 859.49507 0 119 874.00000 859.49507 1.66% - 0s 0 0 859.49507 0 101 874.00000 859.49507 1.66% - 0s 0 0 859.63012 0 115 874.00000 859.63012 1.64% - 1s 0 0 859.64243 0 122 874.00000 859.64243 1.64% - 1s 0 0 859.97066 0 121 874.00000 859.97066 1.61% - 1s 0 0 860.18367 0 123 874.00000 860.18367 1.58% - 1s 0 0 860.18367 0 127 874.00000 860.18367 1.58% - 1s 0 0 860.18367 0 124 874.00000 860.18367 1.58% - 1s 0 0 860.18367 0 128 874.00000 860.18367 1.58% - 1s 0 0 860.18883 0 131 874.00000 860.18883 1.58% - 1s 0 0 860.18883 0 132 874.00000 860.18883 1.58% - 1s 0 0 860.23840 0 121 874.00000 860.23840 1.57% - 1s 0 0 860.23840 0 122 874.00000 860.23840 1.57% - 1s 0 0 860.23840 0 124 874.00000 860.23840 1.57% - 1s 0 0 860.23840 0 125 874.00000 860.23840 1.57% - 2s 0 0 860.23840 0 125 874.00000 860.23840 1.57% - 2s 0 2 860.23875 0 125 874.00000 860.23875 1.57% - 2s * 347 270 37 872.0000000 860.89391 1.27% 22.2 3s * 515 366 58 871.0000000 861.04422 1.14% 22.7 3s * 528 332 68 870.0000000 861.04422 1.03% 22.3 3s 703 435 861.79047 3 101 870.00000 861.79047 0.94% 21.8 5s H 870 453 868.0000000 861.79047 0.72% 23.9 7s * 1435 448 22 867.0000000 863.14268 0.44% 24.2 8s 1603 428 863.50594 18 102 867.00000 863.34136 0.42% 23.9 10s 3159 314 865.16667 32 102 867.00000 864.31466 0.31% 23.2 15s Cutting planes: Gomory: 6 MIR: 2 Zero half: 7 Explored 4479 nodes (97165 simplex iterations) in 17.84 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (11, 63), (11, 91), (15, 39), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (32, 89), (33, 91), (35, 36), (35, 79), (36, 66), (39, 87), (40, 68), (42, 58), (43, 44), (43, 101), (45, 92), (57, 76), (62, 86), (63, 89), (66, 72), (67, 72), (69, 78), (69, 81), (75, 76), (79, 80), (86, 94), (92, 101), (94, 100), (97, 100)] adding cut for [(64, 65), (37, 50), (37, 48), (6, 85), (6, 61), (8, 83), (8, 53), (9, 46), (9, 47), (12, 64), (12, 20), (50, 65), (47, 48), (49, 83), (18, 46), (18, 85), (19, 84), (20, 49), (61, 84)] Optimize a model with 404 rows, 5050 columns and 192113 nonzeros Presolve time: 0.14s Presolved: 404 rows, 5050 columns, 192113 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 348 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 881.0000000 858.45843 2.56% - 0s H 0 0 875.0000000 858.45843 1.89% - 0s 0 0 859.49507 0 119 875.00000 859.49507 1.77% - 0s 0 0 859.49507 0 101 875.00000 859.49507 1.77% - 0s 0 0 859.63012 0 117 875.00000 859.63012 1.76% - 1s 0 0 859.88965 0 122 875.00000 859.88965 1.73% - 1s 0 0 860.11398 0 121 875.00000 860.11398 1.70% - 1s 0 0 860.22671 0 122 875.00000 860.22671 1.69% - 1s 0 0 860.22671 0 126 875.00000 860.22671 1.69% - 1s 0 0 860.23278 0 126 875.00000 860.23278 1.69% - 1s 0 0 860.23278 0 130 875.00000 860.23278 1.69% - 1s 0 0 860.23278 0 127 875.00000 860.23278 1.69% - 1s 0 0 860.23278 0 131 875.00000 860.23278 1.69% - 1s 0 0 860.23486 0 132 875.00000 860.23486 1.69% - 1s 0 0 860.23505 0 138 875.00000 860.23505 1.69% - 1s 0 0 860.23505 0 138 875.00000 860.23505 1.69% - 2s 0 2 860.23627 0 138 875.00000 860.23627 1.69% - 2s * 186 145 53 873.0000000 861.03784 1.37% 21.8 3s * 231 156 37 871.0000000 861.14278 1.13% 21.6 3s * 431 283 43 870.0000000 861.29243 1.00% 22.8 3s H 600 313 869.0000000 861.85284 0.82% 21.8 4s 606 317 865.50476 19 129 869.00000 861.85284 0.82% 21.6 5s H 745 334 867.0000000 861.85284 0.59% 23.7 7s 1249 457 863.96153 31 110 867.00000 862.62500 0.50% 25.6 10s 3201 582 865.08621 36 92 867.00000 864.36993 0.30% 21.9 15s Cutting planes: Gomory: 9 MIR: 1 Zero half: 9 Explored 5428 nodes (107599 simplex iterations) in 19.91 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(5, 55), (5, 56), (9, 46), (9, 47), (16, 44), (16, 58), (18, 46), (18, 85), (19, 84), (21, 33), (21, 67), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 80), (33, 91), (35, 36), (35, 79), (36, 72), (37, 47), (37, 50), (40, 68), (42, 58), (43, 44), (43, 88), (50, 65), (57, 76), (60, 93), (60, 94), (64, 65), (64, 91), (66, 67), (66, 72), (79, 80), (84, 85), (88, 98), (93, 98), (94, 100), (97, 100)] adding cut for [(4, 69), (4, 78), (8, 83), (8, 89), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (13, 81), (20, 48), (31, 52), (31, 71), (32, 89), (34, 51), (34, 82), (48, 49), (49, 83), (51, 77), (69, 81), (77, 78)] adding cut for [(99, 101), (6, 86), (6, 61), (39, 87), (45, 92), (15, 39), (15, 45), (17, 87), (17, 62), (38, 96), (38, 99), (92, 101), (62, 86), (95, 96)] Optimize a model with 407 rows, 5050 columns and 193461 nonzeros Presolve time: 0.14s Presolved: 407 rows, 5050 columns, 193461 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 361 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 102 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 877.0000000 858.45843 2.11% - 0s H 0 0 874.0000000 858.45843 1.78% - 0s 0 0 859.49507 0 120 874.00000 859.49507 1.66% - 0s 0 0 859.49507 0 101 874.00000 859.49507 1.66% - 0s 0 0 859.72317 0 116 874.00000 859.72317 1.63% - 1s 0 0 859.97749 0 123 874.00000 859.97749 1.60% - 1s 0 0 860.07305 0 119 874.00000 860.07305 1.59% - 1s 0 0 860.12181 0 129 874.00000 860.12181 1.59% - 1s 0 0 860.12281 0 130 874.00000 860.12281 1.59% - 1s 0 0 860.14453 0 137 874.00000 860.14453 1.59% - 1s 0 0 860.15311 0 138 874.00000 860.15311 1.58% - 1s 0 0 860.15311 0 141 874.00000 860.15311 1.58% - 1s 0 0 860.20825 0 125 874.00000 860.20825 1.58% - 1s 0 0 860.25384 0 129 874.00000 860.25384 1.57% - 1s 0 0 860.25413 0 133 874.00000 860.25413 1.57% - 1s 0 0 860.25413 0 132 874.00000 860.25413 1.57% - 1s 0 0 860.25413 0 136 874.00000 860.25413 1.57% - 1s 0 0 860.27622 0 137 874.00000 860.27622 1.57% - 1s 0 0 860.28494 0 140 874.00000 860.28494 1.57% - 2s 0 0 860.29044 0 137 874.00000 860.29044 1.57% - 2s 0 0 860.29122 0 139 874.00000 860.29122 1.57% - 2s 0 0 860.31996 0 133 874.00000 860.31996 1.57% - 2s 0 0 860.32042 0 137 874.00000 860.32042 1.57% - 2s 0 0 860.32514 0 136 874.00000 860.32514 1.56% - 2s 0 0 860.32514 0 139 874.00000 860.32514 1.56% - 2s 0 0 860.32980 0 138 874.00000 860.32980 1.56% - 2s 0 0 860.32980 0 141 874.00000 860.32980 1.56% - 2s 0 0 860.33617 0 132 874.00000 860.33617 1.56% - 2s 0 0 860.33653 0 137 874.00000 860.33653 1.56% - 2s 0 0 860.33653 0 138 874.00000 860.33653 1.56% - 2s 0 0 860.33653 0 138 874.00000 860.33653 1.56% - 2s H 0 0 873.0000000 860.33653 1.45% - 3s 0 2 860.33704 0 138 873.00000 860.33704 1.45% - 3s * 73 73 48 872.0000000 861.08064 1.25% 25.7 3s * 88 56 58 868.0000000 861.08064 0.80% 23.5 3s 601 354 865.72906 27 120 868.00000 862.35400 0.65% 22.2 5s 1632 534 865.93246 24 108 868.00000 862.99651 0.58% 23.7 10s * 1682 414 34 867.0000000 863.09798 0.45% 23.7 10s 3366 716 864.51521 27 106 867.00000 864.04626 0.34% 22.2 15s 5141 773 865.10968 23 103 867.00000 864.56702 0.28% 21.1 20s 7398 184 865.97826 27 87 867.00000 865.46835 0.18% 19.9 25s Cutting planes: Gomory: 8 MIR: 2 Zero half: 10 Explored 7651 nodes (150450 simplex iterations) in 25.50 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 57), (5, 73), (6, 61), (6, 85), (9, 46), (9, 47), (10, 52), (10, 72), (12, 64), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (21, 31), (21, 52), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 79), (31, 33), (33, 91), (35, 36), (35, 79), (36, 66), (37, 47), (37, 50), (38, 60), (38, 99), (39, 45), (39, 87), (40, 68), (43, 44), (50, 65), (55, 56), (60, 94), (61, 84), (62, 86), (64, 91), (66, 67), (67, 72), (73, 74), (74, 75), (75, 76), (86, 92), (92, 101), (94, 100), (97, 100), (99, 101)] Optimize a model with 408 rows, 5050 columns and 195352 nonzeros Presolve time: 0.14s Presolved: 408 rows, 5050 columns, 195352 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 342 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 876.0000000 858.45843 2.00% - 0s H 0 0 875.0000000 858.45843 1.89% - 0s 0 0 859.49507 0 119 875.00000 859.49507 1.77% - 0s 0 0 859.49507 0 102 875.00000 859.49507 1.77% - 0s 0 0 859.72312 0 117 875.00000 859.72312 1.75% - 1s 0 0 859.86454 0 119 875.00000 859.86454 1.73% - 1s 0 0 860.07305 0 115 875.00000 860.07305 1.71% - 1s 0 0 860.07386 0 123 875.00000 860.07386 1.71% - 1s 0 0 860.07386 0 124 875.00000 860.07386 1.71% - 1s 0 0 860.10226 0 128 875.00000 860.10226 1.70% - 1s 0 0 860.10226 0 132 875.00000 860.10226 1.70% - 1s 0 0 860.12358 0 133 875.00000 860.12358 1.70% - 1s 0 0 860.12358 0 137 875.00000 860.12358 1.70% - 1s 0 0 860.14178 0 135 875.00000 860.14178 1.70% - 1s 0 0 860.20348 0 127 875.00000 860.20348 1.69% - 1s 0 0 860.26880 0 131 875.00000 860.26880 1.68% - 2s 0 0 860.26880 0 135 875.00000 860.26880 1.68% - 2s 0 0 860.27506 0 123 875.00000 860.27506 1.68% - 2s 0 0 860.27506 0 126 875.00000 860.27506 1.68% - 2s 0 0 860.28391 0 133 875.00000 860.28391 1.68% - 2s 0 0 860.28391 0 136 875.00000 860.28391 1.68% - 2s 0 0 860.28561 0 130 875.00000 860.28561 1.68% - 2s 0 0 860.28561 0 133 875.00000 860.28561 1.68% - 2s 0 0 860.28561 0 134 875.00000 860.28561 1.68% - 2s 0 0 860.28561 0 134 875.00000 860.28561 1.68% - 2s H 0 0 874.0000000 860.28561 1.57% - 2s 0 2 860.28701 0 134 874.00000 860.28701 1.57% - 2s H 27 27 872.0000000 860.36388 1.33% 32.0 3s H 54 54 869.0000000 860.36388 0.99% 30.0 3s * 71 48 44 868.0000000 860.36388 0.88% 26.7 3s 601 374 864.73310 15 119 868.00000 861.93458 0.70% 21.9 5s * 911 428 47 867.0000000 861.93458 0.58% 24.2 8s 1446 439 cutoff 24 867.00000 863.14554 0.44% 22.5 10s 3492 790 865.51724 35 98 867.00000 864.21359 0.32% 19.8 15s 5533 668 cutoff 25 867.00000 864.90722 0.24% 18.5 20s Cutting planes: Gomory: 10 MIR: 2 Zero half: 5 Explored 6939 nodes (122929 simplex iterations) in 22.58 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(2, 70), (2, 71), (3, 42), (3, 58), (5, 56), (5, 73), (6, 61), (6, 85), (9, 46), (9, 47), (11, 63), (11, 64), (12, 20), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (18, 85), (18, 87), (20, 63), (21, 31), (21, 33), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (31, 71), (33, 91), (37, 48), (37, 50), (39, 45), (39, 87), (40, 68), (43, 44), (46, 84), (47, 48), (50, 65), (57, 76), (61, 84), (64, 91), (73, 74), (75, 76)] adding cut for [(35, 79), (35, 36), (34, 82), (34, 52), (67, 72), (4, 78), (4, 80), (69, 81), (10, 72), (10, 52), (55, 81), (13, 69), (77, 78), (80, 82), (51, 77), (66, 67), (25, 55), (25, 30), (36, 66), (30, 79)] adding cut for [(99, 101), (38, 98), (38, 99), (60, 100), (60, 93), (17, 92), (17, 62), (94, 100), (86, 94), (88, 98), (92, 101), (93, 96), (62, 86), (95, 96)] Optimize a model with 411 rows, 5050 columns and 196748 nonzeros Presolve time: 0.14s Presolved: 411 rows, 5050 columns, 196748 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 357 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 876.0000000 858.45843 2.00% - 0s H 0 0 875.0000000 858.45843 1.89% - 0s 0 0 859.49507 0 119 875.00000 859.49507 1.77% - 0s 0 0 859.49507 0 101 875.00000 859.49507 1.77% - 0s 0 0 859.72312 0 117 875.00000 859.72312 1.75% - 1s 0 0 859.86596 0 118 875.00000 859.86596 1.73% - 1s 0 0 860.08459 0 117 875.00000 860.08459 1.70% - 1s 0 0 860.08539 0 123 875.00000 860.08539 1.70% - 1s 0 0 860.10693 0 132 875.00000 860.10693 1.70% - 1s 0 0 860.17395 0 124 875.00000 860.17395 1.69% - 1s 0 0 860.19680 0 128 875.00000 860.19680 1.69% - 1s 0 0 860.20123 0 130 875.00000 860.20123 1.69% - 1s 0 0 860.26716 0 126 875.00000 860.26716 1.68% - 1s 0 0 860.27261 0 131 875.00000 860.27261 1.68% - 1s 0 0 860.27942 0 136 875.00000 860.27942 1.68% - 1s 0 0 860.30463 0 135 875.00000 860.30463 1.68% - 1s 0 0 860.31191 0 135 875.00000 860.31191 1.68% - 1s 0 0 860.31382 0 139 875.00000 860.31382 1.68% - 1s 0 0 860.32819 0 132 875.00000 860.32819 1.68% - 1s 0 0 860.32819 0 136 875.00000 860.32819 1.68% - 2s 0 0 860.33178 0 135 875.00000 860.33178 1.68% - 2s 0 0 860.33178 0 139 875.00000 860.33178 1.68% - 2s 0 0 860.33178 0 139 875.00000 860.33178 1.68% - 2s 0 2 860.33216 0 139 875.00000 860.33216 1.68% - 2s H 75 73 869.0000000 860.73654 0.95% 26.0 3s 601 428 867.29487 36 119 869.00000 861.77109 0.83% 21.3 5s H 838 483 868.0000000 861.77109 0.72% 24.0 7s 1741 626 866.95833 30 89 868.00000 863.02771 0.57% 23.1 10s * 2567 714 30 867.0000000 863.49210 0.40% 22.1 12s 3573 823 865.44857 24 111 867.00000 864.11665 0.33% 21.7 15s 5441 719 cutoff 25 867.00000 864.76577 0.26% 20.9 20s Cutting planes: Gomory: 8 MIR: 1 Zero half: 8 Explored 7204 nodes (141660 simplex iterations) in 23.91 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(2, 70), (2, 71), (4, 30), (4, 80), (5, 55), (5, 57), (10, 52), (10, 82), (11, 63), (11, 64), (21, 31), (21, 52), (24, 68), (24, 76), (25, 30), (25, 56), (26, 40), (26, 56), (31, 71), (32, 89), (33, 67), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 72), (40, 68), (51, 77), (55, 81), (57, 76), (63, 89), (64, 91), (66, 67), (66, 72), (69, 78), (69, 81), (77, 78), (79, 80)] adding cut for [(3, 42), (3, 58), (15, 39), (15, 43), (16, 44), (16, 58), (17, 87), (17, 92), (22, 74), (23, 42), (23, 75), (38, 93), (38, 99), (39, 45), (43, 44), (45, 87), (73, 74), (73, 75), (88, 98), (92, 101), (93, 98), (99, 101)] adding cut for [(37, 48), (37, 50), (8, 83), (8, 53), (9, 46), (9, 47), (12, 65), (12, 20), (18, 46), (18, 85), (47, 48), (49, 83), (50, 65), (20, 49), (86, 94), (95, 96), (60, 96), (60, 94), (62, 86), (62, 85)] Optimize a model with 414 rows, 5050 columns and 197991 nonzeros Presolve time: 0.14s Presolved: 414 rows, 5050 columns, 197991 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 362 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 875.0000000 858.45843 1.89% - 0s 0 0 859.49507 0 119 875.00000 859.49507 1.77% - 0s 0 0 859.49507 0 101 875.00000 859.49507 1.77% - 0s 0 0 859.72312 0 120 875.00000 859.72312 1.75% - 1s 0 0 859.86596 0 122 875.00000 859.86596 1.73% - 1s 0 0 860.07305 0 119 875.00000 860.07305 1.71% - 1s 0 0 860.12181 0 129 875.00000 860.12181 1.70% - 1s 0 0 860.12181 0 132 875.00000 860.12181 1.70% - 1s 0 0 860.13277 0 133 875.00000 860.13277 1.70% - 1s 0 0 860.13426 0 133 875.00000 860.13426 1.70% - 1s 0 0 860.14554 0 133 875.00000 860.14554 1.70% - 1s 0 0 860.20703 0 127 875.00000 860.20703 1.69% - 1s 0 0 860.20728 0 129 875.00000 860.20728 1.69% - 1s 0 0 860.20987 0 137 875.00000 860.20987 1.69% - 2s 0 0 860.21247 0 134 875.00000 860.21247 1.69% - 2s 0 0 860.21279 0 139 875.00000 860.21279 1.69% - 2s 0 0 860.23378 0 138 875.00000 860.23378 1.69% - 2s 0 0 860.23378 0 142 875.00000 860.23378 1.69% - 2s 0 0 860.24621 0 141 875.00000 860.24621 1.69% - 2s 0 0 860.25526 0 140 875.00000 860.25526 1.69% - 2s 0 0 860.26417 0 142 875.00000 860.26417 1.68% - 2s 0 0 860.26417 0 146 875.00000 860.26417 1.68% - 2s 0 0 860.27003 0 137 875.00000 860.27003 1.68% - 2s 0 0 860.28144 0 130 875.00000 860.28144 1.68% - 2s 0 0 860.28938 0 139 875.00000 860.28938 1.68% - 2s 0 0 860.29626 0 137 875.00000 860.29626 1.68% - 2s 0 0 860.29628 0 145 875.00000 860.29628 1.68% - 2s 0 0 860.29628 0 145 875.00000 860.29628 1.68% - 3s 0 2 860.30846 0 145 875.00000 860.30846 1.68% - 3s * 86 86 51 874.0000000 860.75589 1.52% 25.6 3s * 87 75 52 872.0000000 860.75589 1.29% 25.3 3s * 301 207 34 870.0000000 861.27569 1.00% 23.0 4s 601 384 865.99412 28 119 870.00000 861.74775 0.95% 22.4 5s * 807 434 43 869.0000000 861.74775 0.83% 24.2 8s * 854 401 34 868.0000000 861.74775 0.72% 24.7 8s 1236 474 865.66548 26 100 868.00000 863.11894 0.56% 24.3 10s * 1318 367 34 867.0000000 863.22054 0.44% 24.1 10s 2381 426 865.42632 35 105 867.00000 863.55632 0.40% 23.6 15s 4262 493 865.61255 34 102 867.00000 864.65174 0.27% 22.2 20s Cutting planes: Gomory: 9 MIR: 1 Zero half: 9 Mod-K: 1 Explored 5717 nodes (119919 simplex iterations) in 23.29 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (6, 61), (6, 85), (7, 97), (9, 46), (9, 47), (13, 55), (18, 62), (18, 85), (21, 33), (21, 67), (25, 30), (25, 55), (30, 81), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 99), (38, 101), (46, 84), (47, 48), (50, 65), (61, 84), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (79, 80), (86, 92), (92, 101), (94, 99), (94, 100), (97, 100)] adding cut for [(5, 56), (5, 73), (15, 43), (15, 44), (16, 44), (16, 58), (22, 41), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (40, 68), (42, 58), (43, 88), (57, 76), (60, 93), (60, 96), (73, 74), (75, 76), (88, 98), (93, 95), (96, 98)] adding cut for [(32, 89), (51, 77), (34, 51), (34, 82), (8, 83), (8, 89), (10, 82), (10, 52), (11, 71), (11, 63), (12, 20), (12, 63), (49, 83), (20, 49), (31, 71), (31, 52)] adding cut for [(17, 45), (17, 87), (39, 45), (39, 87)] Optimize a model with 418 rows, 5050 columns and 199278 nonzeros Presolve time: 0.14s Presolved: 418 rows, 5050 columns, 199278 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 362 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 875.0000000 858.45843 1.89% - 0s 0 0 859.49507 0 119 875.00000 859.49507 1.77% - 0s 0 0 859.49507 0 101 875.00000 859.49507 1.77% - 0s 0 0 859.72312 0 117 875.00000 859.72312 1.75% - 1s 0 0 859.86596 0 118 875.00000 859.86596 1.73% - 1s 0 0 860.07305 0 115 875.00000 860.07305 1.71% - 1s 0 0 860.07386 0 123 875.00000 860.07386 1.71% - 1s 0 0 860.07386 0 121 875.00000 860.07386 1.71% - 1s 0 0 860.07386 0 125 875.00000 860.07386 1.71% - 1s 0 0 860.08127 0 134 875.00000 860.08127 1.70% - 1s 0 0 860.11229 0 134 875.00000 860.11229 1.70% - 1s 0 0 860.17834 0 122 875.00000 860.17834 1.69% - 1s 0 0 860.17906 0 128 875.00000 860.17906 1.69% - 1s 0 0 860.27998 0 130 875.00000 860.27998 1.68% - 2s 0 0 860.28142 0 134 875.00000 860.28142 1.68% - 2s 0 0 860.29339 0 130 875.00000 860.29339 1.68% - 2s 0 0 860.29339 0 137 875.00000 860.29339 1.68% - 2s 0 0 860.29665 0 138 875.00000 860.29665 1.68% - 2s 0 0 860.29684 0 142 875.00000 860.29684 1.68% - 2s 0 0 860.29684 0 142 875.00000 860.29684 1.68% - 2s 0 2 860.29893 0 142 875.00000 860.29893 1.68% - 2s * 392 224 47 870.0000000 861.17782 1.01% 22.1 4s * 436 170 30 868.0000000 861.24795 0.78% 22.3 4s 601 249 863.84560 13 119 868.00000 861.62001 0.74% 22.8 5s * 741 265 29 867.0000000 861.62001 0.62% 25.0 7s 1666 398 865.08562 25 94 867.00000 863.32110 0.42% 24.4 10s 3575 584 865.91667 21 82 867.00000 864.40777 0.30% 22.0 15s Cutting planes: Gomory: 8 MIR: 1 Zero half: 5 Explored 5787 nodes (116316 simplex iterations) in 19.68 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (9, 46), (9, 47), (10, 36), (10, 52), (12, 64), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (21, 31), (21, 67), (22, 74), (23, 42), (23, 76), (31, 33), (33, 91), (34, 51), (34, 82), (36, 66), (37, 48), (37, 50), (39, 45), (39, 87), (43, 44), (47, 48), (50, 65), (51, 77), (52, 82), (62, 85), (64, 91), (66, 72), (67, 72), (73, 74), (73, 75), (75, 76)] adding cut for [(35, 79), (4, 78), (4, 80), (69, 78), (69, 81), (40, 68), (13, 81), (79, 80), (24, 68), (24, 57), (55, 56), (25, 55), (25, 30), (26, 40), (26, 56), (30, 35), (5, 57)] adding cut for [(97, 100), (6, 100), (6, 61), (92, 101), (93, 98), (93, 99), (19, 84), (86, 92), (86, 94), (88, 98), (38, 99), (38, 101), (60, 96), (60, 94), (61, 84), (95, 96), (95, 97)] Optimize a model with 421 rows, 5050 columns and 200487 nonzeros Presolve time: 0.14s Presolved: 421 rows, 5050 columns, 200487 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 362 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 871.0000000 858.45843 1.44% - 0s 0 0 859.49507 0 119 871.00000 859.49507 1.32% - 0s 0 0 859.49507 0 101 871.00000 859.49507 1.32% - 0s 0 0 859.73358 0 121 871.00000 859.73358 1.29% - 1s 0 0 860.13898 0 123 871.00000 860.13898 1.25% - 1s 0 0 860.14460 0 123 871.00000 860.14460 1.25% - 1s 0 0 860.17317 0 127 871.00000 860.17317 1.24% - 1s 0 0 860.17317 0 131 871.00000 860.17317 1.24% - 1s 0 0 860.17317 0 129 871.00000 860.17317 1.24% - 1s 0 0 860.17317 0 133 871.00000 860.17317 1.24% - 1s 0 0 860.17357 0 135 871.00000 860.17357 1.24% - 1s 0 0 860.17357 0 135 871.00000 860.17357 1.24% - 1s 0 2 860.18305 0 135 871.00000 860.18305 1.24% - 1s * 193 143 35 870.0000000 861.54857 0.97% 24.4 2s H 575 346 869.0000000 862.06303 0.80% 24.2 3s * 616 274 19 868.0000000 862.17858 0.67% 24.2 3s 714 323 865.70667 15 126 868.00000 862.46419 0.64% 23.7 5s * 896 346 36 867.0000000 862.46419 0.52% 25.1 6s 1994 366 865.85273 24 111 867.00000 863.96154 0.35% 23.3 10s 3804 269 865.24286 25 89 867.00000 865.00000 0.23% 21.3 15s Cutting planes: Gomory: 9 MIR: 2 Zero half: 3 Explored 4362 nodes (89894 simplex iterations) in 15.99 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (34, 51), (34, 82), (35, 79), (35, 82), (38, 93), (38, 99), (39, 45), (39, 87), (40, 68), (43, 44), (51, 77), (57, 76), (62, 86), (69, 78), (69, 81), (75, 76), (79, 80), (86, 92), (88, 98), (92, 101), (93, 98), (99, 101)] adding cut for [(2, 70), (2, 71), (6, 61), (6, 100), (9, 46), (9, 47), (10, 36), (10, 52), (11, 63), (11, 64), (12, 20), (12, 65), (18, 46), (18, 85), (20, 63), (21, 31), (21, 52), (31, 71), (33, 67), (33, 91), (36, 72), (37, 48), (37, 50), (47, 48), (50, 65), (60, 94), (60, 96), (61, 84), (64, 91), (66, 67), (66, 72), (84, 85), (94, 100), (95, 97), (96, 97)] Optimize a model with 423 rows, 5050 columns and 201978 nonzeros Presolve time: 0.14s Presolved: 423 rows, 5050 columns, 201978 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 362 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 873.0000000 858.45843 1.67% - 0s 0 0 859.49507 0 119 873.00000 859.49507 1.55% - 0s 0 0 859.49507 0 102 873.00000 859.49507 1.55% - 0s 0 0 859.62979 0 116 873.00000 859.62979 1.53% - 0s 0 0 859.91948 0 122 873.00000 859.91948 1.50% - 1s 0 0 860.07305 0 119 873.00000 860.07305 1.48% - 1s 0 0 860.12181 0 132 873.00000 860.12181 1.48% - 1s 0 0 860.13426 0 134 873.00000 860.13426 1.47% - 1s 0 0 860.14555 0 134 873.00000 860.14555 1.47% - 1s 0 0 860.14555 0 138 873.00000 860.14555 1.47% - 1s 0 0 860.15176 0 136 873.00000 860.15176 1.47% - 1s 0 0 860.15176 0 139 873.00000 860.15176 1.47% - 1s 0 0 860.15176 0 136 873.00000 860.15176 1.47% - 1s 0 0 860.15305 0 140 873.00000 860.15305 1.47% - 1s 0 0 860.20819 0 137 873.00000 860.20819 1.47% - 1s 0 0 860.22954 0 138 873.00000 860.22954 1.46% - 1s 0 0 860.23751 0 140 873.00000 860.23751 1.46% - 1s 0 0 860.24896 0 135 873.00000 860.24896 1.46% - 2s 0 0 860.24936 0 141 873.00000 860.24936 1.46% - 2s 0 0 860.25169 0 139 873.00000 860.25169 1.46% - 2s 0 0 860.25281 0 143 873.00000 860.25281 1.46% - 2s 0 0 860.25281 0 146 873.00000 860.25281 1.46% - 2s 0 0 860.25281 0 146 873.00000 860.25281 1.46% - 2s 0 2 860.26030 0 146 873.00000 860.26030 1.46% - 2s * 168 152 47 872.0000000 861.04660 1.26% 22.3 3s * 364 279 66 871.0000000 861.11652 1.13% 20.7 3s H 447 290 870.0000000 861.23983 1.01% 21.4 4s 601 383 864.35294 9 119 870.00000 861.42876 0.99% 21.7 5s * 681 402 47 869.0000000 861.42876 0.87% 23.1 7s H 732 383 868.0000000 861.42876 0.76% 23.4 7s * 1098 365 31 867.0000000 862.70952 0.49% 24.4 8s 1203 360 865.60288 24 101 867.00000 862.79238 0.49% 24.2 10s 2805 265 865.15385 38 86 867.00000 864.53214 0.28% 23.3 15s Cutting planes: Gomory: 9 MIR: 2 Zero half: 9 Explored 3770 nodes (83934 simplex iterations) in 17.47 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(3, 58), (3, 74), (4, 78), (4, 80), (7, 97), (10, 52), (10, 82), (13, 81), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (21, 52), (21, 67), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 79), (34, 80), (34, 82), (35, 36), (35, 79), (36, 72), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (42, 75), (43, 44), (55, 56), (57, 76), (60, 94), (60, 99), (62, 86), (66, 67), (66, 72), (69, 78), (69, 81), (73, 74), (73, 75), (86, 92), (92, 101), (94, 100), (97, 100)] adding cut for [(64, 65), (64, 91), (33, 91), (2, 71), (2, 51), (37, 48), (37, 50), (9, 46), (9, 47), (18, 46), (18, 85), (47, 48), (50, 65), (51, 77), (6, 85), (6, 61), (19, 84), (61, 84), (31, 33), (31, 71)] Optimize a model with 425 rows, 5050 columns and 203566 nonzeros Presolve time: 0.14s Presolved: 425 rows, 5050 columns, 203566 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 348 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 872.0000000 858.45843 1.55% - 0s 0 0 859.49507 0 119 872.00000 859.49507 1.43% - 0s 0 0 859.49507 0 101 872.00000 859.49507 1.43% - 0s 0 0 859.62979 0 115 872.00000 859.62979 1.42% - 1s 0 0 859.93540 0 118 872.00000 859.93540 1.38% - 1s 0 0 860.06496 0 129 872.00000 860.06496 1.37% - 1s 0 0 860.09920 0 129 872.00000 860.09920 1.36% - 1s 0 0 860.12808 0 132 872.00000 860.12808 1.36% - 1s 0 0 860.16866 0 129 872.00000 860.16866 1.36% - 1s 0 0 860.18458 0 134 872.00000 860.18458 1.35% - 1s 0 0 860.19790 0 137 872.00000 860.19790 1.35% - 1s 0 0 860.21030 0 139 872.00000 860.21030 1.35% - 1s 0 0 860.21030 0 142 872.00000 860.21030 1.35% - 1s 0 0 860.21371 0 139 872.00000 860.21371 1.35% - 1s 0 0 860.21371 0 143 872.00000 860.21371 1.35% - 1s 0 0 860.21417 0 140 872.00000 860.21417 1.35% - 1s 0 0 860.24396 0 132 872.00000 860.24396 1.35% - 1s 0 0 860.25048 0 136 872.00000 860.25048 1.35% - 1s 0 0 860.25202 0 134 872.00000 860.25202 1.35% - 2s 0 0 860.25511 0 137 872.00000 860.25511 1.35% - 2s 0 0 860.27057 0 139 872.00000 860.27057 1.35% - 2s 0 0 860.27057 0 142 872.00000 860.27057 1.35% - 2s 0 0 860.27581 0 136 872.00000 860.27581 1.34% - 2s 0 0 860.27581 0 139 872.00000 860.27581 1.34% - 2s 0 0 860.28324 0 137 872.00000 860.28324 1.34% - 2s 0 0 860.30216 0 143 872.00000 860.30216 1.34% - 2s 0 0 860.31730 0 142 872.00000 860.31730 1.34% - 2s 0 0 860.32313 0 141 872.00000 860.32313 1.34% - 2s 0 0 860.32623 0 142 872.00000 860.32623 1.34% - 2s 0 0 860.33063 0 145 872.00000 860.33063 1.34% - 2s 0 0 860.33063 0 145 872.00000 860.33063 1.34% - 2s 0 2 860.33805 0 145 872.00000 860.33805 1.34% - 3s * 174 122 50 869.0000000 861.25735 0.89% 20.8 3s * 280 167 30 868.0000000 861.51715 0.75% 22.1 4s 601 318 865.33333 8 119 868.00000 862.32314 0.65% 22.5 5s 1523 520 863.67453 20 106 868.00000 863.13592 0.56% 24.1 10s * 2165 617 30 867.0000000 863.62081 0.39% 23.5 11s 3403 753 865.39785 22 97 867.00000 864.27031 0.31% 22.4 15s 5361 603 865.45455 21 88 867.00000 865.00000 0.23% 21.1 20s Cutting planes: Gomory: 7 MIR: 2 Zero half: 9 Explored 6630 nodes (133273 simplex iterations) in 22.55 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 55), (5, 73), (8, 83), (8, 89), (9, 46), (9, 47), (11, 63), (11, 71), (12, 20), (12, 63), (15, 39), (15, 43), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 87), (20, 49), (21, 31), (21, 33), (22, 41), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 69), (31, 71), (32, 89), (33, 91), (37, 48), (37, 50), (38, 99), (38, 101), (39, 45), (40, 68), (43, 44), (45, 92), (47, 48), (49, 83), (50, 65), (55, 81), (57, 76), (62, 86), (64, 65), (64, 91), (69, 81), (73, 74), (75, 76), (86, 99), (92, 101)] adding cut for [(35, 79), (35, 36), (2, 70), (2, 51), (67, 72), (66, 67), (77, 78), (10, 72), (10, 52), (34, 82), (34, 51), (79, 80), (52, 82), (36, 66), (4, 78), (4, 80)] Optimize a model with 427 rows, 5050 columns and 205413 nonzeros Presolve time: 0.15s Presolved: 427 rows, 5050 columns, 205413 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 367 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 874.0000000 858.45843 1.78% - 0s 0 0 859.49507 0 120 874.00000 859.49507 1.66% - 0s 0 0 859.49507 0 101 874.00000 859.49507 1.66% - 0s 0 0 859.72312 0 117 874.00000 859.72312 1.63% - 1s 0 0 859.86596 0 118 874.00000 859.86596 1.62% - 1s 0 0 860.08459 0 116 874.00000 860.08459 1.59% - 1s 0 0 860.08539 0 122 874.00000 860.08539 1.59% - 1s 0 0 860.10693 0 132 874.00000 860.10693 1.59% - 1s 0 0 860.14858 0 132 874.00000 860.14858 1.58% - 1s 0 0 860.20145 0 122 874.00000 860.20145 1.58% - 1s 0 0 860.20145 0 126 874.00000 860.20145 1.58% - 1s 0 0 860.20145 0 123 874.00000 860.20145 1.58% - 1s 0 0 860.20145 0 127 874.00000 860.20145 1.58% - 1s 0 0 860.20746 0 132 874.00000 860.20746 1.58% - 1s 0 0 860.20822 0 134 874.00000 860.20822 1.58% - 1s 0 0 860.20822 0 136 874.00000 860.20822 1.58% - 2s 0 0 860.20822 0 137 874.00000 860.20822 1.58% - 2s 0 0 860.20822 0 137 874.00000 860.20822 1.58% - 2s 0 2 860.21493 0 137 874.00000 860.21493 1.58% - 2s * 99 85 60 872.0000000 861.13156 1.25% 28.4 2s * 231 156 50 870.0000000 861.54158 0.97% 24.0 3s 601 404 868.37500 31 120 870.00000 862.15052 0.90% 23.6 5s * 946 474 34 868.0000000 862.25691 0.66% 26.6 8s * 1262 398 35 867.0000000 863.17569 0.44% 25.6 9s 1404 383 864.60599 22 115 867.00000 863.40068 0.42% 25.3 10s 2836 381 865.03901 38 120 867.00000 864.12281 0.33% 24.0 15s 4846 257 865.78464 39 113 867.00000 865.18942 0.21% 21.5 20s Cutting planes: Gomory: 10 MIR: 2 Zero half: 8 Explored 5287 nodes (111266 simplex iterations) in 21.19 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(6, 61), (6, 85), (9, 46), (9, 47), (12, 20), (12, 65), (17, 62), (17, 87), (18, 85), (18, 87), (19, 83), (20, 49), (37, 48), (37, 50), (46, 84), (47, 48), (49, 83), (50, 65), (60, 94), (60, 100), (61, 84), (62, 86), (86, 94), (97, 100)] adding cut for [(4, 34), (4, 80), (8, 53), (8, 89), (10, 52), (10, 82), (11, 63), (11, 64), (21, 33), (21, 67), (31, 52), (31, 71), (32, 71), (33, 91), (34, 82), (35, 36), (35, 79), (36, 66), (63, 89), (64, 91), (66, 72), (67, 72), (79, 80)] adding cut for [(96, 98), (3, 42), (3, 58), (38, 93), (38, 99), (39, 45), (45, 92), (93, 96), (15, 39), (15, 43), (16, 44), (16, 58), (43, 44), (99, 101), (22, 74), (23, 42), (23, 75), (88, 98), (92, 101), (74, 75)] adding cut for [(2, 70), (2, 51), (69, 78), (69, 81), (40, 68), (73, 76), (77, 78), (13, 55), (51, 77), (24, 68), (24, 57), (57, 76), (25, 56), (25, 30), (26, 40), (26, 56), (30, 81), (5, 73), (5, 55)] Optimize a model with 431 rows, 5050 columns and 206389 nonzeros Presolve time: 0.14s Presolved: 431 rows, 5050 columns, 206389 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 353 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 102 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 872.0000000 858.45843 1.55% - 0s 0 0 859.49507 0 119 872.00000 859.49507 1.43% - 0s 0 0 859.49507 0 101 872.00000 859.49507 1.43% - 0s 0 0 859.62979 0 115 872.00000 859.62979 1.42% - 1s 0 0 859.91948 0 121 872.00000 859.91948 1.39% - 1s 0 0 860.07305 0 119 872.00000 860.07305 1.37% - 1s 0 0 860.12203 0 134 872.00000 860.12203 1.36% - 1s 0 0 860.14797 0 136 872.00000 860.14797 1.36% - 1s 0 0 860.15347 0 132 872.00000 860.15347 1.36% - 1s 0 0 860.21179 0 129 872.00000 860.21179 1.35% - 1s 0 0 860.21179 0 133 872.00000 860.21179 1.35% - 1s 0 0 860.24546 0 134 872.00000 860.24546 1.35% - 1s 0 0 860.30779 0 132 872.00000 860.30779 1.34% - 1s 0 0 860.30779 0 136 872.00000 860.30779 1.34% - 1s 0 0 860.30828 0 132 872.00000 860.30828 1.34% - 1s 0 0 860.30837 0 139 872.00000 860.30837 1.34% - 1s 0 0 860.30905 0 140 872.00000 860.30905 1.34% - 1s 0 2 860.33202 0 140 872.00000 860.33202 1.34% - 2s H 397 196 868.0000000 861.48029 0.75% 23.6 3s 605 275 864.17272 9 134 868.00000 861.80781 0.71% 23.4 5s 1825 581 cutoff 33 868.00000 863.37582 0.53% 24.0 10s * 2956 740 29 867.0000000 863.97984 0.35% 22.9 13s 3483 761 865.43768 22 98 867.00000 864.21739 0.32% 22.7 15s 5460 340 865.45455 25 90 867.00000 865.37500 0.19% 21.8 20s Cutting planes: Gomory: 9 MIR: 1 Zero half: 5 Mod-K: 1 Explored 5914 nodes (124755 simplex iterations) in 20.66 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(6, 61), (6, 94), (9, 46), (9, 47), (10, 36), (10, 52), (12, 64), (12, 65), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (21, 31), (21, 67), (31, 33), (33, 91), (34, 51), (34, 82), (36, 72), (37, 48), (37, 50), (38, 99), (38, 101), (39, 45), (39, 87), (45, 92), (47, 48), (50, 65), (51, 77), (52, 82), (61, 84), (62, 85), (64, 91), (66, 67), (66, 72), (86, 94), (86, 99), (92, 101)] adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (5, 55), (5, 73), (14, 88), (15, 43), (15, 44), (16, 44), (16, 58), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 35), (35, 79), (40, 68), (43, 88), (55, 81), (57, 76), (69, 78), (69, 81), (73, 74), (75, 76), (79, 80)] Optimize a model with 433 rows, 5050 columns and 207665 nonzeros Presolve time: 0.15s Presolved: 433 rows, 5050 columns, 207665 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 353 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 875.0000000 858.45843 1.89% - 0s 0 0 859.49507 0 119 875.00000 859.49507 1.77% - 0s 0 0 859.49507 0 102 875.00000 859.49507 1.77% - 0s 0 0 859.63012 0 117 875.00000 859.63012 1.76% - 1s 0 0 859.88965 0 122 875.00000 859.88965 1.73% - 1s 0 0 860.11400 0 122 875.00000 860.11400 1.70% - 1s 0 0 860.23220 0 131 875.00000 860.23220 1.69% - 1s 0 0 860.23703 0 140 875.00000 860.23703 1.69% - 1s 0 0 860.24381 0 133 875.00000 860.24381 1.69% - 1s 0 0 860.30323 0 128 875.00000 860.30323 1.68% - 1s 0 0 860.30323 0 132 875.00000 860.30323 1.68% - 1s 0 0 860.30323 0 131 875.00000 860.30323 1.68% - 1s 0 0 860.30323 0 135 875.00000 860.30323 1.68% - 1s 0 0 860.31999 0 126 875.00000 860.31999 1.68% - 1s 0 0 860.31999 0 130 875.00000 860.31999 1.68% - 1s 0 0 860.31999 0 130 875.00000 860.31999 1.68% - 2s 0 0 860.31999 0 134 875.00000 860.31999 1.68% - 2s 0 0 860.31999 0 134 875.00000 860.31999 1.68% - 2s H 0 0 874.0000000 860.31999 1.57% - 2s 0 2 860.32334 0 134 874.00000 860.32334 1.56% - 2s H 46 46 871.0000000 860.61431 1.19% 33.7 3s * 172 117 45 869.0000000 861.02451 0.92% 24.9 3s * 261 136 28 868.0000000 861.13708 0.79% 24.0 3s 603 276 866.24000 16 102 868.00000 862.18607 0.67% 22.9 5s * 1193 331 35 867.0000000 863.11097 0.45% 24.6 8s 1786 369 865.74375 27 88 867.00000 863.80341 0.37% 23.3 10s 3595 340 cutoff 29 867.00000 864.91981 0.24% 21.3 15s Cutting planes: Gomory: 5 MIR: 2 Zero half: 6 Explored 4354 nodes (88653 simplex iterations) in 16.71 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 30), (4, 80), (5, 26), (5, 40), (6, 85), (6, 94), (9, 46), (9, 47), (11, 63), (11, 64), (12, 20), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (20, 63), (21, 33), (21, 67), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 60), (38, 99), (39, 45), (39, 87), (40, 68), (43, 44), (47, 48), (50, 65), (55, 56), (57, 76), (60, 97), (62, 86), (64, 91), (66, 67), (66, 72), (79, 80), (86, 92), (92, 101), (94, 100), (97, 100), (99, 101)] Optimize a model with 434 rows, 5050 columns and 209376 nonzeros Presolve time: 0.15s Presolved: 434 rows, 5050 columns, 209376 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 397 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 886.0000000 858.45843 3.11% - 0s H 0 0 875.0000000 858.45843 1.89% - 0s 0 0 859.49507 0 119 875.00000 859.49507 1.77% - 0s 0 0 859.49507 0 101 875.00000 859.49507 1.77% - 0s 0 0 859.63012 0 117 875.00000 859.63012 1.76% - 1s 0 0 859.88965 0 122 875.00000 859.88965 1.73% - 1s 0 0 860.11400 0 121 875.00000 860.11400 1.70% - 1s 0 0 860.23220 0 127 875.00000 860.23220 1.69% - 1s 0 0 860.23675 0 139 875.00000 860.23675 1.69% - 1s 0 0 860.24321 0 131 875.00000 860.24321 1.69% - 1s 0 0 860.24321 0 134 875.00000 860.24321 1.69% - 1s 0 0 860.30321 0 123 875.00000 860.30321 1.68% - 1s 0 0 860.30321 0 130 875.00000 860.30321 1.68% - 1s 0 0 860.30321 0 131 875.00000 860.30321 1.68% - 1s 0 0 860.30321 0 134 875.00000 860.30321 1.68% - 1s 0 0 860.30321 0 134 875.00000 860.30321 1.68% - 2s H 0 0 874.0000000 860.30321 1.57% - 2s 0 2 860.32327 0 134 874.00000 860.32327 1.56% - 2s * 139 76 29 868.0000000 860.95000 0.81% 24.3 2s 604 333 866.43261 15 117 868.00000 862.54255 0.63% 23.7 5s * 1275 371 33 867.0000000 862.60674 0.51% 25.2 8s 1820 447 864.17479 22 108 867.00000 863.37415 0.42% 23.9 10s 3612 674 865.83713 27 94 867.00000 864.31972 0.31% 21.9 15s 5706 414 cutoff 29 867.00000 865.10625 0.22% 20.6 20s Cutting planes: Gomory: 8 MIR: 1 Zero half: 6 Explored 6434 nodes (128439 simplex iterations) in 21.09 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(5, 55), (5, 57), (9, 46), (9, 47), (13, 69), (17, 62), (17, 87), (18, 46), (18, 87), (21, 31), (21, 67), (24, 68), (24, 76), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (31, 33), (33, 91), (35, 36), (35, 79), (36, 66), (37, 47), (37, 50), (40, 68), (50, 65), (55, 81), (57, 76), (60, 94), (60, 100), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (69, 81), (86, 94), (95, 96), (96, 97), (97, 100)] adding cut for [(3, 42), (3, 58), (14, 88), (15, 39), (15, 43), (16, 44), (16, 58), (22, 74), (23, 42), (23, 75), (38, 93), (38, 99), (39, 45), (43, 44), (45, 92), (73, 74), (73, 75), (88, 98), (92, 101), (93, 98), (99, 101)] adding cut for [(32, 89), (48, 49), (2, 71), (2, 51), (4, 78), (4, 80), (8, 89), (8, 83), (10, 82), (10, 52), (11, 71), (11, 63), (12, 20), (12, 63), (34, 80), (34, 82), (77, 78), (49, 83), (51, 52), (20, 48)] Optimize a model with 437 rows, 5050 columns and 210678 nonzeros Presolve time: 0.15s Presolved: 437 rows, 5050 columns, 210678 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 364 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 873.0000000 858.45843 1.67% - 0s 0 0 859.49507 0 119 873.00000 859.49507 1.55% - 0s 0 0 859.49507 0 101 873.00000 859.49507 1.55% - 1s 0 0 859.63012 0 115 873.00000 859.63012 1.53% - 1s 0 0 859.64243 0 122 873.00000 859.64243 1.53% - 1s 0 0 860.14148 0 120 873.00000 860.14148 1.47% - 1s 0 0 860.17427 0 124 873.00000 860.17427 1.47% - 1s 0 0 860.17427 0 125 873.00000 860.17427 1.47% - 1s 0 0 860.18138 0 129 873.00000 860.18138 1.47% - 1s 0 0 860.18394 0 133 873.00000 860.18394 1.47% - 1s 0 0 860.18394 0 137 873.00000 860.18394 1.47% - 1s 0 0 860.19577 0 134 873.00000 860.19577 1.47% - 1s 0 0 860.28921 0 125 873.00000 860.28921 1.46% - 1s 0 0 860.30190 0 131 873.00000 860.30190 1.45% - 1s 0 0 860.30917 0 132 873.00000 860.30917 1.45% - 1s 0 0 860.31522 0 137 873.00000 860.31522 1.45% - 1s 0 0 860.31592 0 137 873.00000 860.31592 1.45% - 2s 0 0 860.31690 0 135 873.00000 860.31690 1.45% - 2s 0 0 860.31690 0 136 873.00000 860.31690 1.45% - 2s 0 0 860.32149 0 141 873.00000 860.32149 1.45% - 2s 0 0 860.32149 0 141 873.00000 860.32149 1.45% - 2s 0 2 860.32202 0 141 873.00000 860.32202 1.45% - 2s H 253 136 868.0000000 861.08405 0.80% 24.0 3s 601 290 864.89690 10 119 868.00000 862.23438 0.66% 24.8 5s * 1365 343 35 867.0000000 862.70667 0.50% 25.2 9s 1554 349 863.96455 24 99 867.00000 863.08582 0.45% 24.8 10s 3302 478 865.62605 27 105 867.00000 864.50000 0.29% 22.5 15s Cutting planes: Gomory: 7 MIR: 1 Zero half: 9 Explored 5112 nodes (104630 simplex iterations) in 19.37 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(2, 70), (2, 71), (4, 34), (4, 80), (5, 56), (5, 73), (6, 61), (6, 85), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 64), (12, 20), (12, 65), (15, 39), (15, 43), (16, 44), (16, 58), (17, 62), (17, 87), (18, 85), (18, 87), (20, 63), (21, 33), (21, 67), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (31, 52), (31, 71), (33, 91), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 99), (38, 101), (39, 45), (40, 68), (42, 58), (43, 44), (45, 92), (46, 84), (47, 48), (50, 65), (57, 76), (60, 86), (60, 100), (61, 84), (62, 86), (64, 91), (66, 72), (67, 72), (73, 74), (75, 76), (79, 80), (92, 101), (94, 99), (94, 100)] Optimize a model with 438 rows, 5050 columns and 212956 nonzeros Presolve time: 0.15s Presolved: 438 rows, 5050 columns, 212956 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 384 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 876.0000000 858.45843 2.00% - 0s H 0 0 875.0000000 858.45843 1.89% - 0s 0 0 859.49507 0 118 875.00000 859.49507 1.77% - 0s 0 0 859.49507 0 101 875.00000 859.49507 1.77% - 1s 0 0 859.73299 0 121 875.00000 859.73299 1.74% - 1s 0 0 860.14107 0 120 875.00000 860.14107 1.70% - 1s 0 0 860.14687 0 121 875.00000 860.14687 1.70% - 1s 0 0 860.14687 0 120 875.00000 860.14687 1.70% - 1s 0 0 860.14687 0 124 875.00000 860.14687 1.70% - 1s 0 0 860.15307 0 128 875.00000 860.15307 1.70% - 1s 0 0 860.15307 0 131 875.00000 860.15307 1.70% - 1s 0 0 860.18203 0 126 875.00000 860.18203 1.69% - 1s 0 0 860.18203 0 127 875.00000 860.18203 1.69% - 1s 0 0 860.18203 0 130 875.00000 860.18203 1.69% - 1s 0 0 860.18203 0 131 875.00000 860.18203 1.69% - 2s 0 0 860.18203 0 131 875.00000 860.18203 1.69% - 2s 0 2 860.19034 0 131 875.00000 860.19034 1.69% - 2s H 98 76 874.0000000 860.98081 1.49% 27.3 2s H 374 291 873.0000000 861.29296 1.34% 24.1 3s * 404 271 33 871.0000000 861.29296 1.11% 23.6 3s H 410 192 869.0000000 861.29296 0.89% 23.3 3s 603 289 867.66667 35 101 869.00000 861.48413 0.86% 23.3 5s * 714 312 38 868.0000000 861.88862 0.70% 25.0 7s 1490 444 866.08824 34 105 868.00000 862.96675 0.58% 24.9 10s * 1668 410 40 867.0000000 863.08519 0.45% 24.6 10s 2433 502 865.11942 37 105 867.00000 863.27583 0.43% 24.9 15s 4083 332 865.34580 35 106 867.00000 864.51765 0.29% 23.6 20s Cutting planes: Gomory: 15 MIR: 1 Zero half: 5 Mod-K: 1 Explored 5005 nodes (114272 simplex iterations) in 22.77 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(4, 34), (4, 80), (6, 61), (6, 85), (8, 19), (8, 83), (9, 46), (9, 47), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (17, 62), (17, 87), (18, 85), (18, 87), (20, 49), (21, 33), (21, 67), (31, 52), (31, 71), (33, 91), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (46, 84), (47, 48), (49, 83), (50, 65), (60, 94), (60, 100), (61, 84), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (79, 80), (86, 94), (97, 100)] adding cut for [(3, 42), (3, 58), (5, 40), (5, 73), (14, 88), (15, 39), (15, 43), (16, 44), (16, 58), (22, 74), (23, 42), (23, 76), (24, 57), (24, 68), (38, 93), (38, 99), (39, 45), (40, 68), (43, 44), (45, 92), (57, 76), (73, 75), (74, 75), (88, 98), (92, 101), (93, 96), (96, 98), (99, 101)] Optimize a model with 440 rows, 5050 columns and 214397 nonzeros Presolve time: 0.15s Presolved: 440 rows, 5050 columns, 214397 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 384 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 873.0000000 858.45843 1.67% - 0s 0 0 859.49507 0 119 873.00000 859.49507 1.55% - 0s 0 0 859.49507 0 101 873.00000 859.49507 1.55% - 0s 0 0 859.63012 0 120 873.00000 859.63012 1.53% - 1s 0 0 859.90509 0 124 873.00000 859.90509 1.50% - 1s 0 0 860.09811 0 123 873.00000 860.09811 1.48% - 1s 0 0 860.10956 0 124 873.00000 860.10956 1.48% - 1s 0 0 860.10956 0 124 873.00000 860.10956 1.48% - 1s 0 0 860.10956 0 128 873.00000 860.10956 1.48% - 1s 0 0 860.11257 0 119 873.00000 860.11257 1.48% - 1s 0 0 860.11352 0 125 873.00000 860.11352 1.48% - 1s 0 0 860.11352 0 130 873.00000 860.11352 1.48% - 1s 0 0 860.11352 0 130 873.00000 860.11352 1.48% - 1s 0 0 860.11352 0 130 873.00000 860.11352 1.48% - 1s 0 2 860.13700 0 130 873.00000 860.13700 1.47% - 2s * 76 70 47 870.0000000 861.56816 0.97% 27.5 2s * 569 335 18 869.0000000 861.98382 0.81% 22.3 3s 704 423 865.05020 14 116 869.00000 862.15027 0.79% 22.0 5s * 779 425 47 868.0000000 862.15027 0.67% 23.0 6s 1767 523 866.60000 29 93 868.00000 863.63814 0.50% 24.2 10s * 3481 686 32 867.0000000 864.34066 0.31% 22.8 14s 3602 676 865.44651 27 107 867.00000 864.42010 0.30% 22.7 15s 5508 151 865.98246 30 90 867.00000 865.69841 0.15% 21.3 20s Cutting planes: Gomory: 9 MIR: 2 Zero half: 6 Explored 5676 nodes (119157 simplex iterations) in 20.23 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (5, 55), (5, 73), (15, 43), (15, 45), (16, 44), (16, 58), (17, 87), (17, 92), (22, 41), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 35), (35, 79), (38, 96), (38, 99), (39, 45), (39, 87), (40, 68), (43, 44), (55, 81), (57, 76), (69, 78), (69, 81), (73, 74), (75, 76), (79, 80), (92, 101), (95, 96), (99, 101)] adding cut for [(9, 46), (9, 47), (10, 36), (10, 52), (12, 64), (12, 65), (18, 46), (18, 85), (21, 31), (21, 67), (31, 33), (33, 91), (34, 51), (34, 82), (36, 66), (37, 48), (37, 50), (47, 48), (50, 65), (51, 77), (52, 82), (60, 93), (60, 94), (62, 85), (62, 86), (64, 91), (66, 72), (67, 72), (86, 94), (88, 98), (93, 98)] Optimize a model with 442 rows, 5050 columns and 215713 nonzeros Presolve time: 0.15s Presolved: 442 rows, 5050 columns, 215713 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 374 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 875.0000000 858.45843 1.89% - 0s 0 0 859.49507 0 119 875.00000 859.49507 1.77% - 0s 0 0 859.49507 0 101 875.00000 859.49507 1.77% - 0s 0 0 859.63012 0 120 875.00000 859.63012 1.76% - 1s 0 0 859.91098 0 127 875.00000 859.91098 1.72% - 1s 0 0 860.09814 0 128 875.00000 860.09814 1.70% - 1s 0 0 860.10956 0 127 875.00000 860.10956 1.70% - 1s 0 0 860.11257 0 127 875.00000 860.11257 1.70% - 1s 0 0 860.12554 0 135 875.00000 860.12554 1.70% - 1s 0 0 860.17398 0 131 875.00000 860.17398 1.69% - 1s 0 0 860.17398 0 134 875.00000 860.17398 1.69% - 1s 0 0 860.19917 0 126 875.00000 860.19917 1.69% - 1s 0 0 860.20597 0 133 875.00000 860.20597 1.69% - 1s 0 0 860.20597 0 133 875.00000 860.20597 1.69% - 1s 0 0 860.20597 0 136 875.00000 860.20597 1.69% - 2s 0 0 860.21204 0 131 875.00000 860.21204 1.69% - 2s 0 0 860.21204 0 135 875.00000 860.21204 1.69% - 2s 0 0 860.22933 0 139 875.00000 860.22933 1.69% - 2s 0 0 860.23672 0 134 875.00000 860.23672 1.69% - 2s 0 0 860.23672 0 138 875.00000 860.23672 1.69% - 2s 0 0 860.23791 0 136 875.00000 860.23791 1.69% - 2s 0 0 860.23791 0 140 875.00000 860.23791 1.69% - 2s 0 0 860.24071 0 138 875.00000 860.24071 1.69% - 2s 0 0 860.26161 0 129 875.00000 860.26161 1.68% - 2s 0 0 860.26161 0 133 875.00000 860.26161 1.68% - 2s 0 0 860.26955 0 135 875.00000 860.26955 1.68% - 3s 0 0 860.26955 0 139 875.00000 860.26955 1.68% - 3s 0 0 860.27345 0 142 875.00000 860.27345 1.68% - 3s 0 0 860.27479 0 136 875.00000 860.27479 1.68% - 3s 0 0 860.27479 0 141 875.00000 860.27479 1.68% - 3s 0 0 860.29104 0 132 875.00000 860.29104 1.68% - 3s 0 0 860.29260 0 141 875.00000 860.29260 1.68% - 3s 0 0 860.29482 0 145 875.00000 860.29482 1.68% - 3s H 0 0 874.0000000 860.29482 1.57% - 3s 0 0 860.30240 0 141 874.00000 860.30240 1.57% - 4s 0 0 860.30783 0 139 874.00000 860.30783 1.57% - 4s 0 0 860.30875 0 137 874.00000 860.30875 1.57% - 4s 0 0 860.30875 0 141 874.00000 860.30875 1.57% - 4s 0 0 860.30993 0 135 874.00000 860.30993 1.57% - 4s 0 0 860.30993 0 139 874.00000 860.30993 1.57% - 4s 0 0 860.31016 0 137 874.00000 860.31016 1.57% - 4s 0 0 860.31016 0 141 874.00000 860.31016 1.57% - 4s 0 0 860.31016 0 141 874.00000 860.31016 1.57% - 4s 0 2 860.31199 0 141 874.00000 860.31199 1.57% - 4s 12 14 862.18154 8 114 874.00000 860.72915 1.52% 34.2 5s * 189 105 40 869.0000000 861.21231 0.90% 24.8 6s 709 444 867.40553 32 107 869.00000 861.90319 0.82% 24.8 10s * 955 472 34 868.0000000 861.90319 0.70% 26.0 11s * 1396 405 30 867.0000000 862.91987 0.47% 25.4 12s 2193 462 864.92505 19 117 867.00000 863.62698 0.39% 24.1 15s 3818 459 cutoff 27 867.00000 864.51826 0.29% 22.7 20s Cutting planes: Gomory: 10 MIR: 1 Zero half: 9 Explored 5348 nodes (114710 simplex iterations) in 24.06 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (4, 78), (4, 80), (6, 61), (6, 85), (9, 46), (9, 47), (10, 52), (10, 82), (18, 46), (18, 85), (19, 84), (21, 33), (21, 67), (25, 30), (25, 81), (30, 79), (31, 52), (31, 71), (33, 91), (34, 80), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (47, 48), (50, 65), (51, 77), (61, 84), (64, 65), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81)] adding cut for [(7, 97), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 76), (38, 99), (38, 101), (39, 45), (39, 87), (42, 58), (43, 44), (60, 97), (60, 100), (62, 86), (73, 74), (73, 75), (75, 76), (86, 92), (92, 101), (93, 94), (93, 99), (94, 100)] Optimize a model with 444 rows, 5050 columns and 216832 nonzeros Presolve time: 0.15s Presolved: 444 rows, 5050 columns, 216832 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 368 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 871.0000000 858.45843 1.44% - 0s 0 0 859.49507 0 119 871.00000 859.49507 1.32% - 0s 0 0 859.49507 0 102 871.00000 859.49507 1.32% - 0s 0 0 859.72312 0 117 871.00000 859.72312 1.29% - 1s 0 0 859.86454 0 119 871.00000 859.86454 1.28% - 1s 0 0 860.07305 0 119 871.00000 860.07305 1.25% - 1s 0 0 860.12203 0 131 871.00000 860.12203 1.25% - 1s 0 0 860.12341 0 132 871.00000 860.12341 1.25% - 1s 0 0 860.12341 0 136 871.00000 860.12341 1.25% - 1s 0 0 860.13145 0 137 871.00000 860.13145 1.25% - 1s 0 0 860.14828 0 136 871.00000 860.14828 1.25% - 1s 0 0 860.14828 0 139 871.00000 860.14828 1.25% - 1s 0 0 860.15945 0 137 871.00000 860.15945 1.24% - 1s 0 0 860.16636 0 133 871.00000 860.16636 1.24% - 1s 0 0 860.16783 0 137 871.00000 860.16783 1.24% - 1s 0 0 860.16783 0 138 871.00000 860.16783 1.24% - 1s 0 0 860.16783 0 137 871.00000 860.16783 1.24% - 2s 0 0 860.16783 0 141 871.00000 860.16783 1.24% - 2s 0 0 860.16783 0 141 871.00000 860.16783 1.24% - 2s 0 2 860.17499 0 141 871.00000 860.17499 1.24% - 2s * 168 88 33 867.0000000 861.42844 0.64% 25.3 2s 607 291 865.50000 26 128 867.00000 862.38387 0.53% 22.1 5s 1916 406 865.79646 20 113 867.00000 863.98361 0.35% 22.6 10s 3813 330 865.57266 24 100 867.00000 864.96203 0.24% 21.0 15s Cutting planes: Gomory: 8 MIR: 3 Zero half: 5 Explored 4592 nodes (93490 simplex iterations) in 16.79 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (5, 56), (5, 73), (6, 61), (6, 85), (8, 49), (8, 89), (9, 46), (9, 83), (11, 63), (11, 64), (13, 55), (15, 39), (15, 43), (16, 44), (16, 58), (17, 62), (17, 87), (18, 62), (18, 85), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 81), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (39, 45), (40, 68), (43, 44), (45, 87), (46, 84), (49, 83), (57, 76), (61, 84), (63, 89), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (73, 74), (75, 76), (79, 80)] adding cut for [(99, 101), (38, 99), (38, 93), (60, 96), (60, 100), (14, 88), (86, 92), (86, 94), (88, 98), (92, 101), (93, 98), (94, 100), (95, 96)] adding cut for [(37, 47), (37, 50), (12, 65), (12, 20), (47, 48), (50, 65), (20, 48)] Optimize a model with 447 rows, 5050 columns and 218484 nonzeros Presolve time: 0.15s Presolved: 447 rows, 5050 columns, 218484 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 369 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 875.0000000 858.45843 1.89% - 0s 0 0 859.49507 0 119 875.00000 859.49507 1.77% - 0s 0 0 859.49507 0 102 875.00000 859.49507 1.77% - 0s 0 0 859.63012 0 121 875.00000 859.63012 1.76% - 1s 0 0 859.91098 0 127 875.00000 859.91098 1.72% - 1s 0 0 860.09814 0 129 875.00000 860.09814 1.70% - 1s 0 0 860.10956 0 128 875.00000 860.10956 1.70% - 1s 0 0 860.10956 0 129 875.00000 860.10956 1.70% - 1s 0 0 860.11339 0 128 875.00000 860.11339 1.70% - 1s 0 0 860.11339 0 132 875.00000 860.11339 1.70% - 1s 0 0 860.11339 0 129 875.00000 860.11339 1.70% - 2s 0 0 860.11339 0 133 875.00000 860.11339 1.70% - 2s 0 0 860.11495 0 128 875.00000 860.11495 1.70% - 2s 0 0 860.11565 0 135 875.00000 860.11565 1.70% - 2s 0 0 860.11565 0 132 875.00000 860.11565 1.70% - 2s 0 2 860.11585 0 132 875.00000 860.11585 1.70% - 2s * 105 101 58 874.0000000 860.42265 1.55% 26.2 3s * 176 119 52 871.0000000 860.42265 1.21% 24.4 3s * 178 101 52 870.0000000 860.42265 1.10% 24.1 3s H 600 301 868.0000000 861.49547 0.75% 21.9 4s 601 294 863.85160 9 119 868.00000 861.49547 0.75% 21.8 5s H 646 308 867.0000000 861.49547 0.63% 23.3 6s 1687 463 865.73160 29 91 867.00000 863.16832 0.44% 22.7 10s 3463 744 cutoff 28 867.00000 864.13047 0.33% 20.6 15s 5228 680 865.61284 26 100 867.00000 864.78862 0.26% 19.8 20s Cutting planes: Gomory: 8 MIR: 2 Zero half: 7 Explored 6958 nodes (130370 simplex iterations) in 23.56 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(5, 57), (6, 61), (6, 85), (9, 46), (9, 47), (10, 52), (10, 72), (18, 46), (18, 85), (19, 84), (21, 33), (21, 52), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (40, 68), (47, 48), (50, 65), (55, 56), (61, 84), (64, 65), (64, 91), (66, 67), (67, 72)] adding cut for [(3, 42), (3, 58), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 76), (38, 99), (38, 101), (39, 45), (39, 87), (43, 44), (62, 86), (73, 74), (73, 75), (75, 76), (86, 92), (92, 101), (93, 96), (93, 99), (95, 96)] Optimize a model with 449 rows, 5050 columns and 219404 nonzeros Presolve time: 0.15s Presolved: 449 rows, 5050 columns, 219404 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 375 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 102 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 871.0000000 858.45843 1.44% - 0s 0 0 859.49507 0 120 871.00000 859.49507 1.32% - 0s 0 0 859.49507 0 102 871.00000 859.49507 1.32% - 0s 0 0 859.73358 0 121 871.00000 859.73358 1.29% - 1s 0 0 860.14107 0 120 871.00000 860.14107 1.25% - 1s 0 0 860.14687 0 121 871.00000 860.14687 1.25% - 1s 0 0 860.14687 0 125 871.00000 860.14687 1.25% - 1s 0 0 860.15372 0 132 871.00000 860.15372 1.25% - 1s 0 0 860.17546 0 125 871.00000 860.17546 1.24% - 1s 0 0 860.17546 0 128 871.00000 860.17546 1.24% - 1s 0 0 860.25577 0 121 871.00000 860.25577 1.23% - 1s 0 0 860.25945 0 122 871.00000 860.25945 1.23% - 1s 0 0 860.26295 0 134 871.00000 860.26295 1.23% - 1s 0 0 860.28549 0 127 871.00000 860.28549 1.23% - 1s 0 0 860.28549 0 130 871.00000 860.28549 1.23% - 1s 0 0 860.30693 0 132 871.00000 860.30693 1.23% - 1s 0 0 860.30693 0 136 871.00000 860.30693 1.23% - 1s 0 0 860.31132 0 140 871.00000 860.31132 1.23% - 1s 0 0 860.31404 0 133 871.00000 860.31404 1.23% - 2s 0 0 860.31404 0 137 871.00000 860.31404 1.23% - 2s 0 2 860.31431 0 137 871.00000 860.31431 1.23% - 2s * 301 206 37 869.0000000 861.09064 0.91% 20.9 3s 604 397 864.88224 11 114 869.00000 861.75631 0.83% 21.3 5s * 1321 555 42 868.0000000 862.80037 0.60% 24.2 9s * 1391 426 24 867.0000000 862.93678 0.47% 24.3 9s 1667 386 863.72970 20 112 867.00000 863.38773 0.42% 23.7 10s 3457 609 865.56154 23 82 867.00000 864.45958 0.29% 21.7 15s Cutting planes: Gomory: 7 MIR: 4 Zero half: 7 Explored 5456 nodes (109614 simplex iterations) in 19.38 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (3, 58), (3, 74), (4, 78), (4, 80), (7, 97), (8, 49), (8, 89), (9, 47), (9, 83), (10, 52), (10, 82), (11, 63), (11, 64), (12, 20), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (20, 63), (21, 52), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (31, 33), (31, 71), (32, 89), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 96), (38, 99), (39, 45), (39, 87), (40, 68), (42, 76), (43, 44), (47, 48), (49, 83), (50, 65), (57, 76), (62, 86), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (73, 74), (73, 75), (79, 80), (86, 92), (92, 101), (96, 97), (99, 101)] Optimize a model with 450 rows, 5050 columns and 221889 nonzeros Presolve time: 0.15s Presolved: 450 rows, 5050 columns, 221889 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 388 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 102 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 875.0000000 858.45843 1.89% - 0s H 0 0 874.0000000 858.45843 1.78% - 0s 0 0 859.49507 0 120 874.00000 859.49507 1.66% - 0s 0 0 859.49507 0 102 874.00000 859.49507 1.66% - 0s 0 0 859.73358 0 121 874.00000 859.73358 1.63% - 1s 0 0 860.12941 0 117 874.00000 860.12941 1.59% - 1s 0 0 860.14236 0 120 874.00000 860.14236 1.59% - 1s 0 0 860.17433 0 124 874.00000 860.17433 1.58% - 1s 0 0 860.17433 0 127 874.00000 860.17433 1.58% - 1s 0 0 860.22029 0 131 874.00000 860.22029 1.58% - 1s 0 0 860.22029 0 134 874.00000 860.22029 1.58% - 1s 0 0 860.27361 0 122 874.00000 860.27361 1.57% - 1s 0 0 860.27361 0 127 874.00000 860.27361 1.57% - 1s 0 0 860.28639 0 132 874.00000 860.28639 1.57% - 2s 0 0 860.28639 0 136 874.00000 860.28639 1.57% - 2s 0 0 860.29904 0 131 874.00000 860.29904 1.57% - 2s 0 0 860.29904 0 136 874.00000 860.29904 1.57% - 2s 0 0 860.29904 0 134 874.00000 860.29904 1.57% - 2s 0 0 860.29904 0 139 874.00000 860.29904 1.57% - 2s 0 0 860.30346 0 136 874.00000 860.30346 1.57% - 2s 0 0 860.30346 0 141 874.00000 860.30346 1.57% - 2s 0 0 860.30348 0 137 874.00000 860.30348 1.57% - 2s 0 0 860.30348 0 138 874.00000 860.30348 1.57% - 2s 0 0 860.30348 0 140 874.00000 860.30348 1.57% - 3s 0 0 860.30348 0 140 874.00000 860.30348 1.57% - 3s H 0 0 873.0000000 860.30348 1.45% - 3s 0 2 860.31221 0 140 873.00000 860.31221 1.45% - 3s 465 416 869.68992 49 76 873.00000 861.00109 1.37% 22.1 5s H 600 467 872.0000000 861.39020 1.22% 21.0 5s * 763 529 40 871.0000000 861.39020 1.10% 23.8 9s 937 595 864.58166 22 92 871.00000 861.64926 1.07% 24.8 10s * 991 521 48 869.0000000 861.64926 0.85% 24.9 10s H 1100 482 868.0000000 861.69323 0.73% 24.9 11s 1573 613 865.04511 31 99 868.00000 862.62772 0.62% 26.4 15s 3096 915 cutoff 37 868.00000 863.82448 0.48% 24.1 20s 4764 1400 867.00000 35 84 868.00000 864.39738 0.42% 23.0 25s 6469 1712 866.51613 38 99 868.00000 864.75987 0.37% 22.3 30s 8334 1866 865.71429 38 102 868.00000 865.07210 0.34% 21.9 35s * 8804 1107 42 867.0000000 865.13111 0.22% 21.8 36s Cutting planes: Gomory: 10 MIR: 3 Zero half: 9 Explored 10396 nodes (213155 simplex iterations) in 39.45 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(5, 26), (5, 40), (9, 19), (9, 47), (15, 43), (15, 45), (16, 44), (16, 58), (17, 87), (17, 92), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 80), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 47), (37, 50), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (50, 65), (55, 56), (57, 76), (64, 65), (64, 91), (66, 72), (67, 72), (79, 80), (92, 101), (93, 95), (93, 99)] adding cut for [(4, 69), (4, 78), (8, 83), (8, 89), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (13, 81), (20, 48), (21, 31), (21, 52), (31, 71), (32, 89), (34, 51), (34, 82), (48, 49), (49, 83), (51, 77), (69, 81), (77, 78)] adding cut for [(96, 98), (97, 100), (3, 74), (3, 88), (86, 94), (6, 100), (6, 61), (73, 75), (74, 75), (46, 84), (18, 46), (18, 85), (62, 86), (62, 85), (22, 73), (88, 98), (60, 96), (60, 94), (61, 84)] Optimize a model with 453 rows, 5050 columns and 223301 nonzeros Presolve time: 0.15s Presolved: 453 rows, 5050 columns, 223301 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 340 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 870.0000000 858.45843 1.33% - 0s 0 0 859.49507 0 119 870.00000 859.49507 1.21% - 0s 0 0 859.49507 0 101 870.00000 859.49507 1.21% - 0s 0 0 859.72143 0 119 870.00000 859.72143 1.18% - 1s 0 0 859.86596 0 119 870.00000 859.86596 1.16% - 1s 0 0 859.86655 0 120 870.00000 859.86655 1.16% - 1s 0 0 860.08539 0 122 870.00000 860.08539 1.14% - 1s 0 0 860.11066 0 135 870.00000 860.11066 1.14% - 1s 0 0 860.11066 0 139 870.00000 860.11066 1.14% - 1s 0 0 860.11624 0 132 870.00000 860.11624 1.14% - 1s 0 0 860.11624 0 136 870.00000 860.11624 1.14% - 1s 0 0 860.12164 0 133 870.00000 860.12164 1.14% - 1s 0 0 860.13104 0 134 870.00000 860.13104 1.13% - 1s 0 0 860.20773 0 130 870.00000 860.20773 1.13% - 1s 0 0 860.27642 0 122 870.00000 860.27642 1.12% - 1s 0 0 860.27642 0 125 870.00000 860.27642 1.12% - 1s 0 0 860.28695 0 129 870.00000 860.28695 1.12% - 1s 0 0 860.28695 0 133 870.00000 860.28695 1.12% - 1s 0 0 860.29431 0 129 870.00000 860.29431 1.12% - 2s 0 0 860.29431 0 133 870.00000 860.29431 1.12% - 2s 0 0 860.29934 0 135 870.00000 860.29934 1.12% - 2s 0 0 860.30872 0 139 870.00000 860.30872 1.11% - 2s 0 0 860.31000 0 139 870.00000 860.31000 1.11% - 2s 0 0 860.32764 0 129 870.00000 860.32764 1.11% - 2s 0 0 860.33131 0 135 870.00000 860.33131 1.11% - 2s 0 0 860.33927 0 136 870.00000 860.33927 1.11% - 2s 0 0 860.33927 0 139 870.00000 860.33927 1.11% - 2s 0 0 860.34350 0 134 870.00000 860.34350 1.11% - 2s 0 0 860.34350 0 134 870.00000 860.34350 1.11% - 2s 0 2 860.34760 0 134 870.00000 860.34760 1.11% - 3s H 559 371 869.0000000 861.72054 0.84% 22.4 4s 606 396 867.62257 18 102 869.00000 861.80823 0.83% 22.6 5s H 740 446 867.0000000 861.94568 0.58% 23.8 7s 1474 461 864.23105 17 111 867.00000 863.08293 0.45% 24.4 10s 2925 422 cutoff 30 867.00000 864.29167 0.31% 22.5 15s Cutting planes: Gomory: 11 MIR: 1 Zero half: 7 Explored 4663 nodes (97725 simplex iterations) in 19.87 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(5, 26), (5, 40), (6, 61), (6, 100), (9, 19), (9, 47), (15, 43), (15, 45), (16, 44), (16, 58), (17, 87), (17, 92), (18, 46), (18, 85), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 80), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (46, 84), (47, 48), (50, 65), (55, 56), (57, 76), (60, 94), (60, 96), (61, 84), (62, 85), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (79, 80), (86, 94), (92, 101), (93, 98), (93, 99), (96, 98), (97, 100)] adding cut for [(4, 69), (4, 78), (8, 83), (8, 89), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (13, 81), (20, 49), (21, 31), (21, 52), (31, 71), (32, 89), (34, 51), (34, 82), (49, 83), (51, 77), (69, 81), (77, 78)] Optimize a model with 455 rows, 5050 columns and 225207 nonzeros Presolve time: 0.16s Presolved: 455 rows, 5050 columns, 225207 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 361 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 877.0000000 858.45843 2.11% - 0s H 0 0 875.0000000 858.45843 1.89% - 0s 0 0 859.49507 0 119 875.00000 859.49507 1.77% - 0s 0 0 859.49507 0 102 875.00000 859.49507 1.77% - 0s 0 0 859.62979 0 116 875.00000 859.62979 1.76% - 1s 0 0 859.91948 0 122 875.00000 859.91948 1.72% - 1s 0 0 860.07305 0 119 875.00000 860.07305 1.71% - 1s 0 0 860.12181 0 132 875.00000 860.12181 1.70% - 1s 0 0 860.13426 0 134 875.00000 860.13426 1.70% - 1s 0 0 860.14555 0 134 875.00000 860.14555 1.70% - 1s 0 0 860.14555 0 138 875.00000 860.14555 1.70% - 1s 0 0 860.15179 0 135 875.00000 860.15179 1.70% - 1s 0 0 860.15179 0 138 875.00000 860.15179 1.70% - 1s 0 0 860.15179 0 136 875.00000 860.15179 1.70% - 1s 0 0 860.15305 0 140 875.00000 860.15305 1.70% - 2s 0 0 860.21924 0 135 875.00000 860.21924 1.69% - 2s 0 0 860.24021 0 140 875.00000 860.24021 1.69% - 2s 0 0 860.24107 0 141 875.00000 860.24107 1.69% - 2s 0 0 860.28338 0 131 875.00000 860.28338 1.68% - 2s 0 0 860.28338 0 134 875.00000 860.28338 1.68% - 2s 0 0 860.28338 0 134 875.00000 860.28338 1.68% - 2s 0 0 860.28338 0 137 875.00000 860.28338 1.68% - 2s 0 2 860.35003 0 137 875.00000 860.35003 1.67% - 3s * 182 77 15 868.0000000 860.76235 0.83% 24.3 4s 560 274 cutoff 20 868.00000 862.16220 0.67% 24.6 5s 1507 457 865.81166 25 101 868.00000 863.32520 0.54% 25.4 10s 3193 1018 866.61538 28 91 868.00000 864.30476 0.43% 23.3 15s 4983 1421 866.34930 26 95 868.00000 864.84010 0.36% 22.3 20s 6631 1574 866.20930 22 93 868.00000 865.14632 0.33% 21.7 25s * 7922 809 27 867.0000000 865.34504 0.19% 21.3 28s 8734 215 cutoff 28 867.00000 865.84375 0.13% 20.5 30s Cutting planes: Gomory: 6 Zero half: 7 Explored 8965 nodes (181375 simplex iterations) in 30.22 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(6, 61), (6, 85), (9, 46), (9, 47), (13, 69), (18, 46), (18, 85), (19, 84), (21, 33), (21, 67), (25, 30), (25, 55), (30, 79), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (47, 48), (50, 65), (55, 81), (61, 84), (64, 65), (64, 91), (66, 72), (67, 72), (69, 81)] adding cut for [(97, 100), (3, 58), (38, 60), (38, 99), (39, 45), (39, 87), (60, 94), (43, 44), (15, 43), (15, 45), (16, 44), (16, 58), (17, 87), (17, 62), (99, 101), (94, 100), (86, 92), (7, 97), (92, 101), (62, 86)] adding cut for [(5, 56), (5, 27), (40, 68), (73, 75), (73, 74), (42, 76), (24, 68), (24, 57), (22, 74), (23, 42), (23, 75), (57, 76), (26, 40), (26, 56)] Optimize a model with 458 rows, 5050 columns and 225928 nonzeros Presolve time: 0.16s Presolved: 458 rows, 5050 columns, 225928 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 361 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 869.0000000 858.45843 1.21% - 0s 0 0 859.49507 0 119 869.00000 859.49507 1.09% - 0s 0 0 859.49507 0 101 869.00000 859.49507 1.09% - 0s 0 0 859.54759 0 115 869.00000 859.54759 1.09% - 1s 0 0 859.86558 0 121 869.00000 859.86558 1.05% - 1s 0 0 860.12518 0 121 869.00000 860.12518 1.02% - 1s 0 0 860.14207 0 121 869.00000 860.14207 1.02% - 1s 0 0 860.17427 0 124 869.00000 860.17427 1.02% - 1s 0 0 860.17427 0 125 869.00000 860.17427 1.02% - 1s 0 0 860.18198 0 129 869.00000 860.18198 1.01% - 1s 0 0 860.18434 0 134 869.00000 860.18434 1.01% - 1s 0 0 860.24934 0 131 869.00000 860.24934 1.01% - 1s 0 0 860.27579 0 126 869.00000 860.27579 1.00% - 1s 0 0 860.27579 0 130 869.00000 860.27579 1.00% - 1s 0 0 860.27796 0 128 869.00000 860.27796 1.00% - 1s 0 0 860.29295 0 126 869.00000 860.29295 1.00% - 1s 0 0 860.29864 0 132 869.00000 860.29864 1.00% - 1s 0 0 860.29864 0 136 869.00000 860.29864 1.00% - 1s 0 0 860.29982 0 134 869.00000 860.29982 1.00% - 1s 0 0 860.29982 0 138 869.00000 860.29982 1.00% - 2s 0 0 860.30136 0 133 869.00000 860.30136 1.00% - 2s 0 0 860.30136 0 137 869.00000 860.30136 1.00% - 2s 0 2 860.31006 0 137 869.00000 860.31006 1.00% - 2s 605 427 866.22414 10 125 869.00000 862.12511 0.79% 21.8 5s * 1284 546 43 868.0000000 862.50772 0.63% 24.4 8s 1778 599 cutoff 25 868.00000 863.30000 0.54% 23.9 10s H 2370 583 867.0000000 863.85841 0.36% 23.5 11s 3503 643 cutoff 31 867.00000 864.50939 0.29% 22.3 15s 5246 213 cutoff 23 867.00000 865.48138 0.18% 21.1 20s Cutting planes: Gomory: 7 MIR: 2 Zero half: 8 Explored 5521 nodes (114460 simplex iterations) in 20.42 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.670000000000e+02, best bound 8.670000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (4, 78), (4, 80), (8, 49), (8, 89), (9, 47), (9, 83), (10, 52), (10, 82), (11, 63), (11, 64), (12, 20), (12, 65), (20, 63), (21, 33), (21, 67), (25, 30), (25, 81), (30, 79), (31, 52), (31, 71), (32, 89), (33, 91), (34, 80), (34, 82), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (51, 77), (64, 91), (66, 67), (66, 72), (69, 78), (69, 81)] adding cut for [(3, 58), (3, 74), (5, 56), (5, 55), (40, 68), (73, 74), (42, 58), (75, 76), (13, 55), (26, 40), (26, 56), (22, 73), (22, 41), (23, 42), (23, 75), (24, 68), (24, 57), (57, 76)] adding cut for [(96, 98), (99, 101), (38, 99), (38, 93), (39, 45), (39, 87), (60, 97), (60, 93), (43, 88), (15, 44), (15, 45), (16, 43), (16, 44), (17, 87), (17, 92), (88, 98), (92, 101), (95, 96)] Optimize a model with 461 rows, 5050 columns and 227090 nonzeros Presolve time: 0.16s Presolved: 461 rows, 5050 columns, 227090 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 355 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 102 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 874.0000000 858.45843 1.78% - 0s 0 0 859.49507 0 120 874.00000 859.49507 1.66% - 0s 0 0 859.49507 0 101 874.00000 859.49507 1.66% - 0s 0 0 859.73358 0 121 874.00000 859.73358 1.63% - 1s 0 0 860.12941 0 117 874.00000 860.12941 1.59% - 1s 0 0 860.14236 0 120 874.00000 860.14236 1.59% - 1s 0 0 860.17433 0 124 874.00000 860.17433 1.58% - 1s 0 0 860.17433 0 127 874.00000 860.17433 1.58% - 1s 0 0 860.21735 0 129 874.00000 860.21735 1.58% - 1s 0 0 860.21735 0 132 874.00000 860.21735 1.58% - 1s 0 0 860.22385 0 130 874.00000 860.22385 1.58% - 1s 0 0 860.22385 0 133 874.00000 860.22385 1.58% - 1s 0 0 860.26859 0 123 874.00000 860.26859 1.57% - 1s 0 0 860.26859 0 127 874.00000 860.26859 1.57% - 1s 0 0 860.27879 0 129 874.00000 860.27879 1.57% - 2s 0 0 860.27879 0 131 874.00000 860.27879 1.57% - 2s 0 0 860.29586 0 126 874.00000 860.29586 1.57% - 2s 0 0 860.30806 0 139 874.00000 860.30806 1.57% - 2s 0 0 860.31186 0 139 874.00000 860.31186 1.57% - 2s 0 0 860.32374 0 134 874.00000 860.32374 1.56% - 2s 0 0 860.33442 0 131 874.00000 860.33442 1.56% - 2s 0 0 860.33652 0 139 874.00000 860.33652 1.56% - 2s 0 0 860.33773 0 138 874.00000 860.33773 1.56% - 2s 0 0 860.34833 0 131 874.00000 860.34833 1.56% - 2s 0 0 860.34834 0 140 874.00000 860.34834 1.56% - 2s 0 0 860.35495 0 137 874.00000 860.35495 1.56% - 3s 0 0 860.35507 0 140 874.00000 860.35507 1.56% - 3s 0 0 860.35637 0 139 874.00000 860.35637 1.56% - 3s 0 0 860.35685 0 140 874.00000 860.35685 1.56% - 3s 0 0 860.35895 0 136 874.00000 860.35895 1.56% - 3s H 0 0 873.0000000 860.35895 1.45% - 3s 0 0 860.35895 0 140 873.00000 860.35895 1.45% - 3s 0 2 860.36151 0 139 873.00000 860.36151 1.45% - 4s H 28 28 871.0000000 860.88352 1.16% 28.5 4s 224 182 862.68455 4 105 871.00000 861.15059 1.13% 24.8 5s H 846 507 870.0000000 861.55485 0.97% 25.3 9s H 874 443 868.0000000 861.55485 0.74% 25.5 9s 980 481 866.79375 27 101 868.00000 861.67023 0.73% 25.3 10s 1958 646 864.49424 32 109 868.00000 863.32432 0.54% 24.4 15s 3708 1073 cutoff 30 868.00000 864.20416 0.44% 22.5 20s 5512 1547 cutoff 33 868.00000 864.63902 0.39% 21.4 25s 7445 1827 866.43114 40 106 868.00000 865.01345 0.34% 20.5 30s 9504 1931 866.60870 47 55 868.00000 865.35644 0.30% 20.0 35s 11989 1831 cutoff 42 868.00000 865.66447 0.27% 19.3 40s 14249 1481 866.73494 38 98 868.00000 865.94231 0.24% 18.9 45s 16666 373 866.69253 32 97 868.00000 866.50283 0.17% 18.3 50s Cutting planes: Gomory: 7 MIR: 1 Zero half: 6 Explored 17135 nodes (309250 simplex iterations) in 50.60 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 26), (5, 40), (7, 97), (9, 46), (9, 47), (12, 64), (12, 65), (16, 44), (16, 58), (18, 46), (18, 85), (19, 84), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 80), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (40, 68), (43, 44), (43, 88), (47, 48), (50, 65), (55, 56), (57, 76), (60, 94), (60, 96), (64, 91), (66, 72), (67, 72), (75, 76), (79, 80), (84, 85), (88, 98), (94, 100), (96, 98), (97, 100)] adding cut for [(32, 89), (34, 82), (34, 51), (4, 69), (4, 78), (69, 81), (8, 89), (8, 83), (10, 82), (10, 52), (11, 71), (11, 63), (77, 78), (13, 81), (51, 77), (20, 49), (20, 63), (49, 83), (31, 71), (31, 52)] adding cut for [(99, 101), (6, 86), (6, 61), (39, 87), (45, 92), (93, 95), (15, 39), (15, 45), (17, 87), (17, 62), (38, 99), (38, 93), (92, 101), (62, 86)] Optimize a model with 464 rows, 5050 columns and 228630 nonzeros Presolve time: 0.16s Presolved: 464 rows, 5050 columns, 228630 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 360 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 878.0000000 858.45843 2.23% - 0s H 0 0 875.0000000 858.45843 1.89% - 0s 0 0 859.49507 0 119 875.00000 859.49507 1.77% - 0s 0 0 859.49507 0 101 875.00000 859.49507 1.77% - 1s 0 0 859.72143 0 120 875.00000 859.72143 1.75% - 1s 0 0 859.86454 0 123 875.00000 859.86454 1.73% - 1s 0 0 859.97855 0 121 875.00000 859.97855 1.72% - 1s 0 0 860.10016 0 133 875.00000 860.10016 1.70% - 1s 0 0 860.12201 0 125 875.00000 860.12201 1.70% - 1s 0 0 860.12201 0 129 875.00000 860.12201 1.70% - 1s 0 0 860.12770 0 128 875.00000 860.12770 1.70% - 2s 0 0 860.13776 0 129 875.00000 860.13776 1.70% - 2s 0 0 860.16569 0 129 875.00000 860.16569 1.70% - 2s 0 0 860.16757 0 134 875.00000 860.16757 1.70% - 2s 0 0 860.17197 0 142 875.00000 860.17197 1.69% - 2s 0 0 860.17659 0 140 875.00000 860.17659 1.69% - 2s 0 0 860.17978 0 142 875.00000 860.17978 1.69% - 2s 0 0 860.18796 0 143 875.00000 860.18796 1.69% - 2s 0 0 860.19209 0 146 875.00000 860.19209 1.69% - 2s 0 0 860.20568 0 137 875.00000 860.20568 1.69% - 2s 0 0 860.22368 0 138 875.00000 860.22368 1.69% - 2s 0 0 860.22831 0 144 875.00000 860.22831 1.69% - 2s 0 0 860.22959 0 146 875.00000 860.22959 1.69% - 2s 0 0 860.23279 0 143 875.00000 860.23279 1.69% - 3s 0 0 860.23325 0 144 875.00000 860.23325 1.69% - 3s 0 2 860.26433 0 144 875.00000 860.26433 1.68% - 3s * 200 158 65 873.0000000 861.12245 1.36% 23.4 4s * 253 148 45 870.0000000 861.22958 1.01% 23.1 4s * 349 187 36 869.0000000 861.41553 0.87% 23.8 4s 540 293 867.45070 19 84 869.00000 861.53958 0.86% 24.6 5s H 972 393 868.0000000 862.60554 0.62% 26.3 9s 1215 431 866.40179 22 93 868.00000 863.00938 0.57% 25.8 10s 2941 908 866.15294 24 94 868.00000 864.30994 0.43% 23.5 15s 4466 1307 865.32106 19 104 868.00000 864.71209 0.38% 22.6 20s 6166 1568 866.12716 21 122 868.00000 865.02603 0.34% 21.9 25s 7859 1675 866.72062 29 77 868.00000 865.30904 0.31% 21.4 30s 9534 1659 866.71856 25 81 868.00000 865.52632 0.28% 21.1 35s 11826 1472 866.27068 22 86 868.00000 865.80171 0.25% 20.6 40s 13827 1061 866.85484 26 85 868.00000 866.07719 0.22% 20.2 45s Cutting planes: Gomory: 7 MIR: 1 Zero half: 11 Mod-K: 1 Explored 16000 nodes (311976 simplex iterations) in 48.73 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(2, 70), (2, 71), (6, 61), (6, 100), (9, 46), (9, 47), (11, 33), (11, 71), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (22, 74), (23, 42), (23, 75), (33, 91), (37, 47), (37, 50), (38, 99), (38, 101), (39, 45), (39, 87), (42, 58), (43, 44), (50, 65), (61, 84), (62, 86), (64, 65), (64, 91), (74, 75), (84, 85), (86, 92), (92, 101), (93, 94), (93, 99), (94, 100)] adding cut for [(4, 78), (4, 80), (5, 55), (5, 73), (10, 52), (10, 82), (13, 55), (21, 31), (21, 67), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (31, 52), (34, 51), (34, 82), (35, 36), (35, 79), (36, 72), (40, 68), (51, 77), (57, 76), (66, 67), (66, 72), (69, 78), (69, 81), (73, 76), (79, 80)] Optimize a model with 466 rows, 5050 columns and 229946 nonzeros Presolve time: 0.16s Presolved: 466 rows, 5050 columns, 229946 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 360 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 872.0000000 858.45843 1.55% - 0s 0 0 859.49507 0 119 872.00000 859.49507 1.43% - 0s 0 0 859.49507 0 102 872.00000 859.49507 1.43% - 1s 0 0 859.62979 0 115 872.00000 859.62979 1.42% - 1s 0 0 859.93540 0 119 872.00000 859.93540 1.38% - 1s 0 0 860.06496 0 130 872.00000 860.06496 1.37% - 1s 0 0 860.10093 0 133 872.00000 860.10093 1.36% - 1s 0 0 860.13074 0 129 872.00000 860.13074 1.36% - 1s 0 0 860.16567 0 124 872.00000 860.16567 1.36% - 1s 0 0 860.16567 0 128 872.00000 860.16567 1.36% - 1s 0 0 860.16713 0 127 872.00000 860.16713 1.36% - 1s 0 0 860.20229 0 124 872.00000 860.20229 1.35% - 1s 0 0 860.21080 0 131 872.00000 860.21080 1.35% - 1s 0 0 860.21080 0 135 872.00000 860.21080 1.35% - 1s 0 0 860.21080 0 132 872.00000 860.21080 1.35% - 1s 0 0 860.21080 0 136 872.00000 860.21080 1.35% - 2s 0 0 860.21410 0 135 872.00000 860.21410 1.35% - 2s 0 0 860.24781 0 131 872.00000 860.24781 1.35% - 2s 0 0 860.24781 0 136 872.00000 860.24781 1.35% - 2s 0 0 860.25598 0 132 872.00000 860.25598 1.35% - 2s 0 0 860.25829 0 136 872.00000 860.25829 1.35% - 2s 0 0 860.25871 0 139 872.00000 860.25871 1.35% - 2s 0 0 860.25871 0 140 872.00000 860.25871 1.35% - 2s 0 0 860.25871 0 138 872.00000 860.25871 1.35% - 2s 0 2 860.28215 0 138 872.00000 860.28215 1.34% - 3s * 424 334 66 871.0000000 861.49055 1.09% 20.6 4s * 476 260 32 869.0000000 861.60464 0.85% 21.5 4s 601 307 862.44565 5 119 869.00000 861.73017 0.84% 21.0 5s 1322 535 867.66667 28 80 869.00000 862.11442 0.79% 24.2 10s * 1323 456 29 868.0000000 862.11442 0.68% 24.2 10s 2753 1017 866.62222 29 98 868.00000 863.35930 0.53% 23.5 15s 4246 1493 866.29007 32 90 868.00000 863.92929 0.47% 23.1 20s 5874 1922 865.31223 30 97 868.00000 864.28943 0.43% 22.8 25s 7454 2236 866.31690 22 94 868.00000 864.55263 0.40% 22.5 30s 9038 2495 865.29412 23 94 868.00000 864.76056 0.37% 22.2 35s 10725 2632 866.24126 24 95 868.00000 864.95358 0.35% 21.9 40s 12831 2787 865.25235 24 108 868.00000 865.16967 0.33% 21.5 45s 14467 2796 866.25012 25 94 868.00000 865.30769 0.31% 21.3 50s 16750 2687 866.32961 22 102 868.00000 865.51304 0.29% 21.0 55s 19100 2335 866.83333 24 100 868.00000 865.75604 0.26% 20.8 60s 21534 1782 866.88889 30 97 868.00000 866.00145 0.23% 20.4 65s 24110 558 866.75579 21 104 868.00000 866.47059 0.18% 19.9 70s Cutting planes: Gomory: 9 MIR: 1 Zero half: 10 Explored 24813 nodes (488185 simplex iterations) in 72.08 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (5, 55), (5, 56), (6, 85), (6, 94), (10, 52), (10, 72), (13, 81), (15, 43), (15, 44), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 79), (34, 80), (34, 82), (35, 36), (35, 79), (36, 66), (38, 93), (38, 99), (39, 45), (39, 87), (40, 68), (42, 58), (43, 88), (45, 92), (46, 84), (52, 82), (57, 76), (61, 84), (62, 86), (66, 67), (67, 72), (69, 78), (69, 81), (73, 75), (73, 76), (86, 94), (88, 98), (92, 101), (93, 98), (99, 101)] adding cut for [(8, 83), (8, 89), (9, 19), (9, 47), (11, 63), (11, 71), (12, 20), (12, 63), (20, 49), (21, 31), (21, 33), (31, 71), (32, 89), (33, 91), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (64, 65), (64, 91)] adding cut for [(96, 97), (60, 96), (60, 100), (97, 100)] Optimize a model with 469 rows, 5050 columns and 231723 nonzeros Presolve time: 0.17s Presolved: 469 rows, 5050 columns, 231723 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 360 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 878.0000000 858.45843 2.23% - 0s 0 0 859.49507 0 118 878.00000 859.49507 2.11% - 0s 0 0 859.49507 0 101 878.00000 859.49507 2.11% - 1s 0 0 859.72143 0 117 878.00000 859.72143 2.08% - 1s 0 0 859.84639 0 112 878.00000 859.84639 2.07% - 1s 0 0 859.98199 0 121 878.00000 859.98199 2.05% - 1s 0 0 860.12601 0 122 878.00000 860.12601 2.04% - 1s 0 0 860.16326 0 122 878.00000 860.16326 2.03% - 2s 0 0 860.16326 0 125 878.00000 860.16326 2.03% - 2s 0 0 860.16593 0 126 878.00000 860.16593 2.03% - 2s 0 0 860.16713 0 129 878.00000 860.16713 2.03% - 2s 0 0 860.16713 0 128 878.00000 860.16713 2.03% - 2s 0 0 860.23403 0 126 878.00000 860.23403 2.02% - 2s 0 0 860.23403 0 133 878.00000 860.23403 2.02% - 2s 0 0 860.24256 0 133 878.00000 860.24256 2.02% - 2s 0 0 860.27286 0 134 878.00000 860.27286 2.02% - 3s 0 0 860.28226 0 136 878.00000 860.28226 2.02% - 3s 0 0 860.28557 0 135 878.00000 860.28557 2.02% - 3s 0 0 860.30426 0 132 878.00000 860.30426 2.02% - 3s 0 0 860.30696 0 133 878.00000 860.30696 2.02% - 3s 0 0 860.30696 0 132 878.00000 860.30696 2.02% - 3s 0 0 860.30696 0 134 878.00000 860.30696 2.02% - 3s 0 0 860.30783 0 135 878.00000 860.30783 2.02% - 3s 0 0 860.30783 0 135 878.00000 860.30783 2.02% - 3s 0 2 860.32278 0 135 878.00000 860.32278 2.01% - 4s * 90 79 56 871.0000000 860.74784 1.18% 28.1 4s 283 232 863.09111 6 105 871.00000 861.26602 1.12% 24.2 5s * 313 160 23 868.0000000 861.26602 0.78% 24.6 5s 1010 402 865.11581 22 111 868.00000 862.66497 0.61% 25.8 10s 2494 884 865.92927 24 115 868.00000 863.94690 0.47% 23.5 15s 4185 1384 865.65990 18 101 868.00000 864.44666 0.41% 22.3 20s 5809 1789 866.52941 33 84 868.00000 864.70410 0.38% 21.4 25s 7611 2113 866.08076 22 104 868.00000 864.94595 0.35% 20.9 30s 9414 2367 866.70500 23 88 868.00000 865.12727 0.33% 20.4 35s 11358 2522 866.77869 28 82 868.00000 865.30520 0.31% 20.1 40s 13293 2491 866.83309 22 94 868.00000 865.48418 0.29% 19.8 45s 15872 2325 866.53030 24 97 868.00000 865.67801 0.27% 19.4 50s 18526 1921 867.00000 20 89 868.00000 865.92278 0.24% 19.0 55s 21452 1106 866.33333 28 74 868.00000 866.23560 0.20% 18.5 60s Cutting planes: Gomory: 6 MIR: 3 Zero half: 10 Explored 23304 nodes (417851 simplex iterations) in 62.70 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (9, 46), (9, 47), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (21, 31), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (31, 33), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (39, 45), (39, 87), (40, 68), (43, 44), (47, 48), (50, 65), (57, 76), (62, 85), (64, 65), (64, 91), (66, 67), (66, 72), (69, 78), (69, 81), (75, 76), (79, 80)] adding cut for [(51, 52), (10, 52), (10, 82), (34, 51), (34, 82)] Optimize a model with 471 rows, 5050 columns and 232861 nonzeros Presolve time: 0.17s Presolved: 471 rows, 5050 columns, 232861 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 360 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 102 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 874.0000000 858.45843 1.78% - 0s 0 0 859.49507 0 118 874.00000 859.49507 1.66% - 0s 0 0 859.49507 0 101 874.00000 859.49507 1.66% - 1s 0 0 859.63012 0 118 874.00000 859.63012 1.64% - 1s 0 0 859.72935 0 118 874.00000 859.72935 1.63% - 1s 0 0 860.07305 0 119 874.00000 860.07305 1.59% - 1s 0 0 860.11618 0 130 874.00000 860.11618 1.59% - 1s 0 0 860.11618 0 131 874.00000 860.11618 1.59% - 1s 0 0 860.13949 0 123 874.00000 860.13949 1.59% - 1s 0 0 860.18776 0 125 874.00000 860.18776 1.58% - 1s 0 0 860.18776 0 127 874.00000 860.18776 1.58% - 1s 0 0 860.18776 0 130 874.00000 860.18776 1.58% - 1s 0 0 860.18776 0 131 874.00000 860.18776 1.58% - 2s 0 0 860.20349 0 135 874.00000 860.20349 1.58% - 2s 0 0 860.28485 0 129 874.00000 860.28485 1.57% - 2s 0 0 860.28485 0 133 874.00000 860.28485 1.57% - 2s 0 0 860.28485 0 131 874.00000 860.28485 1.57% - 2s 0 0 860.28485 0 135 874.00000 860.28485 1.57% - 2s 0 0 860.28542 0 125 874.00000 860.28542 1.57% - 2s 0 0 860.29450 0 131 874.00000 860.29450 1.57% - 2s 0 0 860.30274 0 128 874.00000 860.30274 1.57% - 2s 0 0 860.30274 0 132 874.00000 860.30274 1.57% - 2s 0 0 860.30850 0 135 874.00000 860.30850 1.57% - 3s 0 0 860.30850 0 139 874.00000 860.30850 1.57% - 3s 0 0 860.31781 0 131 874.00000 860.31781 1.57% - 3s 0 0 860.31781 0 132 874.00000 860.31781 1.57% - 3s 0 0 860.32616 0 135 874.00000 860.32616 1.56% - 3s 0 0 860.32616 0 136 874.00000 860.32616 1.56% - 3s 0 0 860.32616 0 140 874.00000 860.32616 1.56% - 3s H 0 0 873.0000000 860.32616 1.45% - 3s 0 0 860.32616 0 141 873.00000 860.32616 1.45% - 3s 0 0 860.32616 0 141 873.00000 860.32616 1.45% - 4s 0 2 860.33338 0 141 873.00000 860.33338 1.45% - 4s 152 129 867.22222 24 89 873.00000 860.95029 1.38% 26.3 5s * 185 125 48 870.0000000 860.95029 1.04% 25.0 5s * 407 267 28 869.0000000 861.33689 0.88% 24.7 5s 726 417 861.83102 15 113 869.00000 861.83102 0.82% 24.9 10s 2228 947 865.83333 31 66 869.00000 862.95455 0.70% 23.4 15s * 3420 1338 40 868.0000000 863.35298 0.54% 22.6 18s 3686 1420 866.60616 24 99 868.00000 863.42896 0.53% 22.6 20s 5242 1867 866.33333 31 94 868.00000 863.86648 0.48% 22.3 25s 6751 2221 866.55685 29 94 868.00000 864.16092 0.44% 21.9 30s 8622 2521 865.70485 26 96 868.00000 864.45000 0.41% 21.6 35s 10341 2785 866.67857 27 92 868.00000 864.68750 0.38% 21.3 40s 12447 2864 865.56557 25 91 868.00000 864.97333 0.35% 21.2 45s 14607 2808 cutoff 29 868.00000 865.22006 0.32% 21.0 50s 16958 2603 866.33817 29 87 868.00000 865.47842 0.29% 20.8 55s 19413 2178 866.72383 26 106 868.00000 865.73077 0.26% 20.6 60s 21746 1494 cutoff 31 868.00000 866.04762 0.22% 20.3 65s Cutting planes: Gomory: 8 MIR: 1 Zero half: 8 Explored 24171 nodes (473519 simplex iterations) in 68.88 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(5, 56), (5, 73), (14, 88), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 76), (24, 57), (24, 68), (26, 40), (26, 56), (38, 98), (38, 99), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (57, 76), (62, 86), (73, 75), (74, 75), (86, 92), (88, 98), (92, 101), (99, 101)] adding cut for [(8, 49), (8, 89), (9, 47), (9, 83), (11, 63), (11, 64), (12, 20), (12, 65), (13, 69), (20, 63), (21, 33), (21, 67), (25, 30), (25, 55), (30, 79), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (55, 81), (64, 91), (66, 67), (66, 72), (69, 81)] adding cut for [(32, 71), (2, 70), (2, 51), (34, 80), (34, 82), (4, 78), (4, 80), (10, 82), (10, 52), (77, 78), (51, 77), (31, 71), (31, 52)] Optimize a model with 474 rows, 5050 columns and 233883 nonzeros Presolve time: 0.17s Presolved: 474 rows, 5050 columns, 233883 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 360 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 102 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 875.0000000 858.45843 1.89% - 0s H 0 0 874.0000000 858.45843 1.78% - 0s 0 0 859.49507 0 118 874.00000 859.49507 1.66% - 0s 0 0 859.49507 0 101 874.00000 859.49507 1.66% - 1s 0 0 859.63012 0 118 874.00000 859.63012 1.64% - 1s 0 0 859.72935 0 118 874.00000 859.72935 1.63% - 1s 0 0 860.07305 0 119 874.00000 860.07305 1.59% - 1s 0 0 860.11618 0 130 874.00000 860.11618 1.59% - 1s 0 0 860.11618 0 131 874.00000 860.11618 1.59% - 1s 0 0 860.13949 0 122 874.00000 860.13949 1.59% - 1s 0 0 860.18776 0 125 874.00000 860.18776 1.58% - 1s 0 0 860.18776 0 127 874.00000 860.18776 1.58% - 1s 0 0 860.18776 0 130 874.00000 860.18776 1.58% - 2s 0 0 860.18776 0 131 874.00000 860.18776 1.58% - 2s 0 0 860.20349 0 135 874.00000 860.20349 1.58% - 2s 0 0 860.28485 0 129 874.00000 860.28485 1.57% - 2s 0 0 860.28485 0 133 874.00000 860.28485 1.57% - 2s 0 0 860.28485 0 131 874.00000 860.28485 1.57% - 2s 0 0 860.28485 0 134 874.00000 860.28485 1.57% - 2s 0 0 860.28542 0 126 874.00000 860.28542 1.57% - 2s 0 0 860.29450 0 132 874.00000 860.29450 1.57% - 2s 0 0 860.30274 0 129 874.00000 860.30274 1.57% - 2s 0 0 860.30274 0 133 874.00000 860.30274 1.57% - 2s 0 0 860.30850 0 136 874.00000 860.30850 1.57% - 3s 0 0 860.30850 0 140 874.00000 860.30850 1.57% - 3s 0 0 860.31781 0 132 874.00000 860.31781 1.57% - 3s 0 0 860.31781 0 133 874.00000 860.31781 1.57% - 3s 0 0 860.32616 0 135 874.00000 860.32616 1.56% - 3s 0 0 860.32616 0 136 874.00000 860.32616 1.56% - 3s 0 0 860.32616 0 140 874.00000 860.32616 1.56% - 3s 0 0 860.32616 0 141 874.00000 860.32616 1.56% - 3s 0 0 860.32616 0 141 874.00000 860.32616 1.56% - 3s H 0 0 873.0000000 860.32616 1.45% - 4s 0 2 860.33338 0 141 873.00000 860.33338 1.45% - 4s 82 84 869.53333 48 70 873.00000 860.82670 1.39% 30.0 5s * 331 171 36 869.0000000 861.10239 0.91% 24.9 5s 821 437 863.15944 25 100 869.00000 862.19072 0.78% 27.8 10s H 993 443 868.0000000 862.19072 0.67% 27.2 10s 2319 879 864.58333 28 100 868.00000 863.30243 0.54% 23.4 15s 3974 1486 866.08901 31 102 868.00000 863.80877 0.48% 22.0 20s 5396 1898 866.95238 39 100 868.00000 864.15694 0.44% 21.3 25s 7026 2253 866.25000 35 62 868.00000 864.45183 0.41% 20.9 30s 8679 2559 865.96602 28 103 868.00000 864.66509 0.38% 20.5 35s 10539 2820 cutoff 31 868.00000 864.84695 0.36% 20.2 40s 12811 3064 867.00000 32 42 868.00000 865.05914 0.34% 20.0 45s 14970 3103 866.89701 29 106 868.00000 865.24274 0.32% 19.9 50s 17232 3045 866.23810 34 81 868.00000 865.43165 0.30% 19.7 55s 19699 2824 866.52160 34 97 868.00000 865.62185 0.27% 19.5 60s 22155 2445 cutoff 29 868.00000 865.79567 0.25% 19.3 65s 24724 1802 cutoff 30 868.00000 866.01333 0.23% 19.1 70s 27116 766 866.75580 35 108 868.00000 866.37368 0.19% 18.7 75s Cutting planes: Gomory: 10 MIR: 3 Zero half: 6 Explored 28146 nodes (519451 simplex iterations) in 76.59 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (3, 42), (3, 58), (6, 61), (6, 85), (9, 19), (9, 47), (15, 43), (15, 45), (16, 44), (16, 58), (18, 85), (18, 87), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (39, 45), (39, 87), (40, 68), (43, 44), (46, 47), (46, 84), (51, 77), (57, 76), (61, 84), (69, 78), (69, 81), (75, 76), (77, 78)] adding cut for [(4, 34), (4, 80), (8, 53), (8, 83), (10, 52), (10, 82), (11, 63), (11, 71), (12, 64), (12, 65), (20, 48), (20, 49), (21, 33), (21, 67), (31, 52), (31, 71), (32, 89), (33, 91), (34, 82), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (49, 83), (50, 65), (63, 89), (64, 91), (66, 67), (66, 72), (79, 80)] adding cut for [(96, 98), (97, 100), (99, 101), (38, 99), (38, 93), (60, 96), (60, 93), (17, 92), (17, 62), (94, 100), (86, 94), (88, 98), (92, 101), (62, 86)] Optimize a model with 477 rows, 5050 columns and 235150 nonzeros Presolve time: 0.17s Presolved: 477 rows, 5050 columns, 235150 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 372 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 102 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 872.0000000 858.45843 1.55% - 0s 0 0 859.49507 0 119 872.00000 859.49507 1.43% - 0s 0 0 859.49507 0 102 872.00000 859.49507 1.43% - 1s 0 0 859.62979 0 116 872.00000 859.62979 1.42% - 1s 0 0 860.07305 0 117 872.00000 860.07305 1.37% - 1s 0 0 860.12203 0 133 872.00000 860.12203 1.36% - 1s 0 0 860.14797 0 135 872.00000 860.14797 1.36% - 1s 0 0 860.15577 0 130 872.00000 860.15577 1.36% - 1s 0 0 860.16484 0 135 872.00000 860.16484 1.36% - 1s 0 0 860.16556 0 140 872.00000 860.16556 1.36% - 1s 0 0 860.17166 0 136 872.00000 860.17166 1.36% - 1s 0 0 860.17166 0 140 872.00000 860.17166 1.36% - 1s 0 0 860.18177 0 137 872.00000 860.18177 1.36% - 1s 0 0 860.18592 0 141 872.00000 860.18592 1.35% - 1s 0 0 860.18592 0 142 872.00000 860.18592 1.35% - 1s 0 0 860.18715 0 144 872.00000 860.18715 1.35% - 2s 0 0 860.18715 0 144 872.00000 860.18715 1.35% - 2s 0 2 860.18823 0 144 872.00000 860.18823 1.35% - 2s * 95 78 58 870.0000000 860.74039 1.06% 25.7 2s H 187 126 869.0000000 861.07877 0.91% 23.2 3s 601 402 865.48388 9 119 869.00000 861.73271 0.84% 22.6 5s * 993 492 46 868.0000000 861.73271 0.72% 26.3 8s 1349 543 864.67518 20 93 868.00000 862.28073 0.66% 25.9 10s 2909 1100 865.13237 25 114 868.00000 863.44405 0.52% 24.0 15s 4695 1711 865.77150 29 92 868.00000 864.00923 0.46% 22.9 20s 6025 2022 865.28351 24 94 868.00000 864.30794 0.43% 22.5 25s 7735 2415 865.95146 26 108 868.00000 864.55941 0.40% 22.0 30s 9446 2676 866.59045 25 109 868.00000 864.78748 0.37% 21.6 35s 11375 2878 866.57179 34 91 868.00000 864.97431 0.35% 21.3 40s 13364 3020 867.00000 29 49 868.00000 865.14555 0.33% 21.0 45s 15529 3023 866.79167 27 96 868.00000 865.30732 0.31% 20.7 50s 17916 2907 865.93161 30 98 868.00000 865.50705 0.29% 20.4 55s 20304 2624 cutoff 30 868.00000 865.69933 0.27% 20.1 60s 22790 2052 866.69159 29 105 868.00000 865.94395 0.24% 19.9 65s 25192 983 866.76250 29 105 868.00000 866.30802 0.19% 19.6 70s Cutting planes: Gomory: 7 MIR: 2 Zero half: 9 Mod-K: 3 Explored 26514 nodes (507760 simplex iterations) in 73.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (3, 42), (3, 58), (4, 30), (4, 80), (6, 61), (6, 85), (9, 46), (9, 47), (10, 52), (10, 82), (15, 39), (15, 43), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (21, 52), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (31, 33), (31, 71), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 72), (37, 47), (37, 50), (38, 93), (38, 99), (39, 45), (40, 68), (43, 44), (45, 87), (50, 65), (55, 56), (57, 76), (61, 84), (62, 86), (64, 65), (64, 91), (66, 67), (66, 72), (75, 76), (79, 80), (86, 92), (88, 98), (92, 101), (93, 98), (99, 101)] Optimize a model with 478 rows, 5050 columns and 237166 nonzeros Presolve time: 0.17s Presolved: 478 rows, 5050 columns, 237166 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 366 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 874.0000000 858.45843 1.78% - 0s 0 0 859.49507 0 119 874.00000 859.49507 1.66% - 0s 0 0 859.49507 0 101 874.00000 859.49507 1.66% - 1s 0 0 859.72143 0 117 874.00000 859.72143 1.63% - 1s 0 0 859.86596 0 118 874.00000 859.86596 1.62% - 1s 0 0 860.08459 0 117 874.00000 860.08459 1.59% - 1s 0 0 860.08539 0 123 874.00000 860.08539 1.59% - 1s 0 0 860.10693 0 133 874.00000 860.10693 1.59% - 1s 0 0 860.14858 0 133 874.00000 860.14858 1.58% - 1s 0 0 860.20145 0 121 874.00000 860.20145 1.58% - 1s 0 0 860.20145 0 125 874.00000 860.20145 1.58% - 1s 0 0 860.20145 0 124 874.00000 860.20145 1.58% - 1s 0 0 860.20145 0 128 874.00000 860.20145 1.58% - 1s 0 0 860.20752 0 132 874.00000 860.20752 1.58% - 2s 0 0 860.20826 0 136 874.00000 860.20826 1.58% - 2s 0 0 860.20826 0 136 874.00000 860.20826 1.58% - 2s 0 0 860.20826 0 139 874.00000 860.20826 1.58% - 2s 0 0 860.20826 0 139 874.00000 860.20826 1.58% - 2s 0 2 860.21468 0 139 874.00000 860.21468 1.58% - 2s * 154 85 46 869.0000000 861.13034 0.91% 25.9 4s 472 279 865.25040 10 104 869.00000 862.00192 0.81% 24.9 5s 1198 543 865.58050 33 115 869.00000 862.79464 0.71% 26.3 10s * 1360 497 28 868.0000000 862.94721 0.58% 26.1 10s 2777 871 866.03828 27 117 868.00000 864.14497 0.44% 24.7 15s 4444 1226 865.96805 27 101 868.00000 864.67778 0.38% 23.4 20s 5948 1414 866.63158 33 89 868.00000 864.96151 0.35% 22.8 25s 7649 1511 866.60000 29 98 868.00000 865.24419 0.32% 22.2 30s 9400 1532 866.87429 36 92 868.00000 865.53321 0.28% 21.7 35s 11587 1284 cutoff 33 868.00000 865.83965 0.25% 21.1 40s 13830 634 866.81111 29 94 868.00000 866.27553 0.20% 20.5 45s Cutting planes: Gomory: 6 MIR: 2 Zero half: 7 Explored 14858 nodes (296301 simplex iterations) in 46.74 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(5, 55), (5, 57), (9, 46), (9, 47), (11, 33), (11, 71), (12, 64), (12, 65), (13, 69), (18, 46), (18, 85), (19, 84), (21, 31), (21, 67), (24, 68), (24, 76), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (31, 71), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (40, 68), (47, 48), (50, 65), (55, 81), (57, 76), (64, 91), (66, 72), (67, 72), (69, 81), (84, 85)] adding cut for [(3, 42), (3, 58), (15, 39), (15, 43), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 75), (38, 99), (38, 101), (39, 45), (43, 44), (45, 87), (62, 86), (73, 74), (73, 75), (86, 92), (88, 98), (92, 101), (93, 98), (93, 99)] adding cut for [(2, 51), (2, 52), (34, 80), (34, 82), (4, 78), (4, 80), (10, 82), (10, 52), (77, 78), (51, 77)] Optimize a model with 481 rows, 5050 columns and 238252 nonzeros Presolve time: 0.17s Presolved: 481 rows, 5050 columns, 238252 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 347 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 872.0000000 858.45843 1.55% - 0s 0 0 859.49507 0 119 872.00000 859.49507 1.43% - 0s 0 0 859.49507 0 101 872.00000 859.49507 1.43% - 1s 0 0 859.62979 0 116 872.00000 859.62979 1.42% - 1s 0 0 860.07305 0 115 872.00000 860.07305 1.37% - 1s 0 0 860.07386 0 125 872.00000 860.07386 1.37% - 1s 0 0 860.07386 0 129 872.00000 860.07386 1.37% - 1s 0 0 860.08559 0 130 872.00000 860.08559 1.37% - 1s 0 0 860.08911 0 137 872.00000 860.08911 1.37% - 1s 0 0 860.09802 0 138 872.00000 860.09802 1.36% - 1s 0 0 860.10040 0 135 872.00000 860.10040 1.36% - 1s 0 0 860.12376 0 132 872.00000 860.12376 1.36% - 1s 0 0 860.12376 0 135 872.00000 860.12376 1.36% - 1s 0 0 860.12376 0 136 872.00000 860.12376 1.36% - 1s 0 0 860.12376 0 138 872.00000 860.12376 1.36% - 2s 0 0 860.13661 0 137 872.00000 860.13661 1.36% - 2s 0 0 860.13979 0 137 872.00000 860.13979 1.36% - 2s 0 0 860.17202 0 135 872.00000 860.17202 1.36% - 2s 0 0 860.17508 0 137 872.00000 860.17508 1.36% - 2s 0 0 860.19408 0 140 872.00000 860.19408 1.35% - 2s 0 0 860.24741 0 139 872.00000 860.24741 1.35% - 2s 0 0 860.24847 0 141 872.00000 860.24847 1.35% - 2s 0 0 860.26285 0 142 872.00000 860.26285 1.35% - 2s 0 0 860.26285 0 145 872.00000 860.26285 1.35% - 2s 0 0 860.26488 0 145 872.00000 860.26488 1.35% - 2s 0 0 860.26488 0 146 872.00000 860.26488 1.35% - 2s 0 2 860.26865 0 146 872.00000 860.26865 1.35% - 3s H 143 124 871.0000000 861.19391 1.13% 22.9 4s 482 380 863.58273 5 101 871.00000 861.73755 1.06% 22.1 5s H 747 506 870.0000000 862.06735 0.91% 23.8 8s H 978 492 868.0000000 862.06735 0.68% 24.5 9s 1101 508 866.18792 21 119 868.00000 862.39641 0.65% 24.1 10s 1922 651 867.00000 35 84 868.00000 863.12403 0.56% 24.8 15s 3618 969 866.62857 36 89 868.00000 864.07450 0.45% 22.8 20s 5337 1420 cutoff 33 868.00000 864.57551 0.39% 22.0 25s 6977 1644 865.84146 37 91 868.00000 864.91228 0.36% 21.6 30s 8868 1801 865.51253 32 94 868.00000 865.18085 0.32% 21.1 35s 10753 1798 866.92500 30 103 868.00000 865.45769 0.29% 20.7 40s 13259 1495 866.24757 34 82 868.00000 865.81498 0.25% 20.2 45s 15944 698 866.79606 39 88 868.00000 866.25253 0.20% 19.6 50s Cutting planes: Gomory: 7 MIR: 1 Zero half: 9 Explored 17070 nodes (326724 simplex iterations) in 51.63 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(4, 30), (4, 80), (5, 27), (5, 57), (6, 61), (6, 85), (9, 46), (9, 47), (12, 64), (12, 65), (18, 46), (18, 85), (19, 84), (21, 33), (21, 67), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (40, 68), (47, 48), (50, 65), (55, 56), (61, 84), (64, 91), (66, 67), (66, 72), (79, 80)] adding cut for [(15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 76), (38, 96), (38, 99), (39, 45), (39, 87), (42, 58), (43, 44), (62, 86), (73, 74), (73, 75), (75, 76), (86, 92), (92, 101), (95, 96), (99, 101)] Optimize a model with 483 rows, 5050 columns and 239194 nonzeros Presolve time: 0.17s Presolved: 483 rows, 5050 columns, 239194 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 385 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 873.0000000 858.45843 1.67% - 0s 0 0 859.49507 0 119 873.00000 859.49507 1.55% - 0s 0 0 859.49507 0 101 873.00000 859.49507 1.55% - 1s 0 0 859.62908 0 115 873.00000 859.62908 1.53% - 1s 0 0 860.07305 0 120 873.00000 860.07305 1.48% - 1s 0 0 860.12749 0 131 873.00000 860.12749 1.47% - 1s 0 0 860.12749 0 132 873.00000 860.12749 1.47% - 1s 0 0 860.13954 0 123 873.00000 860.13954 1.47% - 1s 0 0 860.20844 0 126 873.00000 860.20844 1.47% - 1s 0 0 860.20844 0 127 873.00000 860.20844 1.47% - 1s 0 0 860.20844 0 130 873.00000 860.20844 1.47% - 1s 0 0 860.20844 0 130 873.00000 860.20844 1.47% - 1s 0 0 860.20844 0 130 873.00000 860.20844 1.47% - 2s 0 2 860.22176 0 130 873.00000 860.22176 1.46% - 2s * 492 401 39 872.0000000 861.44335 1.21% 24.5 3s H 525 359 871.0000000 861.49903 1.09% 24.4 4s * 684 318 26 869.0000000 861.72821 0.84% 23.9 4s 796 377 cutoff 21 869.00000 862.21917 0.78% 23.9 5s * 1068 437 29 868.0000000 862.25000 0.66% 26.0 8s 1520 506 863.61774 18 101 868.00000 862.78897 0.60% 25.3 10s 2936 909 866.39106 23 94 868.00000 863.70313 0.50% 23.6 15s 4379 1316 866.85835 24 110 868.00000 864.13680 0.45% 23.2 20s 6201 1645 866.75646 20 119 868.00000 864.55191 0.40% 22.7 25s 7671 1786 cutoff 24 868.00000 864.79793 0.37% 22.6 30s 9297 1854 866.60694 23 85 868.00000 865.03613 0.34% 22.3 35s 11215 1772 866.76000 24 76 868.00000 865.28365 0.31% 22.0 40s 13443 1531 865.99286 25 102 868.00000 865.59074 0.28% 21.8 45s 15077 1177 866.47126 24 102 868.00000 865.82178 0.25% 21.5 50s 17529 27 cutoff 27 868.00000 866.88462 0.13% 20.9 55s Cutting planes: Gomory: 8 MIR: 2 Zero half: 7 Explored 17557 nodes (366653 simplex iterations) in 55.02 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(2, 71), (5, 26), (5, 40), (8, 83), (8, 89), (11, 63), (11, 71), (12, 64), (12, 65), (20, 48), (20, 49), (21, 31), (21, 67), (22, 41), (22, 74), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 79), (31, 33), (33, 91), (35, 36), (35, 79), (36, 72), (37, 47), (37, 50), (40, 68), (47, 48), (49, 83), (50, 65), (55, 56), (57, 76), (63, 89), (64, 91), (66, 67), (66, 72), (73, 74), (73, 75), (75, 76)] adding cut for [(6, 61), (6, 94), (7, 97), (9, 46), (9, 84), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (38, 93), (38, 99), (39, 45), (39, 87), (43, 44), (58, 88), (60, 93), (60, 100), (61, 84), (62, 85), (86, 92), (86, 94), (88, 98), (92, 101), (95, 96), (96, 98), (97, 100), (99, 101)] adding cut for [(3, 42), (3, 23), (23, 42)] Optimize a model with 486 rows, 5050 columns and 240554 nonzeros Presolve time: 0.17s Presolved: 486 rows, 5050 columns, 240554 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 368 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 102 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 869.0000000 858.45843 1.21% - 0s 0 0 859.49507 0 120 869.00000 859.49507 1.09% - 0s 0 0 859.49507 0 101 869.00000 859.49507 1.09% - 1s 0 0 859.54691 0 116 869.00000 859.54691 1.09% - 1s 0 0 859.88963 0 120 869.00000 859.88963 1.05% - 1s 0 0 860.11212 0 119 869.00000 860.11212 1.02% - 1s 0 0 860.23220 0 132 869.00000 860.23220 1.01% - 1s 0 0 860.23383 0 139 869.00000 860.23383 1.01% - 1s 0 0 860.27214 0 124 869.00000 860.27214 1.00% - 1s 0 0 860.27356 0 131 869.00000 860.27356 1.00% - 1s 0 0 860.27356 0 132 869.00000 860.27356 1.00% - 1s 0 0 860.27356 0 135 869.00000 860.27356 1.00% - 1s 0 0 860.27356 0 135 869.00000 860.27356 1.00% - 1s 0 2 860.31432 0 135 869.00000 860.31432 1.00% - 1s H 271 180 868.0000000 861.59324 0.74% 28.4 3s 605 342 863.87148 7 122 868.00000 862.68816 0.61% 23.8 5s 1710 581 863.76528 22 123 868.00000 863.55030 0.51% 23.6 10s 3424 1219 866.52683 35 97 868.00000 864.27174 0.43% 21.3 15s 5072 1652 865.55631 24 107 868.00000 864.65498 0.39% 20.5 20s 6862 1957 865.89474 17 77 868.00000 864.91590 0.36% 20.2 25s 8549 2113 865.97989 28 98 868.00000 865.15732 0.33% 20.0 30s 10478 2125 866.38235 27 111 868.00000 865.40583 0.30% 19.8 35s 12643 1954 866.93958 28 91 868.00000 865.69109 0.27% 19.5 40s 14744 1552 866.29787 29 80 868.00000 865.98728 0.23% 19.3 45s 17459 321 cutoff 30 868.00000 866.56604 0.17% 18.6 50s Cutting planes: Gomory: 9 MIR: 1 Zero half: 9 Explored 17864 nodes (329208 simplex iterations) in 51.05 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (6, 61), (6, 100), (9, 46), (9, 47), (12, 64), (12, 65), (15, 43), (15, 44), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (21, 31), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (31, 33), (33, 91), (35, 36), (35, 79), (36, 72), (37, 47), (37, 50), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (43, 88), (45, 92), (50, 65), (57, 76), (60, 93), (60, 96), (61, 84), (62, 85), (64, 91), (66, 67), (66, 72), (75, 76), (86, 94), (86, 99), (88, 98), (92, 101), (93, 98), (94, 100), (95, 96)] adding cut for [(34, 80), (34, 82), (4, 78), (4, 80), (69, 78), (69, 81), (73, 74), (10, 82), (10, 52), (51, 77), (51, 52), (22, 41), (22, 74), (55, 81), (5, 73), (5, 55)] Optimize a model with 488 rows, 5050 columns and 242460 nonzeros Presolve time: 0.17s Presolved: 488 rows, 5050 columns, 242460 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 368 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 878.0000000 858.45843 2.23% - 0s 0 0 859.49507 0 118 878.00000 859.49507 2.11% - 0s 0 0 859.49507 0 101 878.00000 859.49507 2.11% - 1s 0 0 859.63012 0 121 878.00000 859.63012 2.09% - 1s 0 0 859.90509 0 124 878.00000 859.90509 2.06% - 1s 0 0 860.09811 0 124 878.00000 860.09811 2.04% - 1s 0 0 860.09811 0 129 878.00000 860.09811 2.04% - 1s 0 0 860.09811 0 125 878.00000 860.09811 2.04% - 1s 0 0 860.09811 0 131 878.00000 860.09811 2.04% - 1s 0 0 860.12634 0 122 878.00000 860.12634 2.04% - 2s 0 0 860.12634 0 126 878.00000 860.12634 2.04% - 2s 0 0 860.12634 0 125 878.00000 860.12634 2.04% - 2s 0 0 860.12634 0 129 878.00000 860.12634 2.04% - 2s 0 0 860.13125 0 129 878.00000 860.13125 2.04% - 2s 0 0 860.13125 0 132 878.00000 860.13125 2.04% - 2s 0 0 860.22221 0 124 878.00000 860.22221 2.02% - 2s 0 0 860.22221 0 128 878.00000 860.22221 2.02% - 3s 0 0 860.22330 0 129 878.00000 860.22330 2.02% - 3s 0 0 860.22330 0 133 878.00000 860.22330 2.02% - 3s 0 0 860.22330 0 133 878.00000 860.22330 2.02% - 3s 0 0 860.22330 0 133 878.00000 860.22330 2.02% - 3s H 0 0 877.0000000 860.22330 1.91% - 3s 0 2 860.22747 0 133 877.00000 860.22747 1.91% - 3s * 118 116 66 875.0000000 860.72701 1.63% 27.6 4s H 154 135 874.0000000 860.80723 1.51% 27.3 4s * 193 137 49 871.0000000 860.80723 1.17% 26.8 4s 227 163 869.95238 26 82 871.00000 861.51579 1.09% 26.7 5s * 422 258 30 869.0000000 861.81796 0.83% 25.0 5s 1066 496 864.67925 18 106 869.00000 862.29324 0.77% 25.8 10s * 2386 835 32 868.0000000 863.64289 0.50% 23.8 14s 2612 909 865.25104 15 119 868.00000 863.80435 0.48% 23.7 15s 4178 1314 cutoff 25 868.00000 864.41778 0.41% 22.8 20s 6012 1689 865.49524 26 91 868.00000 864.81737 0.37% 21.9 25s 7714 1938 865.96552 24 94 868.00000 865.05780 0.34% 21.4 30s 9501 2008 866.48828 21 89 868.00000 865.31954 0.31% 21.0 35s 11499 1916 866.94286 26 106 868.00000 865.56250 0.28% 20.6 40s 14115 1485 cutoff 25 868.00000 865.90645 0.24% 20.1 45s 16685 441 cutoff 21 868.00000 866.51313 0.17% 19.5 50s Cutting planes: Gomory: 6 Zero half: 8 Explored 17257 nodes (330882 simplex iterations) in 50.82 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(6, 61), (6, 94), (9, 47), (9, 84), (12, 64), (12, 65), (15, 43), (15, 44), (16, 44), (16, 58), (18, 46), (18, 85), (19, 61), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 99), (38, 101), (40, 68), (42, 58), (43, 88), (46, 84), (47, 48), (50, 65), (57, 76), (60, 93), (60, 100), (62, 85), (62, 86), (64, 91), (66, 72), (67, 72), (73, 75), (73, 76), (86, 101), (88, 98), (93, 96), (94, 99), (96, 98), (97, 100)] adding cut for [(3, 74), (4, 78), (4, 80), (5, 22), (5, 55), (8, 83), (8, 89), (10, 52), (10, 82), (11, 63), (11, 71), (20, 49), (20, 63), (22, 74), (31, 52), (31, 71), (32, 89), (34, 80), (34, 82), (49, 83), (55, 81), (69, 78), (69, 81)] adding cut for [(17, 92), (17, 87), (39, 45), (39, 87), (45, 92)] Optimize a model with 491 rows, 5050 columns and 244231 nonzeros Presolve time: 0.17s Presolved: 491 rows, 5050 columns, 244231 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 390 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 881.0000000 858.45843 2.56% - 0s H 0 0 878.0000000 858.45843 2.23% - 0s 0 0 859.49507 0 119 878.00000 859.49507 2.11% - 0s 0 0 859.49507 0 102 878.00000 859.49507 2.11% - 1s 0 0 859.62979 0 116 878.00000 859.62979 2.09% - 1s 0 0 860.06343 0 118 878.00000 860.06343 2.04% - 1s 0 0 860.09458 0 129 878.00000 860.09458 2.04% - 1s 0 0 860.10612 0 132 878.00000 860.10612 2.04% - 1s 0 0 860.11096 0 131 878.00000 860.11096 2.04% - 1s 0 0 860.12787 0 135 878.00000 860.12787 2.04% - 1s 0 0 860.13571 0 134 878.00000 860.13571 2.03% - 1s 0 0 860.15252 0 128 878.00000 860.15252 2.03% - 1s 0 0 860.15934 0 135 878.00000 860.15934 2.03% - 2s 0 0 860.19695 0 129 878.00000 860.19695 2.03% - 2s 0 0 860.25641 0 132 878.00000 860.25641 2.02% - 2s 0 0 860.25641 0 136 878.00000 860.25641 2.02% - 2s 0 0 860.25900 0 130 878.00000 860.25900 2.02% - 2s 0 0 860.26852 0 134 878.00000 860.26852 2.02% - 2s 0 0 860.26852 0 138 878.00000 860.26852 2.02% - 2s 0 0 860.27313 0 134 878.00000 860.27313 2.02% - 2s 0 0 860.28502 0 141 878.00000 860.28502 2.02% - 2s 0 0 860.29180 0 140 878.00000 860.29180 2.02% - 2s 0 0 860.29388 0 137 878.00000 860.29388 2.02% - 3s 0 0 860.29408 0 141 878.00000 860.29408 2.02% - 3s 0 0 860.29903 0 139 878.00000 860.29903 2.02% - 3s 0 0 860.30390 0 143 878.00000 860.30390 2.02% - 3s 0 0 860.30834 0 145 878.00000 860.30834 2.01% - 3s 0 0 860.31065 0 142 878.00000 860.31065 2.01% - 3s 0 0 860.31065 0 146 878.00000 860.31065 2.01% - 3s 0 0 860.31148 0 141 878.00000 860.31148 2.01% - 3s 0 0 860.31206 0 147 878.00000 860.31206 2.01% - 3s 0 0 860.31206 0 147 878.00000 860.31206 2.01% - 4s H 0 0 875.0000000 860.31206 1.68% - 4s 0 2 860.31253 0 147 875.00000 860.31253 1.68% - 4s H 70 70 874.0000000 860.70446 1.52% 22.2 5s * 121 109 77 873.0000000 860.70446 1.41% 21.3 5s * 229 147 34 869.0000000 860.97056 0.92% 21.7 5s 776 488 866.23064 30 102 869.00000 862.14481 0.79% 24.8 10s * 780 451 32 868.0000000 862.14481 0.67% 24.7 10s 2025 730 866.81538 26 99 868.00000 863.29265 0.54% 24.8 15s 3521 1287 865.76276 26 106 868.00000 863.87979 0.47% 23.4 20s 5175 1727 866.24270 25 117 868.00000 864.29988 0.43% 22.7 25s 6904 2118 866.82077 21 92 868.00000 864.58517 0.39% 22.2 30s 8569 2383 cutoff 22 868.00000 864.82234 0.37% 21.7 35s 10121 2593 cutoff 22 868.00000 864.99877 0.35% 21.4 40s 12319 2806 866.37674 32 100 868.00000 865.21406 0.32% 20.9 45s 13909 2780 866.19344 26 104 868.00000 865.36981 0.30% 20.8 50s 16227 2658 cutoff 28 868.00000 865.57591 0.28% 20.4 55s 18522 2314 866.32005 20 96 868.00000 865.80031 0.25% 20.2 60s 20936 1617 866.76141 24 99 868.00000 866.09524 0.22% 19.9 65s 23597 155 866.91592 30 101 868.00000 866.72131 0.15% 19.2 70s Cutting planes: Gomory: 6 MIR: 1 Zero half: 8 Mod-K: 1 Explored 23771 nodes (454858 simplex iterations) in 70.21 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 26), (5, 40), (6, 61), (6, 85), (9, 46), (9, 47), (12, 20), (12, 64), (14, 88), (15, 44), (15, 45), (16, 42), (16, 44), (17, 87), (17, 92), (18, 62), (18, 85), (20, 65), (22, 74), (23, 75), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 80), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (43, 58), (43, 88), (46, 84), (47, 48), (50, 65), (55, 56), (57, 76), (61, 84), (62, 86), (64, 91), (66, 72), (67, 72), (73, 74), (73, 75), (79, 80), (86, 99), (92, 101)] adding cut for [(19, 83), (34, 82), (34, 51), (4, 69), (4, 78), (69, 81), (8, 89), (8, 49), (10, 82), (10, 52), (11, 71), (11, 63), (77, 78), (13, 81), (51, 77), (21, 52), (21, 31), (49, 83), (63, 89), (31, 71)] Optimize a model with 493 rows, 5050 columns and 246152 nonzeros Presolve time: 0.17s Presolved: 493 rows, 5050 columns, 246152 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584584e+02, 358 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45843 0 101 3624.00000 858.45843 76.3% - 0s Another try with MIP start H 0 0 878.0000000 858.45843 2.23% - 0s 0 0 859.49507 0 116 878.00000 859.49507 2.11% - 0s 0 0 859.49507 0 101 878.00000 859.49507 2.11% - 1s 0 0 859.72312 0 120 878.00000 859.72312 2.08% - 1s 0 0 859.84759 0 118 878.00000 859.84759 2.07% - 1s 0 0 859.88476 0 126 878.00000 859.88476 2.06% - 1s 0 0 860.11415 0 122 878.00000 860.11415 2.04% - 1s 0 0 860.14678 0 119 878.00000 860.14678 2.03% - 1s 0 0 860.14869 0 124 878.00000 860.14869 2.03% - 1s 0 0 860.15144 0 131 878.00000 860.15144 2.03% - 1s 0 0 860.17035 0 128 878.00000 860.17035 2.03% - 1s 0 0 860.17035 0 132 878.00000 860.17035 2.03% - 2s 0 0 860.17035 0 131 878.00000 860.17035 2.03% - 2s 0 0 860.17035 0 135 878.00000 860.17035 2.03% - 2s 0 0 860.18317 0 135 878.00000 860.18317 2.03% - 2s 0 0 860.18317 0 140 878.00000 860.18317 2.03% - 2s 0 0 860.18656 0 133 878.00000 860.18656 2.03% - 2s 0 0 860.18656 0 136 878.00000 860.18656 2.03% - 2s 0 0 860.18656 0 137 878.00000 860.18656 2.03% - 2s 0 0 860.18656 0 140 878.00000 860.18656 2.03% - 2s 0 0 860.18656 0 140 878.00000 860.18656 2.03% - 3s 0 2 860.21495 0 140 878.00000 860.21495 2.03% - 3s 322 290 871.35294 57 53 878.00000 861.05554 1.93% 23.1 5s * 550 151 28 868.0000000 861.36223 0.76% 22.8 5s 916 290 864.57032 18 99 868.00000 861.62053 0.73% 24.5 10s 2403 697 866.54561 21 118 868.00000 863.52437 0.52% 23.3 15s 3952 1062 864.45452 23 104 868.00000 864.23348 0.43% 22.5 20s 5478 1299 866.65152 32 93 868.00000 864.62584 0.39% 22.3 25s 7179 1399 866.79548 22 102 868.00000 865.07658 0.34% 21.9 30s 8762 1347 865.97884 26 105 868.00000 865.40127 0.30% 21.6 35s 10727 1157 866.55435 24 76 868.00000 865.77806 0.26% 21.0 40s 12936 489 866.71215 27 122 868.00000 866.34783 0.19% 20.3 45s Cutting planes: Gomory: 11 MIR: 1 Zero half: 8 Explored 13665 nodes (271498 simplex iterations) in 46.13 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(4, 69), (4, 78), (5, 26), (5, 40), (10, 52), (10, 82), (11, 63), (11, 71), (12, 20), (12, 63), (13, 81), (20, 48), (21, 33), (21, 67), (22, 74), (23, 75), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 80), (31, 52), (31, 71), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (40, 68), (50, 65), (51, 77), (55, 56), (57, 76), (64, 65), (64, 91), (66, 72), (67, 72), (69, 81), (73, 74), (73, 75), (77, 78), (79, 80)] adding cut for [(97, 100), (6, 86), (6, 61), (39, 87), (60, 99), (60, 94), (7, 97), (45, 92), (15, 39), (15, 45), (17, 87), (17, 62), (94, 100), (38, 99), (38, 101), (92, 101), (62, 86)] Optimize a model with 495 rows, 5050 columns and 247433 nonzeros Presolve time: 0.17s Presolved: 495 rows, 5050 columns, 247433 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584591e+02, 361 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45907 0 102 3624.00000 858.45907 76.3% - 0s Another try with MIP start H 0 0 886.0000000 858.45907 3.11% - 0s H 0 0 880.0000000 858.45907 2.45% - 0s 0 0 859.65327 0 116 880.00000 859.65327 2.31% - 0s 0 0 859.65327 0 102 880.00000 859.65327 2.31% - 1s 0 0 859.82973 0 117 880.00000 859.82973 2.29% - 1s 0 0 860.19042 0 126 880.00000 860.19042 2.25% - 1s 0 0 860.19042 0 131 880.00000 860.19042 2.25% - 1s 0 0 860.19042 0 129 880.00000 860.19042 2.25% - 1s 0 0 860.26841 0 128 880.00000 860.26841 2.24% - 2s 0 0 860.26841 0 132 880.00000 860.26841 2.24% - 2s 0 0 860.27452 0 128 880.00000 860.27452 2.24% - 2s 0 0 860.27452 0 132 880.00000 860.27452 2.24% - 2s 0 0 860.27452 0 131 880.00000 860.27452 2.24% - 2s 0 0 860.27452 0 135 880.00000 860.27452 2.24% - 2s 0 0 860.28522 0 128 880.00000 860.28522 2.24% - 3s H 0 0 874.0000000 860.28522 1.57% - 3s 0 0 860.28522 0 132 874.00000 860.28522 1.57% - 3s 0 2 861.10672 0 132 874.00000 861.10672 1.48% - 4s H 1 2 872.0000000 861.10672 1.25% 0.0 4s 2 3 861.10672 0 116 872.00000 861.10672 1.25% 0.0 5s * 206 138 51 871.0000000 861.81572 1.05% 29.9 9s H 242 151 870.0000000 861.84567 0.94% 30.8 9s 297 196 866.63587 26 93 870.00000 862.61364 0.85% 30.4 10s * 323 178 36 869.0000000 862.61364 0.73% 29.9 10s 720 390 864.00077 31 108 869.00000 863.14065 0.67% 28.4 15s * 1311 424 45 868.0000000 863.42559 0.53% 27.6 17s 2045 529 866.18600 36 104 868.00000 864.13462 0.45% 26.2 20s 3517 724 866.06211 38 94 868.00000 864.89952 0.36% 24.5 25s 5034 714 866.52032 37 116 868.00000 865.43312 0.30% 23.5 30s 6661 461 cutoff 42 868.00000 866.03628 0.23% 22.5 35s Cutting planes: Gomory: 8 MIR: 3 Zero half: 8 Explored 7441 nodes (162527 simplex iterations) in 37.01 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 56), (5, 73), (6, 61), (6, 100), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (39, 45), (39, 87), (40, 68), (43, 44), (46, 84), (57, 76), (61, 84), (62, 85), (73, 74), (75, 76), (97, 100)] adding cut for [(2, 51), (2, 70), (9, 47), (9, 83), (10, 36), (10, 52), (11, 33), (11, 71), (19, 83), (21, 31), (21, 67), (31, 71), (33, 91), (34, 51), (34, 82), (36, 66), (37, 48), (37, 50), (47, 48), (50, 65), (52, 82), (64, 65), (64, 91), (66, 72), (67, 72)] adding cut for [(99, 101), (38, 99), (38, 93), (60, 96), (60, 94), (14, 88), (86, 92), (86, 94), (88, 98), (92, 101), (93, 98), (95, 96)] adding cut for [(8, 49), (8, 89), (12, 20), (12, 63), (20, 49), (63, 89)] Optimize a model with 499 rows, 5050 columns and 248379 nonzeros Presolve time: 0.17s Presolved: 499 rows, 5050 columns, 248379 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584591e+02, 361 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45907 0 102 3624.00000 858.45907 76.3% - 0s Another try with MIP start H 0 0 880.0000000 858.45907 2.45% - 0s 0 0 859.65327 0 116 880.00000 859.65327 2.31% - 0s 0 0 859.65327 0 103 880.00000 859.65327 2.31% - 1s 0 0 859.85957 0 119 880.00000 859.85957 2.29% - 1s 0 0 860.17108 0 128 880.00000 860.17108 2.25% - 1s 0 0 860.17108 0 131 880.00000 860.17108 2.25% - 1s 0 0 860.23165 0 128 880.00000 860.23165 2.25% - 1s 0 0 860.35867 0 128 880.00000 860.35867 2.23% - 1s 0 0 860.35867 0 132 880.00000 860.35867 2.23% - 1s 0 0 860.36180 0 132 880.00000 860.36180 2.23% - 2s 0 0 860.36180 0 136 880.00000 860.36180 2.23% - 2s 0 0 860.40282 0 135 880.00000 860.40282 2.23% - 2s 0 0 860.40282 0 138 880.00000 860.40282 2.23% - 2s 0 0 860.40350 0 135 880.00000 860.40350 2.23% - 2s 0 0 860.40350 0 138 880.00000 860.40350 2.23% - 2s 0 0 860.40410 0 138 880.00000 860.40410 2.23% - 3s 0 0 860.40410 0 138 880.00000 860.40410 2.23% - 3s H 0 0 879.0000000 860.40410 2.12% - 3s 0 2 860.40508 0 138 879.00000 860.40508 2.12% - 3s 256 229 868.51659 21 97 879.00000 861.13263 2.03% 23.4 5s * 320 261 69 877.0000000 861.13263 1.81% 22.3 5s * 501 379 105 876.0000000 861.24436 1.68% 21.5 5s * 579 332 51 873.0000000 861.26951 1.34% 21.8 5s * 671 368 54 872.0000000 861.46758 1.21% 21.7 6s H 780 188 868.0000000 861.72741 0.72% 21.2 6s 918 258 861.89404 17 128 868.00000 861.89404 0.70% 21.9 10s 2352 747 864.75908 26 96 868.00000 863.43143 0.53% 23.0 15s 3769 1219 cutoff 30 868.00000 863.99500 0.46% 22.7 20s 5151 1553 cutoff 34 868.00000 864.33190 0.42% 22.5 25s 6834 1885 865.09850 25 107 868.00000 864.65568 0.39% 22.2 30s 8238 2056 866.89936 29 100 868.00000 864.85341 0.36% 22.1 35s 9950 2190 866.67857 31 101 868.00000 865.04819 0.34% 21.8 40s 12089 2212 866.84610 28 105 868.00000 865.30033 0.31% 21.4 45s 14214 1976 866.78335 29 102 868.00000 865.56240 0.28% 21.3 50s 16576 1460 cutoff 31 868.00000 865.86501 0.25% 21.0 55s 19085 451 cutoff 32 868.00000 866.38272 0.19% 20.5 60s Cutting planes: Gomory: 7 MIR: 3 Zero half: 10 Explored 19703 nodes (399192 simplex iterations) in 61.07 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(9, 46), (9, 47), (10, 36), (10, 52), (15, 39), (15, 43), (16, 44), (16, 58), (17, 87), (17, 92), (18, 46), (18, 85), (21, 33), (21, 67), (22, 41), (22, 74), (23, 42), (23, 75), (33, 91), (34, 51), (34, 82), (36, 72), (37, 48), (37, 50), (38, 99), (38, 101), (39, 45), (42, 58), (43, 44), (45, 87), (47, 48), (50, 65), (51, 77), (52, 82), (62, 85), (62, 86), (64, 65), (64, 91), (66, 67), (66, 72), (74, 75), (86, 99), (92, 101)] adding cut for [(35, 79), (4, 78), (4, 80), (69, 78), (69, 81), (40, 68), (73, 76), (79, 80), (57, 76), (24, 68), (24, 57), (55, 81), (25, 56), (25, 30), (26, 40), (26, 56), (30, 35), (5, 73), (5, 55)] Optimize a model with 501 rows, 5050 columns and 249496 nonzeros Presolve time: 0.17s Presolved: 501 rows, 5050 columns, 249496 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584591e+02, 361 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45907 0 102 3624.00000 858.45907 76.3% - 0s Another try with MIP start H 0 0 874.0000000 858.45907 1.78% - 0s 0 0 859.65327 0 116 874.00000 859.65327 1.64% - 0s 0 0 859.65327 0 102 874.00000 859.65327 1.64% - 1s 0 0 859.81064 0 111 874.00000 859.81064 1.62% - 1s 0 0 860.09498 0 132 874.00000 860.09498 1.59% - 1s 0 0 860.10894 0 139 874.00000 860.10894 1.59% - 1s 0 0 860.35056 0 129 874.00000 860.35056 1.56% - 1s 0 0 860.35056 0 133 874.00000 860.35056 1.56% - 1s 0 0 860.35056 0 135 874.00000 860.35056 1.56% - 1s 0 0 860.35749 0 136 874.00000 860.35749 1.56% - 2s 0 0 860.36639 0 138 874.00000 860.36639 1.56% - 2s 0 0 860.36639 0 140 874.00000 860.36639 1.56% - 2s 0 0 860.36639 0 140 874.00000 860.36639 1.56% - 2s 0 2 860.38177 0 140 874.00000 860.38177 1.56% - 2s * 107 88 60 872.0000000 860.82604 1.28% 29.3 3s * 244 160 62 870.0000000 860.85624 1.05% 23.8 3s * 444 239 19 869.0000000 861.98659 0.81% 24.5 3s 601 317 865.80000 15 116 869.00000 862.15789 0.79% 25.0 5s H 640 326 868.0000000 862.15789 0.67% 26.4 7s 1265 420 866.50000 27 97 868.00000 863.36444 0.53% 26.1 10s 2626 748 866.06281 22 114 868.00000 864.44520 0.41% 24.2 15s 4135 979 cutoff 22 868.00000 864.96430 0.35% 23.0 20s 5655 1001 866.66867 23 80 868.00000 865.35550 0.30% 22.3 25s 7273 774 866.12121 19 92 868.00000 865.80000 0.25% 21.7 30s Cutting planes: Gomory: 10 MIR: 1 Zero half: 10 Explored 8991 nodes (185981 simplex iterations) in 34.62 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (6, 61), (6, 85), (9, 46), (9, 47), (10, 36), (10, 52), (13, 81), (15, 39), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 62), (18, 85), (21, 31), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 35), (31, 33), (33, 91), (34, 51), (34, 82), (35, 79), (36, 66), (37, 48), (37, 50), (39, 87), (40, 68), (43, 44), (43, 101), (45, 92), (46, 84), (47, 48), (50, 65), (51, 77), (52, 82), (55, 56), (57, 76), (61, 84), (64, 65), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (75, 76), (79, 80), (92, 101)] adding cut for [(96, 98), (97, 100), (38, 99), (38, 93), (14, 88), (86, 99), (86, 94), (88, 98), (60, 96), (60, 93), (94, 100), (95, 97)] Optimize a model with 503 rows, 5050 columns and 251404 nonzeros Presolve time: 0.17s Presolved: 503 rows, 5050 columns, 251404 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584591e+02, 375 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45907 0 102 3624.00000 858.45907 76.3% - 0s Another try with MIP start H 0 0 880.0000000 858.45907 2.45% - 0s 0 0 859.65327 0 116 880.00000 859.65327 2.31% - 0s 0 0 859.65327 0 102 880.00000 859.65327 2.31% - 1s 0 0 859.81064 0 107 880.00000 859.81064 2.29% - 1s 0 0 860.08462 0 127 880.00000 860.08462 2.26% - 1s 0 0 860.31375 0 129 880.00000 860.31375 2.24% - 1s 0 0 860.31803 0 132 880.00000 860.31803 2.24% - 1s 0 0 860.32239 0 129 880.00000 860.32239 2.24% - 1s 0 0 860.32239 0 133 880.00000 860.32239 2.24% - 1s 0 0 860.32938 0 131 880.00000 860.32938 2.24% - 2s 0 0 860.32938 0 135 880.00000 860.32938 2.24% - 2s 0 0 860.33772 0 134 880.00000 860.33772 2.23% - 2s 0 0 860.33772 0 139 880.00000 860.33772 2.23% - 2s 0 0 860.35361 0 131 880.00000 860.35361 2.23% - 3s 0 0 860.36402 0 134 880.00000 860.36402 2.23% - 3s 0 0 860.37560 0 137 880.00000 860.37560 2.23% - 3s 0 0 860.39643 0 133 880.00000 860.39643 2.23% - 3s 0 0 860.40758 0 139 880.00000 860.40758 2.23% - 3s 0 0 860.40758 0 143 880.00000 860.40758 2.23% - 3s 0 0 860.42716 0 140 880.00000 860.42716 2.22% - 3s 0 0 860.42716 0 144 880.00000 860.42716 2.22% - 3s 0 0 860.42942 0 141 880.00000 860.42942 2.22% - 3s 0 0 860.42942 0 145 880.00000 860.42942 2.22% - 4s 0 0 860.44497 0 147 880.00000 860.44497 2.22% - 4s 0 0 860.44497 0 151 880.00000 860.44497 2.22% - 4s 0 0 860.45004 0 151 880.00000 860.45004 2.22% - 4s 0 0 860.45153 0 146 880.00000 860.45153 2.22% - 4s 0 0 860.45153 0 150 880.00000 860.45153 2.22% - 4s 0 0 860.45579 0 148 880.00000 860.45579 2.22% - 4s 0 0 860.45723 0 150 880.00000 860.45723 2.22% - 4s 0 0 860.45723 0 150 880.00000 860.45723 2.22% - 5s 0 2 860.46092 0 150 880.00000 860.46092 2.22% - 5s * 145 139 91 878.0000000 861.65674 1.86% 25.3 5s * 148 136 92 877.0000000 861.65674 1.75% 25.0 5s * 251 190 70 874.0000000 861.69718 1.41% 23.5 6s * 303 134 42 869.0000000 861.71589 0.84% 23.4 6s 628 337 862.45470 19 124 869.00000 862.45470 0.75% 26.2 10s 1707 653 866.28736 26 109 869.00000 862.71105 0.72% 26.5 15s 3006 1301 865.84118 25 115 869.00000 863.42702 0.64% 24.7 20s * 3410 1244 41 868.0000000 863.64461 0.50% 24.6 22s 4315 1459 865.32405 23 113 868.00000 864.01491 0.46% 24.2 25s 5629 1682 865.84626 31 108 868.00000 864.38974 0.42% 23.6 30s 6894 1818 866.00000 23 79 868.00000 864.73763 0.38% 23.2 35s 8227 1874 866.34709 35 109 868.00000 865.02913 0.34% 22.7 40s 9553 1870 865.41964 28 99 868.00000 865.21739 0.32% 22.2 45s 11129 1774 866.62069 28 84 868.00000 865.47482 0.29% 21.9 50s 13194 1427 866.99241 29 93 868.00000 865.82087 0.25% 21.4 55s 15641 301 cutoff 31 868.00000 866.62613 0.16% 20.5 60s Cutting planes: Gomory: 12 MIR: 2 Zero half: 8 Explored 15997 nodes (324270 simplex iterations) in 60.87 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (3, 42), (3, 58), (4, 78), (4, 80), (6, 61), (6, 94), (9, 46), (9, 47), (12, 20), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (19, 83), (20, 49), (23, 42), (23, 75), (24, 68), (24, 76), (25, 30), (25, 56), (26, 40), (26, 56), (30, 35), (34, 80), (34, 82), (35, 79), (37, 48), (37, 50), (38, 93), (38, 99), (39, 45), (39, 87), (40, 68), (43, 44), (47, 48), (49, 83), (50, 65), (51, 77), (61, 84), (62, 86), (75, 76), (77, 78), (79, 82), (84, 85), (86, 92), (92, 101), (93, 94), (99, 101)] adding cut for [(64, 91), (33, 91), (66, 72), (67, 72), (36, 66), (8, 89), (31, 71), (31, 52), (10, 36), (10, 52), (11, 64), (11, 63), (32, 71), (21, 33), (21, 67), (63, 89)] Optimize a model with 505 rows, 5050 columns and 253136 nonzeros Presolve time: 0.17s Presolved: 505 rows, 5050 columns, 253136 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584591e+02, 345 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45907 0 102 3624.00000 858.45907 76.3% - 0s Another try with MIP start H 0 0 869.0000000 858.45907 1.21% - 0s 0 0 859.81018 0 114 869.00000 859.81018 1.06% - 0s 0 0 859.81018 0 103 869.00000 859.81018 1.06% - 1s 0 0 859.81018 0 115 869.00000 859.81018 1.06% - 1s 0 0 860.05359 0 125 869.00000 860.05359 1.03% - 1s 0 0 860.29477 0 128 869.00000 860.29477 1.00% - 1s 0 0 860.32113 0 135 869.00000 860.32113 1.00% - 1s 0 0 860.33462 0 129 869.00000 860.33462 1.00% - 1s 0 0 860.36411 0 130 869.00000 860.36411 0.99% - 1s 0 0 860.37231 0 137 869.00000 860.37231 0.99% - 1s 0 0 860.37601 0 135 869.00000 860.37601 0.99% - 1s 0 0 860.37613 0 139 869.00000 860.37613 0.99% - 1s 0 0 860.37637 0 140 869.00000 860.37637 0.99% - 1s 0 0 860.44027 0 135 869.00000 860.44027 0.99% - 1s 0 0 860.44027 0 139 869.00000 860.44027 0.99% - 2s 0 0 860.45262 0 136 869.00000 860.45262 0.98% - 2s 0 0 860.45262 0 140 869.00000 860.45262 0.98% - 2s 0 0 860.45577 0 137 869.00000 860.45577 0.98% - 2s 0 0 860.45577 0 141 869.00000 860.45577 0.98% - 2s 0 0 860.49566 0 137 869.00000 860.49566 0.98% - 2s 0 0 860.49566 0 141 869.00000 860.49566 0.98% - 2s 0 0 860.49927 0 138 869.00000 860.49927 0.98% - 2s 0 0 860.49927 0 142 869.00000 860.49927 0.98% - 2s 0 0 860.49958 0 139 869.00000 860.49958 0.98% - 2s 0 0 860.49962 0 145 869.00000 860.49962 0.98% - 2s 0 0 860.51232 0 138 869.00000 860.51232 0.98% - 2s 0 0 860.51232 0 142 869.00000 860.51232 0.98% - 2s 0 0 860.51489 0 141 869.00000 860.51489 0.98% - 3s 0 0 860.51489 0 141 869.00000 860.51489 0.98% - 3s 0 2 860.52184 0 141 869.00000 860.52184 0.98% - 3s 460 313 865.36601 19 113 869.00000 861.83539 0.82% 24.8 5s 951 546 864.41908 16 119 869.00000 862.40720 0.76% 26.6 10s 2294 959 866.20000 24 88 869.00000 863.63194 0.62% 24.7 15s H 3188 1121 868.0000000 863.94339 0.47% 23.9 18s 3686 1246 864.68546 25 104 868.00000 864.22581 0.43% 23.9 20s 5019 1462 866.36287 24 104 868.00000 864.69257 0.38% 23.6 25s 6499 1602 866.17308 20 85 868.00000 865.05064 0.34% 23.0 30s 8009 1593 866.11429 29 99 868.00000 865.32874 0.31% 22.6 35s 9555 1542 866.09091 31 89 868.00000 865.55208 0.28% 22.0 40s 11518 1225 866.28791 21 110 868.00000 865.93289 0.24% 21.4 45s Cutting planes: Gomory: 10 MIR: 2 Zero half: 9 Explored 13945 nodes (282373 simplex iterations) in 49.57 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(2, 70), (2, 71), (3, 42), (3, 58), (5, 26), (5, 40), (6, 61), (6, 100), (9, 46), (9, 47), (11, 63), (11, 64), (12, 20), (12, 65), (13, 81), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (20, 63), (23, 42), (23, 75), (24, 68), (24, 76), (25, 30), (25, 55), (26, 56), (30, 69), (31, 33), (31, 71), (33, 91), (37, 48), (37, 50), (38, 93), (38, 99), (39, 45), (39, 87), (40, 68), (43, 44), (47, 48), (50, 65), (55, 56), (57, 73), (57, 76), (61, 84), (62, 86), (64, 91), (69, 81), (73, 74), (74, 75), (84, 85), (86, 92), (92, 101), (93, 94), (94, 100), (99, 101)] adding cut for [(66, 72), (35, 79), (35, 36), (4, 78), (4, 80), (10, 82), (10, 52), (77, 78), (79, 80), (34, 51), (34, 82), (67, 72), (21, 67), (21, 52), (36, 66)] Optimize a model with 507 rows, 5050 columns and 255086 nonzeros Presolve time: 0.17s Presolved: 507 rows, 5050 columns, 255086 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584591e+02, 369 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45907 0 102 3624.00000 858.45907 76.3% - 0s Another try with MIP start H 0 0 878.0000000 858.45907 2.23% - 0s 0 0 859.73014 0 119 878.00000 859.73014 2.08% - 0s 0 0 859.73014 0 103 878.00000 859.73014 2.08% - 1s 0 0 859.85957 0 114 878.00000 859.85957 2.07% - 1s 0 0 860.19081 0 129 878.00000 860.19081 2.03% - 1s 0 0 860.19081 0 133 878.00000 860.19081 2.03% - 1s 0 0 860.19414 0 128 878.00000 860.19414 2.03% - 1s 0 0 860.26841 0 125 878.00000 860.26841 2.02% - 2s 0 0 860.27503 0 130 878.00000 860.27503 2.02% - 2s 0 0 860.35419 0 130 878.00000 860.35419 2.01% - 2s 0 0 860.42144 0 134 878.00000 860.42144 2.00% - 2s 0 0 860.42144 0 135 878.00000 860.42144 2.00% - 2s 0 0 860.43395 0 136 878.00000 860.43395 2.00% - 2s 0 0 860.43395 0 137 878.00000 860.43395 2.00% - 2s 0 0 860.44316 0 132 878.00000 860.44316 2.00% - 3s 0 0 860.44316 0 133 878.00000 860.44316 2.00% - 3s 0 0 860.44316 0 136 878.00000 860.44316 2.00% - 3s 0 0 860.44316 0 137 878.00000 860.44316 2.00% - 3s 0 0 860.44316 0 137 878.00000 860.44316 2.00% - 3s 0 2 860.44556 0 137 878.00000 860.44556 2.00% - 3s * 110 95 68 872.0000000 860.84701 1.28% 25.3 4s * 245 174 52 870.0000000 861.43393 0.98% 21.4 4s 399 297 866.53116 21 109 870.00000 861.83086 0.94% 23.5 5s H 605 398 869.0000000 862.09020 0.80% 23.1 6s 938 535 866.76427 22 96 869.00000 862.40241 0.76% 26.0 10s 2331 964 865.08025 25 109 869.00000 863.74497 0.60% 23.6 15s * 2370 783 36 868.0000000 863.75269 0.49% 23.5 15s 3837 1274 866.58333 27 79 868.00000 864.33596 0.42% 22.6 20s 5428 1640 865.89090 23 106 868.00000 864.69855 0.38% 21.9 25s 6921 1774 cutoff 26 868.00000 865.00000 0.35% 21.7 30s 8429 1833 866.51351 22 103 868.00000 865.23750 0.32% 21.3 35s 9970 1756 865.84823 20 101 868.00000 865.48491 0.29% 21.1 40s 12165 1439 866.27586 24 99 868.00000 865.86441 0.25% 20.8 45s 14595 346 866.58333 25 90 868.00000 866.54286 0.17% 20.1 50s Cutting planes: Gomory: 10 MIR: 1 Zero half: 9 Mod-K: 1 Explored 15009 nodes (296915 simplex iterations) in 50.80 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 74), (5, 55), (5, 56), (6, 61), (6, 100), (9, 46), (9, 47), (12, 64), (12, 65), (18, 46), (18, 85), (19, 84), (21, 31), (21, 67), (22, 73), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 79), (31, 33), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (40, 68), (47, 48), (50, 65), (57, 76), (61, 84), (62, 85), (62, 86), (64, 91), (66, 72), (67, 72), (73, 75), (74, 75), (86, 94), (94, 100)] adding cut for [(99, 101), (38, 99), (38, 60), (39, 45), (60, 93), (43, 88), (43, 58), (45, 87), (15, 39), (15, 44), (16, 44), (16, 58), (17, 87), (17, 92), (88, 98), (92, 101), (93, 98)] Optimize a model with 509 rows, 5050 columns and 256303 nonzeros Presolve time: 0.17s Presolved: 509 rows, 5050 columns, 256303 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584591e+02, 380 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45907 0 102 3624.00000 858.45907 76.3% - 0s Another try with MIP start H 0 0 873.0000000 858.45907 1.67% - 0s 0 0 859.73014 0 119 873.00000 859.73014 1.52% - 0s 0 0 859.73014 0 102 873.00000 859.73014 1.52% - 1s 0 0 859.88663 0 116 873.00000 859.88663 1.50% - 1s 0 0 860.31852 0 127 873.00000 860.31852 1.45% - 1s 0 0 860.36769 0 132 873.00000 860.36769 1.45% - 1s 0 0 860.38747 0 129 873.00000 860.38747 1.44% - 1s 0 0 860.38940 0 127 873.00000 860.38940 1.44% - 1s 0 0 860.38940 0 131 873.00000 860.38940 1.44% - 1s 0 0 860.39021 0 130 873.00000 860.39021 1.44% - 1s 0 0 860.39021 0 134 873.00000 860.39021 1.44% - 2s 0 0 860.39160 0 131 873.00000 860.39160 1.44% - 2s 0 0 860.39160 0 135 873.00000 860.39160 1.44% - 2s 0 0 860.39160 0 135 873.00000 860.39160 1.44% - 2s 0 2 860.39195 0 135 873.00000 860.39195 1.44% - 2s H 600 406 871.0000000 861.54619 1.09% 22.4 4s 601 407 863.82000 15 119 871.00000 861.54619 1.09% 22.3 5s H 616 395 870.0000000 861.54619 0.97% 22.9 7s 1055 543 866.81356 26 107 870.00000 862.18249 0.90% 25.3 10s H 1142 479 869.0000000 862.57136 0.74% 25.0 10s 2513 1069 865.90625 29 107 869.00000 863.65896 0.61% 23.9 15s * 3483 1265 46 868.0000000 864.00420 0.46% 23.7 18s 3606 1311 867.00000 34 130 868.00000 864.05696 0.45% 23.6 20s 4753 1414 865.17241 40 107 868.00000 864.10777 0.45% 24.2 25s 6235 1256 866.88506 41 106 868.00000 864.75062 0.37% 23.9 30s 7787 998 866.87764 40 99 868.00000 865.20182 0.32% 23.4 35s 9348 969 866.36000 46 87 868.00000 865.54384 0.28% 23.0 40s 11347 641 866.81667 50 80 868.00000 866.05785 0.22% 22.4 45s Cutting planes: Gomory: 9 MIR: 3 Zero half: 11 Explored 12654 nodes (276521 simplex iterations) in 47.84 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(5, 27), (5, 57), (6, 61), (6, 85), (9, 46), (9, 47), (10, 52), (10, 72), (18, 46), (18, 85), (19, 84), (21, 31), (21, 52), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 79), (31, 33), (33, 91), (35, 36), (35, 79), (36, 66), (37, 47), (37, 50), (40, 68), (50, 65), (55, 56), (61, 84), (64, 65), (64, 91), (66, 67), (67, 72)] adding cut for [(7, 97), (15, 39), (15, 44), (16, 43), (16, 44), (17, 62), (17, 87), (38, 96), (38, 99), (39, 45), (43, 88), (45, 87), (60, 93), (60, 94), (62, 86), (86, 92), (88, 98), (92, 101), (93, 98), (94, 100), (95, 96), (97, 100), (99, 101)] Optimize a model with 511 rows, 5050 columns and 257209 nonzeros Presolve time: 0.18s Presolved: 511 rows, 5050 columns, 257209 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584591e+02, 380 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45907 0 102 3624.00000 858.45907 76.3% - 0s Another try with MIP start H 0 0 871.0000000 858.45907 1.44% - 0s 0 0 859.73014 0 119 871.00000 859.73014 1.29% - 0s 0 0 859.73014 0 102 871.00000 859.73014 1.29% - 1s 0 0 859.82973 0 117 871.00000 859.82973 1.28% - 1s 0 0 860.31852 0 121 871.00000 860.31852 1.23% - 1s 0 0 860.31852 0 128 871.00000 860.31852 1.23% - 1s 0 0 860.36769 0 124 871.00000 860.36769 1.22% - 1s 0 0 860.36769 0 127 871.00000 860.36769 1.22% - 1s 0 0 860.36769 0 130 871.00000 860.36769 1.22% - 1s 0 0 860.36769 0 133 871.00000 860.36769 1.22% - 1s 0 0 860.38747 0 125 871.00000 860.38747 1.22% - 2s 0 0 860.38747 0 130 871.00000 860.38747 1.22% - 2s 0 0 860.38863 0 126 871.00000 860.38863 1.22% - 2s 0 0 860.38940 0 125 871.00000 860.38940 1.22% - 2s 0 0 860.38940 0 128 871.00000 860.38940 1.22% - 2s 0 0 860.38940 0 128 871.00000 860.38940 1.22% - 2s 0 0 860.38940 0 132 871.00000 860.38940 1.22% - 2s 0 0 860.38940 0 132 871.00000 860.38940 1.22% - 2s 0 2 860.42348 0 132 871.00000 860.42348 1.21% - 2s H 111 83 870.0000000 860.74734 1.06% 22.0 3s H 600 375 869.0000000 861.94905 0.81% 21.0 5s 1012 548 867.42188 35 96 869.00000 862.60948 0.74% 24.8 10s 2313 1044 867.70213 44 82 869.00000 863.76210 0.60% 23.0 15s 3843 1748 866.62500 40 89 869.00000 864.23386 0.55% 22.3 20s 5231 2330 867.39556 33 114 869.00000 864.54637 0.51% 22.0 25s * 5481 1926 34 868.0000000 864.58513 0.39% 21.9 25s 6792 2090 865.85606 23 100 868.00000 864.87611 0.36% 21.7 30s 8211 2202 866.08081 31 98 868.00000 865.09701 0.33% 21.5 35s 9794 2239 866.42748 29 114 868.00000 865.34615 0.31% 21.3 40s 11512 2106 866.11269 27 111 868.00000 865.59233 0.28% 21.2 45s 13413 1797 866.96875 33 95 868.00000 865.87012 0.25% 21.0 50s 15371 1144 cutoff 32 868.00000 866.23978 0.20% 20.7 55s Cutting planes: Gomory: 10 MIR: 2 Zero half: 11 Mod-K: 1 Explored 17014 nodes (338170 simplex iterations) in 57.74 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(3, 88), (4, 78), (4, 80), (11, 63), (11, 64), (15, 39), (15, 43), (16, 44), (16, 58), (17, 87), (17, 92), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (32, 89), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (38, 93), (38, 99), (39, 45), (40, 68), (42, 58), (43, 44), (45, 87), (57, 76), (60, 93), (60, 96), (63, 89), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (79, 80), (88, 98), (92, 101), (96, 98), (99, 101)] adding cut for [(6, 61), (6, 85), (8, 53), (8, 83), (9, 46), (9, 47), (12, 20), (12, 65), (18, 62), (18, 85), (20, 49), (37, 48), (37, 50), (46, 84), (47, 48), (49, 83), (50, 65), (61, 84), (62, 86), (86, 94), (94, 100), (97, 100)] Optimize a model with 513 rows, 5050 columns and 258590 nonzeros Presolve time: 0.18s Presolved: 513 rows, 5050 columns, 258590 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584591e+02, 345 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45907 0 102 3624.00000 858.45907 76.3% - 0s Another try with MIP start H 0 0 880.0000000 858.45907 2.45% - 0s 0 0 859.81018 0 113 880.00000 859.81018 2.29% - 0s 0 0 859.81018 0 103 880.00000 859.81018 2.29% - 1s 0 0 859.85964 0 115 880.00000 859.85964 2.29% - 1s 0 0 860.31852 0 129 880.00000 860.31852 2.24% - 1s 0 0 860.36769 0 129 880.00000 860.36769 2.23% - 1s 0 0 860.36855 0 135 880.00000 860.36855 2.23% - 1s 0 0 860.38010 0 130 880.00000 860.38010 2.23% - 2s 0 0 860.38010 0 134 880.00000 860.38010 2.23% - 2s 0 0 860.38374 0 132 880.00000 860.38374 2.23% - 2s 0 0 860.42630 0 136 880.00000 860.42630 2.22% - 2s 0 0 860.42640 0 142 880.00000 860.42640 2.22% - 2s 0 0 860.42861 0 135 880.00000 860.42861 2.22% - 2s 0 0 860.42958 0 139 880.00000 860.42958 2.22% - 2s 0 0 860.43509 0 141 880.00000 860.43509 2.22% - 2s 0 0 860.44453 0 137 880.00000 860.44453 2.22% - 2s 0 0 860.44650 0 138 880.00000 860.44650 2.22% - 3s 0 0 860.44727 0 141 880.00000 860.44727 2.22% - 3s 0 0 860.44767 0 141 880.00000 860.44767 2.22% - 3s 0 0 860.44767 0 140 880.00000 860.44767 2.22% - 3s 0 2 860.45021 0 140 880.00000 860.45021 2.22% - 3s * 96 90 65 871.0000000 861.37017 1.11% 24.5 4s 273 228 861.68257 2 126 871.00000 861.64062 1.07% 21.8 5s * 446 328 25 870.0000000 861.95294 0.92% 21.6 5s H 605 382 869.0000000 862.27437 0.77% 20.7 7s 768 445 863.99777 18 110 869.00000 862.27437 0.77% 22.9 10s * 905 452 43 868.0000000 862.27437 0.66% 23.6 10s 1914 631 865.26954 23 115 868.00000 863.67498 0.50% 22.9 15s 3287 1042 866.91150 32 86 868.00000 864.35629 0.42% 21.8 20s 4782 1332 866.11838 22 86 868.00000 864.82301 0.37% 21.2 25s 6209 1484 865.97718 30 98 868.00000 865.19452 0.32% 20.7 30s 7797 1443 cutoff 33 868.00000 865.53333 0.28% 20.3 35s 9433 1161 866.50000 26 50 868.00000 865.88000 0.24% 20.0 40s 11583 126 cutoff 27 868.00000 866.66667 0.15% 19.1 45s Cutting planes: Gomory: 11 MIR: 1 Zero half: 9 Explored 11741 nodes (223327 simplex iterations) in 45.24 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 57), (9, 46), (9, 47), (12, 64), (12, 65), (15, 39), (15, 43), (16, 44), (16, 58), (17, 45), (17, 87), (18, 46), (18, 87), (21, 31), (21, 67), (22, 74), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 40), (26, 56), (30, 79), (31, 33), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (39, 45), (40, 68), (43, 44), (47, 48), (50, 65), (55, 56), (64, 91), (66, 72), (67, 72), (73, 74), (73, 75), (75, 76)] adding cut for [(97, 100), (6, 85), (6, 61), (60, 96), (60, 93), (94, 99), (94, 100), (93, 98), (19, 84), (86, 92), (88, 98), (38, 99), (38, 101), (92, 101), (61, 84), (62, 85), (62, 86), (95, 96), (95, 97)] Optimize a model with 515 rows, 5050 columns and 259861 nonzeros Presolve time: 0.18s Presolved: 515 rows, 5050 columns, 259861 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584591e+02, 345 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45907 0 102 3624.00000 858.45907 76.3% - 0s Another try with MIP start H 0 0 880.0000000 858.45907 2.45% - 0s 0 0 859.81018 0 114 880.00000 859.81018 2.29% - 0s 0 0 859.81018 0 103 880.00000 859.81018 2.29% - 1s 0 0 859.85964 0 114 880.00000 859.85964 2.29% - 1s 0 0 860.31852 0 128 880.00000 860.31852 2.24% - 1s 0 0 860.36769 0 128 880.00000 860.36769 2.23% - 1s 0 0 860.36855 0 134 880.00000 860.36855 2.23% - 1s 0 0 860.38010 0 129 880.00000 860.38010 2.23% - 2s 0 0 860.38010 0 133 880.00000 860.38010 2.23% - 2s 0 0 860.38390 0 132 880.00000 860.38390 2.23% - 2s 0 0 860.38390 0 136 880.00000 860.38390 2.23% - 2s 0 0 860.38624 0 136 880.00000 860.38624 2.23% - 2s 0 0 860.43182 0 138 880.00000 860.43182 2.22% - 3s 0 0 860.44133 0 134 880.00000 860.44133 2.22% - 3s 0 0 860.44481 0 137 880.00000 860.44481 2.22% - 3s 0 0 860.49413 0 129 880.00000 860.49413 2.22% - 3s 0 0 860.51079 0 135 880.00000 860.51079 2.21% - 3s 0 0 860.51080 0 139 880.00000 860.51080 2.21% - 3s 0 0 860.56123 0 134 880.00000 860.56123 2.21% - 3s 0 0 860.56203 0 138 880.00000 860.56203 2.21% - 3s 0 0 860.56203 0 142 880.00000 860.56203 2.21% - 3s 0 0 860.56749 0 140 880.00000 860.56749 2.21% - 4s 0 0 860.56749 0 144 880.00000 860.56749 2.21% - 4s 0 0 860.56863 0 141 880.00000 860.56863 2.21% - 4s 0 0 860.56863 0 145 880.00000 860.56863 2.21% - 4s 0 0 860.57270 0 139 880.00000 860.57270 2.21% - 4s 0 0 860.57270 0 143 880.00000 860.57270 2.21% - 4s 0 0 860.57270 0 143 880.00000 860.57270 2.21% - 4s 0 2 860.57276 0 143 880.00000 860.57276 2.21% - 5s * 282 203 104 873.0000000 861.44839 1.32% 22.2 6s 611 478 868.14964 51 145 873.00000 861.78261 1.28% 21.0 10s * 886 523 61 871.0000000 862.04105 1.03% 24.8 12s * 995 497 41 869.0000000 862.07144 0.80% 25.2 12s 1107 530 863.66376 22 133 869.00000 862.62515 0.73% 25.1 15s 2093 752 863.73578 30 116 869.00000 863.58824 0.62% 26.0 20s * 2256 638 38 868.0000000 863.67600 0.50% 25.9 20s 3610 869 866.38786 37 113 868.00000 864.40000 0.41% 24.9 25s 4940 1021 866.09595 35 99 868.00000 864.89121 0.36% 24.2 30s 6384 1044 866.61194 40 102 868.00000 865.31034 0.31% 23.6 35s 7908 822 866.63478 35 105 868.00000 865.71002 0.26% 23.0 40s 9570 117 cutoff 33 868.00000 866.66275 0.15% 22.1 45s Cutting planes: Gomory: 10 Zero half: 10 Explored 9697 nodes (213421 simplex iterations) in 45.24 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 26), (5, 40), (6, 61), (6, 94), (9, 46), (9, 47), (15, 43), (15, 44), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 79), (33, 91), (35, 36), (35, 79), (36, 72), (37, 47), (37, 50), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (43, 88), (45, 92), (50, 65), (55, 56), (57, 76), (60, 93), (60, 100), (61, 84), (62, 85), (64, 65), (64, 91), (66, 67), (66, 72), (73, 74), (73, 76), (74, 75), (86, 94), (86, 99), (88, 98), (92, 101), (93, 95), (95, 96), (96, 98), (97, 100)] adding cut for [(32, 89), (2, 70), (2, 71), (8, 83), (8, 89), (11, 31), (11, 63), (12, 20), (12, 63), (48, 49), (49, 83), (20, 48), (31, 71)] Optimize a model with 517 rows, 5050 columns and 261905 nonzeros Presolve time: 0.18s Presolved: 517 rows, 5050 columns, 261905 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.584591e+02, 372 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.45907 0 102 3624.00000 858.45907 76.3% - 0s Another try with MIP start H 0 0 880.0000000 858.45907 2.45% - 0s 0 0 859.83863 0 119 880.00000 859.83863 2.29% - 0s 0 0 859.83863 0 102 880.00000 859.83863 2.29% - 1s 0 0 859.88663 0 118 880.00000 859.88663 2.29% - 1s 0 0 860.31852 0 126 880.00000 860.31852 2.24% - 1s 0 0 860.36769 0 124 880.00000 860.36769 2.23% - 1s 0 0 860.36769 0 133 880.00000 860.36769 2.23% - 1s 0 0 860.38747 0 125 880.00000 860.38747 2.23% - 2s 0 0 860.38761 0 133 880.00000 860.38761 2.23% - 2s 0 0 860.39447 0 133 880.00000 860.39447 2.23% - 2s 0 0 860.39447 0 137 880.00000 860.39447 2.23% - 2s 0 0 860.40800 0 134 880.00000 860.40800 2.23% - 3s 0 0 860.40800 0 138 880.00000 860.40800 2.23% - 3s 0 0 860.41282 0 133 880.00000 860.41282 2.23% - 3s 0 0 860.41282 0 137 880.00000 860.41282 2.23% - 3s 0 0 860.41282 0 137 880.00000 860.41282 2.23% - 3s 0 0 860.41282 0 141 880.00000 860.41282 2.23% - 3s 0 0 860.41282 0 141 880.00000 860.41282 2.23% - 3s 0 2 860.42160 0 141 880.00000 860.42160 2.22% - 4s * 101 95 56 874.0000000 861.50397 1.43% 31.0 4s * 181 150 59 873.0000000 861.51299 1.32% 26.3 4s * 253 188 48 872.0000000 861.63971 1.19% 25.0 4s 259 188 864.00140 6 106 872.00000 861.65511 1.19% 24.8 5s * 320 215 41 871.0000000 861.65511 1.07% 24.5 5s * 321 151 41 869.0000000 861.65511 0.85% 24.4 5s 992 439 864.84656 20 108 869.00000 862.72699 0.72% 26.5 10s 2355 927 865.20974 20 96 869.00000 863.90900 0.59% 24.5 15s * 3372 1093 30 868.0000000 864.40000 0.41% 23.6 18s 3715 1139 866.98643 27 94 868.00000 864.52721 0.40% 23.3 20s 5214 1335 infeasible 25 868.00000 865.03282 0.34% 22.7 25s 6688 1381 866.83333 23 82 868.00000 865.33158 0.31% 22.1 30s 8223 1250 865.86225 27 99 868.00000 865.66667 0.27% 21.8 35s 9676 900 866.52272 24 110 868.00000 866.05127 0.22% 21.4 40s Cutting planes: Gomory: 8 MIR: 1 Zero half: 12 Explored 11216 nodes (229936 simplex iterations) in 43.27 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 71), (3, 42), (3, 58), (4, 78), (4, 80), (5, 55), (5, 57), (8, 63), (8, 83), (9, 46), (9, 47), (10, 52), (10, 72), (11, 63), (11, 64), (12, 20), (12, 65), (13, 69), (15, 39), (15, 43), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 87), (20, 49), (21, 31), (21, 67), (22, 74), (23, 42), (23, 75), (24, 68), (24, 76), (25, 30), (25, 56), (26, 40), (26, 56), (30, 79), (31, 71), (33, 67), (33, 91), (34, 52), (34, 82), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 99), (38, 101), (39, 45), (40, 68), (43, 44), (45, 92), (47, 48), (49, 83), (50, 65), (51, 77), (55, 81), (57, 76), (62, 86), (64, 91), (66, 72), (69, 81), (73, 74), (73, 75), (77, 78), (80, 82), (86, 99), (92, 101)] Optimize a model with 518 rows, 5050 columns and 264533 nonzeros Presolve time: 0.18s Presolved: 518 rows, 5050 columns, 264533 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.586855e+02, 372 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.68547 0 104 3624.00000 858.68547 76.3% - 0s Another try with MIP start H 0 0 876.0000000 858.68547 1.98% - 0s 0 0 860.17554 0 116 876.00000 860.17554 1.81% - 0s 0 0 860.17554 0 104 876.00000 860.17554 1.81% - 1s 0 0 860.28661 0 122 876.00000 860.28661 1.79% - 1s 0 0 860.93317 0 127 876.00000 860.93317 1.72% - 1s 0 0 860.98216 0 127 876.00000 860.98216 1.71% - 1s 0 0 860.98216 0 130 876.00000 860.98216 1.71% - 2s 0 0 861.05147 0 131 876.00000 861.05147 1.71% - 2s 0 0 861.05147 0 133 876.00000 861.05147 1.71% - 2s 0 0 861.05147 0 135 876.00000 861.05147 1.71% - 2s 0 0 861.05147 0 137 876.00000 861.05147 1.71% - 2s 0 0 861.05147 0 132 876.00000 861.05147 1.71% - 2s 0 0 861.05147 0 131 876.00000 861.05147 1.71% - 2s 0 0 861.05147 0 133 876.00000 861.05147 1.71% - 3s 0 0 861.05147 0 133 876.00000 861.05147 1.71% - 3s 0 2 861.09275 0 133 876.00000 861.09275 1.70% - 3s * 69 58 41 870.0000000 861.14921 1.02% 28.4 3s 584 380 863.64146 6 117 870.00000 862.90715 0.82% 25.2 5s * 680 412 41 868.0000000 862.90715 0.59% 26.5 9s 951 461 863.67948 14 124 868.00000 862.96720 0.58% 25.9 10s 2139 544 866.13136 23 105 868.00000 864.69925 0.38% 23.2 15s 3681 679 866.92409 19 104 868.00000 865.41742 0.30% 21.5 20s 5071 503 866.41270 22 113 868.00000 865.93742 0.24% 20.6 25s Cutting planes: Gomory: 11 MIR: 2 Zero half: 11 Mod-K: 1 Explored 6146 nodes (121854 simplex iterations) in 27.62 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(5, 56), (5, 73), (7, 97), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (57, 76), (62, 100), (73, 74), (75, 76), (97, 100)] adding cut for [(4, 78), (4, 80), (8, 63), (8, 89), (11, 63), (11, 64), (13, 55), (21, 33), (21, 67), (25, 30), (25, 55), (30, 81), (32, 89), (33, 91), (35, 36), (35, 79), (36, 72), (64, 91), (66, 67), (66, 72), (69, 78), (69, 81), (79, 80)] adding cut for [(19, 83), (37, 50), (37, 48), (6, 85), (6, 61), (9, 46), (9, 47), (12, 65), (12, 20), (50, 65), (47, 48), (49, 83), (18, 46), (18, 85), (20, 49), (61, 84)] adding cut for [(38, 99), (38, 101), (60, 96), (60, 94), (3, 88), (86, 92), (86, 94), (88, 98), (92, 101), (93, 98), (93, 99), (95, 96)] Optimize a model with 522 rows, 5050 columns and 265374 nonzeros Presolve time: 0.18s Presolved: 522 rows, 5050 columns, 265374 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.586855e+02, 372 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.68547 0 104 3624.00000 858.68547 76.3% - 0s Another try with MIP start H 0 0 877.0000000 858.68547 2.09% - 0s 0 0 860.17554 0 116 877.00000 860.17554 1.92% - 0s 0 0 860.17554 0 104 877.00000 860.17554 1.92% - 1s 0 0 860.23984 0 115 877.00000 860.23984 1.91% - 1s 0 0 860.74490 0 129 877.00000 860.74490 1.85% - 1s 0 0 860.99549 0 127 877.00000 860.99549 1.82% - 1s 0 0 860.99549 0 131 877.00000 860.99549 1.82% - 1s 0 0 860.99553 0 131 877.00000 860.99553 1.82% - 1s 0 0 860.99553 0 133 877.00000 860.99553 1.82% - 2s 0 0 860.99858 0 127 877.00000 860.99858 1.82% - 2s 0 0 860.99858 0 129 877.00000 860.99858 1.82% - 2s 0 0 860.99858 0 131 877.00000 860.99858 1.82% - 2s 0 0 860.99858 0 131 877.00000 860.99858 1.82% - 2s 0 0 860.99858 0 131 877.00000 860.99858 1.82% - 2s 0 2 861.01921 0 131 877.00000 861.01921 1.82% - 3s * 106 99 65 876.0000000 861.82892 1.62% 26.2 3s * 111 88 69 875.0000000 861.82892 1.51% 25.1 3s * 165 119 36 873.0000000 861.89421 1.27% 25.2 3s * 416 282 59 872.0000000 862.12469 1.13% 22.7 4s 440 298 865.66700 12 108 872.00000 862.37542 1.10% 22.6 5s * 486 286 35 871.0000000 862.37542 0.99% 22.4 5s * 577 277 20 870.0000000 862.69154 0.84% 22.3 5s H 654 257 869.0000000 862.84309 0.71% 22.7 5s 1049 419 864.50598 18 111 869.00000 863.20265 0.67% 24.5 10s 2318 762 866.39799 22 103 869.00000 864.28144 0.54% 23.3 15s 3650 1260 865.83243 19 107 869.00000 864.75995 0.49% 23.0 20s 5110 1676 867.00000 26 90 869.00000 865.10638 0.45% 22.6 25s * 6568 1521 29 868.0000000 865.34785 0.31% 22.4 29s 6580 1521 866.06130 20 104 868.00000 865.35049 0.31% 22.4 30s 8140 1353 cutoff 27 868.00000 865.74194 0.26% 21.9 35s 9649 960 866.46531 20 108 868.00000 866.15904 0.21% 21.4 40s Cutting planes: Gomory: 10 MIR: 3 Zero half: 10 Explored 11085 nodes (226654 simplex iterations) in 43.13 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (6, 61), (6, 85), (9, 46), (9, 47), (12, 64), (12, 65), (13, 55), (18, 46), (18, 85), (19, 84), (21, 33), (21, 67), (25, 26), (25, 30), (26, 56), (30, 81), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (47, 48), (50, 65), (55, 56), (61, 84), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (79, 80)] adding cut for [(5, 40), (5, 73), (7, 97), (15, 44), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (39, 45), (39, 87), (40, 68), (42, 58), (57, 76), (60, 94), (60, 100), (62, 86), (73, 74), (75, 76), (86, 94), (97, 100)] Optimize a model with 524 rows, 5050 columns and 266320 nonzeros Presolve time: 0.18s Presolved: 524 rows, 5050 columns, 266320 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.586855e+02, 378 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.68547 0 104 3624.00000 858.68547 76.3% - 0s Another try with MIP start H 0 0 876.0000000 858.68547 1.98% - 0s 0 0 860.17554 0 116 876.00000 860.17554 1.81% - 0s 0 0 860.17554 0 104 876.00000 860.17554 1.81% - 1s 0 0 860.28291 0 119 876.00000 860.28291 1.79% - 1s 0 0 860.93392 0 127 876.00000 860.93392 1.72% - 1s 0 0 860.93392 0 131 876.00000 860.93392 1.72% - 1s 0 0 860.93392 0 128 876.00000 860.93392 1.72% - 1s 0 0 860.93392 0 132 876.00000 860.93392 1.72% - 2s 0 0 860.93392 0 129 876.00000 860.93392 1.72% - 2s 0 0 860.93392 0 128 876.00000 860.93392 1.72% - 2s 0 0 860.93392 0 129 876.00000 860.93392 1.72% - 2s 0 0 860.93392 0 130 876.00000 860.93392 1.72% - 2s 0 0 860.93392 0 130 876.00000 860.93392 1.72% - 2s 0 2 860.97086 0 130 876.00000 860.97086 1.72% - 3s * 130 95 42 873.0000000 861.29994 1.34% 26.0 4s * 189 133 45 872.0000000 861.62210 1.19% 23.9 4s 468 300 infeasible 16 872.00000 862.14079 1.13% 24.4 5s H 520 290 871.0000000 862.38242 0.99% 24.6 5s * 938 458 37 870.0000000 863.03186 0.80% 26.1 9s 959 466 866.84302 22 110 870.00000 863.03591 0.80% 26.2 10s * 1080 387 29 869.0000000 863.26405 0.66% 25.7 10s 2347 746 867.33514 31 107 869.00000 864.61490 0.50% 24.0 15s 3712 1140 867.19584 24 113 869.00000 865.22417 0.43% 23.3 20s 5160 1419 867.80696 23 104 869.00000 865.59524 0.39% 22.7 25s 6696 1602 866.37315 19 117 869.00000 865.88043 0.36% 22.3 30s 8310 1685 867.80000 27 88 869.00000 866.13551 0.33% 21.9 35s * 8951 986 33 868.0000000 866.25000 0.20% 21.8 36s Cutting planes: Gomory: 8 MIR: 1 Zero half: 7 Explored 10291 nodes (211005 simplex iterations) in 39.56 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(6, 61), (6, 100), (8, 83), (9, 46), (9, 47), (12, 20), (12, 65), (15, 39), (15, 45), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (20, 49), (37, 48), (37, 50), (39, 87), (45, 92), (47, 48), (49, 83), (50, 65), (61, 84), (62, 85), (86, 94), (86, 101), (92, 101), (94, 100)] adding cut for [(4, 78), (4, 80), (5, 26), (5, 55), (11, 63), (11, 64), (13, 55), (21, 33), (21, 67), (25, 30), (25, 56), (26, 56), (30, 81), (32, 89), (33, 91), (35, 36), (35, 79), (36, 72), (63, 89), (64, 91), (66, 67), (66, 72), (69, 78), (69, 81), (79, 80)] adding cut for [(3, 42), (3, 58), (16, 44), (16, 58), (22, 41), (22, 74), (23, 42), (23, 75), (38, 93), (38, 99), (43, 44), (43, 88), (57, 73), (57, 76), (60, 96), (60, 99), (73, 74), (75, 76), (88, 98), (93, 98), (95, 96)] adding cut for [(24, 40), (24, 68), (40, 68)] Optimize a model with 528 rows, 5050 columns and 267285 nonzeros Presolve time: 0.18s Presolved: 528 rows, 5050 columns, 267285 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.586855e+02, 358 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.68547 0 104 3624.00000 858.68547 76.3% - 0s Another try with MIP start H 0 0 879.0000000 858.68547 2.31% - 0s 0 0 860.17852 0 114 879.00000 860.17852 2.14% - 0s 0 0 860.17852 0 104 879.00000 860.17852 2.14% - 1s 0 0 860.24411 0 116 879.00000 860.24411 2.13% - 1s 0 0 860.91057 0 128 879.00000 860.91057 2.06% - 1s 0 0 860.91057 0 132 879.00000 860.91057 2.06% - 1s 0 0 860.92428 0 131 879.00000 860.92428 2.06% - 1s 0 0 860.92428 0 132 879.00000 860.92428 2.06% - 1s 0 0 860.92428 0 135 879.00000 860.92428 2.06% - 2s 0 0 860.93002 0 134 879.00000 860.93002 2.06% - 2s 0 0 861.00431 0 128 879.00000 861.00431 2.05% - 2s 0 0 861.00431 0 132 879.00000 861.00431 2.05% - 2s 0 0 861.00431 0 132 879.00000 861.00431 2.05% - 2s 0 0 861.06422 0 127 879.00000 861.06422 2.04% - 2s 0 0 861.06422 0 131 879.00000 861.06422 2.04% - 2s 0 0 861.06422 0 129 879.00000 861.06422 2.04% - 3s 0 0 861.06422 0 128 879.00000 861.06422 2.04% - 3s 0 0 861.06422 0 132 879.00000 861.06422 2.04% - 3s 0 0 861.06422 0 132 879.00000 861.06422 2.04% - 3s 0 0 861.06422 0 136 879.00000 861.06422 2.04% - 3s 0 0 861.06422 0 132 879.00000 861.06422 2.04% - 3s 0 2 861.10918 0 130 879.00000 861.10918 2.04% - 4s 174 162 870.73052 45 90 879.00000 862.03387 1.93% 29.7 5s * 189 134 53 873.0000000 862.03387 1.26% 29.4 5s * 193 116 57 872.0000000 862.03387 1.14% 29.0 5s * 451 289 54 871.0000000 862.71055 0.95% 26.2 6s 671 399 868.23977 38 98 871.00000 863.27789 0.89% 26.3 10s H 713 383 870.0000000 863.27789 0.77% 26.6 10s * 866 394 35 869.0000000 863.27789 0.66% 27.1 10s 1928 652 867.48547 20 125 869.00000 864.15549 0.56% 24.9 15s 3203 1120 866.41667 26 77 869.00000 864.85783 0.48% 23.6 20s 4692 1557 867.74526 30 89 869.00000 865.26711 0.43% 22.6 25s 6035 1905 867.71739 24 87 869.00000 865.48383 0.40% 22.0 30s 7790 2217 866.96011 24 111 869.00000 865.70256 0.38% 21.5 35s 9267 2392 866.57544 23 107 869.00000 865.87366 0.36% 21.2 40s 10864 2509 867.11111 25 97 869.00000 866.04387 0.34% 21.0 45s 12961 2556 866.92683 25 90 869.00000 866.25460 0.32% 20.7 50s 14704 2486 866.64162 22 117 869.00000 866.40443 0.30% 20.6 55s 16532 2311 867.00009 23 113 869.00000 866.56222 0.28% 20.4 60s 18648 2027 867.66667 24 117 869.00000 866.76326 0.26% 20.2 65s 20905 1368 867.69525 23 110 869.00000 867.04667 0.22% 20.0 70s *22611 0 26 868.0000000 868.00000 0.0% 19.7 73s Cutting planes: Gomory: 7 Zero half: 13 Explored 22612 nodes (445647 simplex iterations) in 73.67 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.680000000000e+02, best bound 8.680000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (5, 56), (5, 73), (6, 61), (6, 100), (9, 46), (9, 84), (14, 88), (15, 43), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (38, 99), (38, 101), (39, 45), (39, 87), (40, 68), (43, 44), (57, 76), (60, 94), (60, 100), (61, 84), (62, 85), (73, 74), (75, 76), (86, 92), (86, 94), (88, 98), (92, 101), (93, 98), (93, 99)] adding cut for [(2, 51), (2, 70), (8, 49), (8, 89), (10, 52), (10, 82), (11, 33), (11, 71), (12, 20), (12, 63), (19, 83), (20, 48), (21, 31), (21, 67), (31, 71), (33, 91), (34, 51), (34, 52), (35, 36), (35, 79), (36, 72), (37, 47), (37, 50), (47, 48), (49, 83), (50, 65), (63, 89), (64, 65), (64, 91), (66, 67), (66, 72), (79, 82)] Optimize a model with 530 rows, 5050 columns and 268759 nonzeros Presolve time: 0.18s Presolved: 530 rows, 5050 columns, 268759 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.586879e+02, 372 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.68789 0 110 3624.00000 858.68789 76.3% - 0s Another try with MIP start H 0 0 877.0000000 858.68789 2.09% - 0s H 0 0 876.0000000 858.68789 1.98% - 0s 0 0 860.17852 0 111 876.00000 860.17852 1.81% - 1s 0 0 860.17852 0 110 876.00000 860.17852 1.81% - 1s 0 0 860.27957 0 119 876.00000 860.27957 1.79% - 1s 0 0 860.93392 0 125 876.00000 860.93392 1.72% - 1s 0 0 860.93392 0 127 876.00000 860.93392 1.72% - 1s 0 0 860.93392 0 129 876.00000 860.93392 1.72% - 2s 0 0 860.93392 0 130 876.00000 860.93392 1.72% - 2s 0 0 860.93392 0 131 876.00000 860.93392 1.72% - 2s 0 0 860.93392 0 131 876.00000 860.93392 1.72% - 2s 0 2 860.95861 0 131 876.00000 860.95861 1.72% - 3s * 89 70 55 875.0000000 861.38305 1.56% 25.9 3s * 160 121 50 874.0000000 861.52407 1.43% 23.2 3s * 235 163 55 873.0000000 861.52652 1.31% 22.9 3s * 492 333 26 872.0000000 861.87273 1.16% 25.7 4s 594 401 867.96640 13 101 872.00000 862.26810 1.12% 25.5 5s H 600 283 870.0000000 862.26810 0.89% 25.5 5s 973 425 863.31887 19 116 870.00000 862.61653 0.85% 27.9 10s H 1068 409 869.0000000 862.82796 0.71% 27.8 10s 2089 695 864.50261 22 118 869.00000 864.02302 0.57% 26.4 15s 3448 1152 865.92603 28 117 869.00000 864.67936 0.50% 25.1 20s 4770 1535 865.44707 23 114 869.00000 864.98369 0.46% 24.4 25s 6331 1937 866.68882 23 116 869.00000 865.32643 0.42% 23.8 30s 7760 2208 867.53450 27 94 869.00000 865.54726 0.40% 23.5 35s 9146 2369 867.44056 30 108 869.00000 865.73573 0.38% 23.3 40s 10692 2517 867.56129 33 95 869.00000 865.93258 0.35% 22.9 45s 12378 2560 867.03306 28 110 869.00000 866.10020 0.33% 22.8 50s 14004 2536 866.82997 26 101 869.00000 866.28716 0.31% 22.5 55s 15969 2377 866.99159 27 126 869.00000 866.50643 0.29% 22.2 60s 18018 2004 cutoff 28 869.00000 866.74510 0.26% 21.9 65s 20131 1296 867.38674 31 115 869.00000 867.07363 0.22% 21.6 70s Cutting planes: Gomory: 7 MIR: 3 Zero half: 8 Explored 22015 nodes (463225 simplex iterations) in 74.05 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.690000000000e+02, best bound 8.690000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (5, 55), (5, 73), (15, 44), (15, 45), (16, 44), (16, 58), (17, 87), (17, 92), (22, 41), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 35), (34, 80), (34, 82), (35, 79), (39, 45), (39, 87), (40, 68), (43, 88), (43, 101), (55, 81), (57, 76), (69, 78), (69, 81), (73, 74), (75, 76), (79, 82), (88, 98), (92, 101), (95, 96), (96, 98)] adding cut for [(6, 61), (6, 100), (8, 53), (8, 83), (9, 46), (9, 47), (12, 20), (12, 65), (18, 46), (18, 85), (19, 84), (20, 49), (37, 48), (37, 50), (38, 93), (38, 99), (47, 48), (49, 83), (50, 65), (60, 93), (60, 100), (61, 84), (62, 85), (62, 86), (86, 94), (94, 99)] adding cut for [(64, 91), (33, 91), (2, 71), (2, 51), (36, 72), (32, 89), (63, 89), (10, 36), (10, 52), (11, 64), (11, 63), (51, 77), (66, 67), (66, 72), (21, 33), (21, 67), (31, 71), (31, 52)] Optimize a model with 533 rows, 5050 columns and 270184 nonzeros Presolve time: 0.18s Presolved: 533 rows, 5050 columns, 270184 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.586879e+02, 361 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.68789 0 110 3624.00000 858.68789 76.3% - 0s Another try with MIP start H 0 0 883.0000000 858.68789 2.75% - 0s H 0 0 876.0000000 858.68789 1.98% - 0s 0 0 860.17852 0 111 876.00000 860.17852 1.81% - 1s 0 0 860.17852 0 110 876.00000 860.17852 1.81% - 1s 0 0 860.27957 0 119 876.00000 860.27957 1.79% - 1s 0 0 860.93392 0 125 876.00000 860.93392 1.72% - 1s 0 0 860.93392 0 127 876.00000 860.93392 1.72% - 1s 0 0 860.93392 0 129 876.00000 860.93392 1.72% - 2s 0 0 860.93392 0 131 876.00000 860.93392 1.72% - 2s 0 0 860.94677 0 127 876.00000 860.94677 1.72% - 2s 0 0 860.94677 0 131 876.00000 860.94677 1.72% - 2s 0 0 860.94677 0 129 876.00000 860.94677 1.72% - 2s 0 0 861.05061 0 129 876.00000 861.05061 1.71% - 2s 0 0 861.07737 0 132 876.00000 861.07737 1.70% - 2s 0 0 861.07737 0 136 876.00000 861.07737 1.70% - 3s 0 0 861.07737 0 134 876.00000 861.07737 1.70% - 3s 0 0 861.07737 0 138 876.00000 861.07737 1.70% - 3s 0 0 861.07745 0 134 876.00000 861.07745 1.70% - 3s 0 0 861.07745 0 138 876.00000 861.07745 1.70% - 3s 0 0 861.07745 0 136 876.00000 861.07745 1.70% - 3s 0 0 861.07745 0 140 876.00000 861.07745 1.70% - 3s 0 0 861.07745 0 140 876.00000 861.07745 1.70% - 4s H 0 0 875.0000000 861.07745 1.59% - 4s 0 2 861.12101 0 140 875.00000 861.12101 1.59% - 4s 88 90 872.34483 56 60 875.00000 861.25147 1.57% 25.6 5s * 107 100 72 874.0000000 861.25147 1.46% 23.4 5s * 112 96 75 873.0000000 861.25147 1.35% 22.5 5s H 592 334 870.0000000 862.63639 0.85% 21.8 7s 712 416 866.15640 16 141 870.00000 862.71062 0.84% 21.9 10s 1651 699 866.42236 25 110 870.00000 863.53271 0.74% 24.9 15s H 2463 868 869.0000000 864.03039 0.57% 24.3 18s 2979 1061 866.66655 17 117 869.00000 864.33664 0.54% 24.1 20s 4256 1505 cutoff 29 869.00000 864.76367 0.49% 23.7 25s 5564 1821 867.90816 23 108 869.00000 865.14080 0.44% 23.4 30s 6957 2109 867.61818 23 93 869.00000 865.38944 0.42% 23.0 35s 8443 2327 cutoff 34 869.00000 865.66023 0.38% 22.7 40s 9938 2471 867.78358 30 100 869.00000 865.86618 0.36% 22.5 45s 11680 2581 cutoff 22 869.00000 866.04403 0.34% 22.3 50s 13554 2648 867.99408 25 90 869.00000 866.23554 0.32% 22.0 55s 15005 2622 cutoff 20 869.00000 866.38983 0.30% 21.7 60s 17119 2456 867.51351 28 83 869.00000 866.60976 0.28% 21.4 65s 19329 2099 cutoff 23 869.00000 866.83673 0.25% 21.0 70s 21556 1400 867.60384 24 104 869.00000 867.13606 0.21% 20.6 75s Cutting planes: Gomory: 8 MIR: 4 Zero half: 12 Explored 23725 nodes (472715 simplex iterations) in 79.00 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.690000000000e+02, best bound 8.690000000000e+02, gap 0.0% adding cut for [(4, 78), (4, 80), (6, 85), (6, 86), (9, 46), (9, 47), (13, 55), (15, 39), (15, 45), (17, 62), (17, 87), (18, 46), (18, 85), (25, 30), (25, 55), (30, 81), (33, 67), (33, 91), (35, 36), (35, 79), (36, 66), (37, 48), (37, 50), (38, 96), (38, 99), (39, 87), (45, 92), (47, 48), (50, 65), (62, 86), (64, 65), (64, 91), (66, 72), (67, 72), (69, 78), (69, 81), (79, 80), (92, 101), (95, 96), (99, 101)] adding cut for [(5, 56), (5, 73), (7, 97), (16, 44), (16, 58), (22, 41), (22, 74), (23, 42), (23, 75), (24, 57), (24, 68), (26, 40), (26, 56), (40, 68), (42, 58), (43, 44), (43, 88), (57, 76), (60, 93), (60, 94), (73, 74), (75, 76), (88, 98), (93, 98), (94, 100), (97, 100)] adding cut for [(32, 89), (2, 70), (2, 51), (8, 89), (8, 83), (10, 82), (10, 52), (11, 71), (11, 63), (12, 20), (12, 63), (34, 82), (34, 51), (49, 83), (21, 52), (21, 31), (20, 49), (31, 71)] Optimize a model with 536 rows, 5050 columns and 271526 nonzeros Presolve time: 0.19s Presolved: 536 rows, 5050 columns, 271526 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.586879e+02, 356 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.68789 0 110 3624.00000 858.68789 76.3% - 0s Another try with MIP start H 0 0 876.0000000 858.68789 1.98% - 0s 0 0 860.17852 0 111 876.00000 860.17852 1.81% - 1s 0 0 860.17852 0 110 876.00000 860.17852 1.81% - 1s 0 0 860.27957 0 119 876.00000 860.27957 1.79% - 1s 0 0 860.93392 0 125 876.00000 860.93392 1.72% - 1s 0 0 860.93392 0 127 876.00000 860.93392 1.72% - 1s 0 0 860.93392 0 129 876.00000 860.93392 1.72% - 2s 0 0 860.93392 0 130 876.00000 860.93392 1.72% - 2s 0 0 860.93392 0 131 876.00000 860.93392 1.72% - 2s 0 0 860.93392 0 131 876.00000 860.93392 1.72% - 2s 0 2 860.97086 0 131 876.00000 860.97086 1.72% - 2s * 96 84 58 875.0000000 861.12053 1.59% 25.2 3s * 321 247 57 874.0000000 862.03738 1.37% 25.3 4s * 447 240 29 871.0000000 862.05308 1.03% 25.4 4s * 448 193 29 870.0000000 862.05308 0.91% 25.3 4s 504 202 863.31955 6 122 870.00000 862.17468 0.90% 24.7 5s 624 262 868.14844 32 142 870.00000 862.39404 0.87% 23.8 10s * 730 276 42 869.0000000 862.39404 0.76% 26.1 11s 1607 482 867.73585 31 76 869.00000 864.05491 0.57% 25.8 15s 2927 998 867.05470 26 110 869.00000 864.79167 0.48% 24.8 20s 4286 1410 866.77273 28 82 869.00000 865.17496 0.44% 23.9 25s 5634 1743 867.81481 29 103 869.00000 865.48711 0.40% 23.3 30s 6965 2017 867.49974 32 98 869.00000 865.68684 0.38% 22.9 35s 8411 2268 866.91714 26 101 869.00000 865.86408 0.36% 22.6 40s 9888 2415 866.95370 27 108 869.00000 866.03950 0.34% 22.3 45s 11754 2483 cutoff 32 869.00000 866.21190 0.32% 22.0 50s 13659 2437 867.73567 31 112 869.00000 866.38798 0.30% 21.7 55s 15728 2253 866.83430 26 119 869.00000 866.56198 0.28% 21.4 60s 17735 1998 867.37172 27 121 869.00000 866.75926 0.26% 21.1 65s 19961 1472 867.58252 29 119 869.00000 867.00063 0.23% 20.8 70s 21951 602 867.91111 32 77 869.00000 867.39895 0.18% 20.5 75s Cutting planes: Gomory: 9 MIR: 1 Zero half: 13 Mod-K: 1 Explored 22800 nodes (459731 simplex iterations) in 76.68 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.690000000000e+02, best bound 8.690000000000e+02, gap 0.0% adding cut for [(2, 51), (2, 70), (3, 42), (4, 78), (4, 80), (10, 52), (10, 82), (11, 63), (11, 71), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (31, 52), (31, 71), (33, 91), (34, 51), (34, 82), (35, 36), (35, 79), (36, 72), (40, 68), (57, 76), (63, 64), (64, 91), (66, 67), (66, 72), (69, 78), (69, 81), (75, 76), (79, 80)] adding cut for [(6, 61), (6, 100), (8, 83), (8, 89), (9, 46), (9, 47), (12, 20), (12, 65), (18, 46), (18, 85), (19, 84), (20, 49), (32, 89), (37, 48), (37, 50), (47, 48), (49, 83), (50, 65), (60, 94), (60, 100), (61, 84), (62, 85), (62, 86), (86, 94)] adding cut for [(96, 98), (99, 101), (38, 99), (38, 93), (39, 45), (39, 87), (43, 88), (43, 58), (15, 44), (15, 45), (16, 44), (16, 58), (17, 87), (17, 92), (88, 98), (92, 101), (93, 96)] Optimize a model with 539 rows, 5050 columns and 272703 nonzeros Presolve time: 0.19s Presolved: 539 rows, 5050 columns, 272703 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.586879e+02, 344 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.68789 0 110 3624.00000 858.68789 76.3% - 0s Another try with MIP start H 0 0 872.0000000 858.68789 1.53% - 0s 0 0 860.19463 0 119 872.00000 860.19463 1.35% - 1s 0 0 860.19463 0 110 872.00000 860.19463 1.35% - 1s 0 0 860.28767 0 121 872.00000 860.28767 1.34% - 1s 0 0 860.94166 0 134 872.00000 860.94166 1.27% - 1s 0 0 860.94166 0 137 872.00000 860.94166 1.27% - 1s 0 0 860.94449 0 131 872.00000 860.94449 1.27% - 1s 0 0 860.94449 0 136 872.00000 860.94449 1.27% - 1s 0 0 860.96227 0 135 872.00000 860.96227 1.27% - 2s 0 0 861.04949 0 136 872.00000 861.04949 1.26% - 2s 0 0 861.05051 0 141 872.00000 861.05051 1.26% - 2s 0 0 861.05051 0 140 872.00000 861.05051 1.26% - 2s 0 0 861.07525 0 138 872.00000 861.07525 1.25% - 2s 0 0 861.09936 0 135 872.00000 861.09936 1.25% - 2s 0 0 861.09977 0 137 872.00000 861.09977 1.25% - 2s 0 0 861.09990 0 137 872.00000 861.09990 1.25% - 2s 0 0 861.10569 0 137 872.00000 861.10569 1.25% - 2s 0 0 861.17297 0 137 872.00000 861.17297 1.24% - 2s 0 0 861.17297 0 137 872.00000 861.17297 1.24% - 3s 0 0 861.17473 0 138 872.00000 861.17473 1.24% - 3s 0 0 861.24713 0 133 872.00000 861.24713 1.23% - 3s 0 0 861.24713 0 136 872.00000 861.24713 1.23% - 3s 0 0 861.25164 0 137 872.00000 861.25164 1.23% - 3s 0 0 861.25164 0 139 872.00000 861.25164 1.23% - 3s 0 0 861.25334 0 137 872.00000 861.25334 1.23% - 3s 0 0 861.25427 0 140 872.00000 861.25427 1.23% - 3s 0 0 861.25646 0 141 872.00000 861.25646 1.23% - 4s H 0 0 871.0000000 861.25646 1.12% - 4s 0 2 861.28288 0 141 871.00000 861.28288 1.12% - 4s 197 167 863.70627 4 122 871.00000 862.48037 0.98% 24.7 5s H 600 363 869.0000000 862.64696 0.73% 22.9 6s 628 384 863.16076 20 119 869.00000 862.64696 0.73% 23.7 10s 1903 680 cutoff 36 869.00000 864.23863 0.55% 24.0 15s 3505 1383 865.35304 27 118 869.00000 864.79813 0.48% 22.2 20s 4960 1921 866.33062 29 119 869.00000 865.11655 0.45% 21.7 25s 6355 2304 867.69396 26 105 869.00000 865.36857 0.42% 21.3 30s 7872 2602 866.25926 30 99 869.00000 865.61631 0.39% 21.2 35s 9522 2924 866.77367 24 126 869.00000 865.81642 0.37% 20.8 40s 11119 3079 cutoff 36 869.00000 865.98214 0.35% 20.8 45s 12970 3094 867.00480 29 108 869.00000 866.16138 0.33% 20.7 50s 14735 3048 867.41333 29 95 869.00000 866.30000 0.31% 20.7 55s 16817 2841 867.87675 28 100 869.00000 866.47581 0.29% 20.7 60s 18388 2660 867.43793 30 105 869.00000 866.61740 0.27% 20.6 65s 20609 2231 867.62134 30 113 869.00000 866.83707 0.25% 20.4 70s 22787 1501 cutoff 34 869.00000 867.08842 0.22% 20.2 75s Cutting planes: Gomory: 8 MIR: 2 Zero half: 11 Explored 25174 nodes (495184 simplex iterations) in 79.80 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.690000000000e+02, best bound 8.690000000000e+02, gap 0.0% adding cut for [(3, 42), (3, 58), (4, 78), (4, 80), (8, 83), (8, 89), (9, 46), (9, 84), (11, 32), (11, 63), (12, 64), (12, 65), (15, 44), (15, 45), (16, 44), (16, 58), (17, 62), (17, 87), (18, 46), (18, 85), (19, 84), (20, 48), (20, 49), (21, 33), (21, 67), (23, 42), (23, 75), (24, 57), (24, 68), (25, 30), (25, 56), (26, 40), (26, 56), (30, 81), (33, 91), (35, 36), (35, 79), (36, 72), (37, 47), (37, 50), (39, 45), (39, 87), (40, 68), (47, 48), (49, 83), (50, 65), (57, 76), (62, 85), (63, 89), (64, 91), (66, 67), (66, 72), (69, 78), (69, 81), (75, 76), (79, 80)] adding cut for [(96, 98), (38, 99), (38, 93), (92, 101), (43, 101), (43, 88), (86, 92), (86, 94), (88, 98), (60, 96), (60, 93), (94, 99)] Optimize a model with 541 rows, 5050 columns and 274365 nonzeros Presolve time: 0.19s Presolved: 541 rows, 5050 columns, 274365 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.586879e+02, 354 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.68789 0 110 3624.00000 858.68789 76.3% - 0s Another try with MIP start H 0 0 874.0000000 858.68789 1.75% - 0s 0 0 860.19463 0 119 874.00000 860.19463 1.58% - 1s 0 0 860.19463 0 110 874.00000 860.19463 1.58% - 1s 0 0 860.22302 0 120 874.00000 860.22302 1.58% - 1s 0 0 860.88757 0 118 874.00000 860.88757 1.50% - 1s 0 0 860.95834 0 126 874.00000 860.95834 1.49% - 2s 0 0 860.95834 0 128 874.00000 860.95834 1.49% - 2s 0 0 860.95834 0 129 874.00000 860.95834 1.49% - 2s 0 0 860.95834 0 129 874.00000 860.95834 1.49% - 2s 0 0 860.95834 0 133 874.00000 860.95834 1.49% - 2s 0 2 861.00665 0 133 874.00000 861.00665 1.49% - 2s * 310 245 47 873.0000000 861.88268 1.27% 23.5 3s * 430 273 32 871.0000000 862.20139 1.01% 24.2 4s H 600 309 870.0000000 862.47060 0.87% 23.8 4s 601 308 867.27500 19 119 870.00000 862.47060 0.87% 23.7 5s 999 433 868.66007 28 109 870.00000 863.08898 0.79% 26.7 10s * 1413 462 27 869.0000000 863.80846 0.60% 26.0 11s 2297 772 866.77551 26 97 869.00000 864.34284 0.54% 24.6 15s 3723 1233 866.71178 27 100 869.00000 864.92520 0.47% 23.9 20s 5010 1617 866.31752 25 107 869.00000 865.23265 0.43% 23.1 25s 6591 1984 867.74590 29 95 869.00000 865.51600 0.40% 22.5 30s 8052 2211 866.43738 24 95 869.00000 865.69703 0.38% 22.1 35s 9652 2435 867.07893 25 93 869.00000 865.85503 0.36% 21.6 40s 11626 2664 cutoff 34 869.00000 866.05616 0.34% 21.3 45s 13733 2695 867.69903 24 96 869.00000 866.24415 0.32% 20.9 50s 15667 2642 867.90741 27 95 869.00000 866.42400 0.30% 20.7 55s 17883 2520 867.67857 24 118 869.00000 866.59812 0.28% 20.4 60s 19987 2246 867.82609 27 100 869.00000 866.76305 0.26% 20.1 65s 22116 1752 867.98399 27 90 869.00000 866.98373 0.23% 19.9 70s 24256 812 cutoff 26 869.00000 867.32990 0.19% 19.6 75s Cutting planes: Gomory: 7 MIR: 2 Zero half: 8 Explored 25407 nodes (488320 simplex iterations) in 77.24 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 8.690000000000e+02, best bound 8.690000000000e+02, gap 0.0% adding cut for [(3, 74), (3, 88), (5, 26), (5, 40), (11, 63), (11, 64), (12, 20), (12, 65), (15, 43), (15, 45), (16, 44), (16, 58), (17, 87), (17, 92), (18, 46), (18, 85), (20, 63), (21, 31), (21, 67), (22, 73), (23, 42), (23, 76), (24, 57), (24, 68), (25, 30), (25, 55), (26, 56), (30, 79), (31, 33), (33, 91), (35, 36), (35, 79), (36, 72), (37, 48), (37, 50), (38, 96), (38, 99), (39, 45), (39, 87), (40, 68), (42, 58), (43, 44), (46, 47), (47, 48), (50, 65), (55, 56), (57, 76), (60, 93), (60, 94), (62, 85), (62, 86), (64, 91), (66, 67), (66, 72), (73, 75), (74, 75), (86, 94), (88, 98), (92, 101), (93, 98), (95, 96), (99, 101)] Optimize a model with 542 rows, 5050 columns and 276318 nonzeros Presolve time: 0.19s Presolved: 542 rows, 5050 columns, 276318 nonzeros MIP start did not produce a feasible solution Variable types: 0 continuous, 5050 integer (4950 binary) Found heuristic solution: objective 3624.0000000 Root relaxation: objective 8.586879e+02, 356 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 858.68789 0 110 3624.00000 858.68789 76.3% - 0s Another try with MIP start H 0 0 875.0000000 858.68789 1.86% - 0s 0 0 860.19374 0 118 875.00000 860.19374 1.69% - 1s 0 0 860.19374 0 110 875.00000 860.19374 1.69% - 1s 0 0 860.28767 0 121 875.00000 860.28767 1.68% - 1s 0 0 860.94166 0 133 875.00000 860.94166 1.61% - 1s 0 0 860.94166 0 135 875.00000 860.94166 1.61% - 2s 0 0 860.94166 0 138 875.00000 860.94166 1.61% - 2s 0 0 860.94449 0 132 875.00000 860.94449 1.61% - 2s 0 0 860.94449 0 137 875.00000 860.94449 1.61% - 2s 0 0 860.96227 0 136 875.00000 860.96227 1.60% - 2s 0 0 861.08032 0 136 875.00000 861.08032 1.59% - 2s 0 0 861.08032 0 138 875.00000 861.08032 1.59% - 2s 0 0 861.08032 0 139 875.00000 861.08032 1.59% - 2s 0 0 861.08032 0 141 875.00000 861.08032 1.59% - 3s 0 0 861.08243 0 138 875.00000 861.08243 1.59% - 3s 0 0 861.08243 0 140 875.00000 861.08243 1.59% - 3s 0 0 861.08243 0 140 875.00000 861.08243 1.59% - 3s 0 2 861.18014 0 140 875.00000 861.18014 1.58% - 3s * 93 76 60 872.0000000 861.63565 1.19% 24.6 4s 233 187 867.31873 10 105 872.00000 862.26361 1.12% 22.6 5s * 424 309 24 871.0000000 862.69773 0.95% 23.6 5s * 573 265 40 869.0000000 862.84137 0.71% 22.6 6s 717 342 863.31384 12 124 869.00000 863.31384 0.65% 22.6 10s 1975 641 865.37118 19 120 869.00000 864.10271 0.56% 23.9 15s 3341 1188 867.12903 24 104 869.00000 864.68000 0.50% 23.1 20s 4750 1524 867.10831 24 120 869.00000 865.08901 0.45% 22.9 25s 6182 1785 867.44264 38 104 869.00000 865.37565 0.42% 22.7 30s 7669 1989 866.28461 26 115 869.00000 865.62503 0.39% 22.4 35s 9121 2110 cutoff 24 869.00000 865.82213 0.37% 22.2 40s 10660 2133 866.32323 28 102 869.00000 866.04010 0.34% 22.1 45s 12729 2039 867.01203 27 121 869.00000 866.31469 0.31% 21.8 50s Cutting planes: Gomory: 5 MIR: 3 Zero half: 10 Explored 12944 nodes (282472 simplex iterations) in 51.74 seconds Thread count was 1 (of 16 available processors) Time limit reached Best objective 8.690000000000e+02, best bound 8.670000000000e+02, gap 0.2301% Gurobi 5.0.1 (linux64) logging started Fri Dec 7 18:50:40 2012