Build (method = -2) #dp: 12695 Step-3' Graph: 143 vertices and 1778 arcs (0.06s) Step-4' Graph: 100 vertices and 1692 arcs (0.06s) #V4/#V3 = 0.70 #A4/#A3 = 0.95 Ready! (0.06s) Optimize a model with 160 rows, 1693 columns and 4887 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.01s Presolved: 158 rows, 1691 columns, 4883 nonzeros Variable types: 0 continuous, 1691 integer (89 binary) Found heuristic solution: objective 972.0000000 Optimize a model with 158 rows, 1691 columns and 4883 nonzeros Presolved: 158 rows, 1691 columns, 4883 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.959e+03 Factor NZ : 6.074e+03 Factor Ops : 2.960e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.97144558e+04 -1.03182705e+05 6.88e+04 8.11e-02 4.22e+02 0s 1 9.29561641e+03 -3.34921747e+04 9.70e+03 7.77e-16 6.27e+01 0s 2 2.12546354e+03 -1.37885277e+04 1.17e+03 1.27e-14 1.00e+01 0s 3 9.75589610e+02 -3.79092290e+03 8.66e+01 1.78e-15 1.66e+00 0s 4 6.06397452e+02 -1.22673277e+03 2.19e+01 7.77e-16 5.70e-01 0s 5 4.84286529e+02 -6.07918445e+02 1.44e+01 5.55e-16 3.38e-01 0s 6 3.68206254e+02 -2.51476646e+02 7.94e+00 3.54e-16 1.89e-01 0s 7 2.67409412e+02 -1.33002053e+02 4.12e+00 3.74e-16 1.20e-01 0s 8 2.20207458e+02 5.82659881e+01 1.50e+00 4.44e-16 4.79e-02 0s 9 2.15771547e+02 1.69483290e+02 7.96e-01 2.79e-16 1.37e-02 0s 10 2.05000087e+02 2.02314187e+02 3.49e-02 3.33e-16 7.83e-04 0s 11 2.04400960e+02 2.04396861e+02 1.21e-12 2.43e-16 1.19e-06 0s 12 2.04400001e+02 2.04399997e+02 1.17e-13 3.33e-16 1.19e-09 0s 13 2.04400000e+02 2.04400000e+02 3.88e-13 2.23e-16 1.51e-15 0s Barrier solved model in 13 iterations and 0.02 seconds Optimal objective 2.04400000e+02 Root relaxation: objective 2.044000e+02, 1425 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 204.40000 0 62 972.00000 204.40000 79.0% - 0s H 0 0 207.0000000 204.40000 1.26% - 0s H 0 0 205.0000000 204.40000 0.29% - 0s Explored 0 nodes (1778 simplex iterations) in 0.12 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.050000000000e+02, best bound 2.050000000000e+02, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.12 seconds Total run time: 0.19 seconds Objective: 205 Solution: 6 x [24, 34, 46, 58, 59] 24 x [29, 34, 37, 45, 55] 10 x [8, 25, 28, 45, 59] 4 x [11, 13, 29, 52, 57] 6 x [24, 29, 35, 51, 59] 1 x [17, 21, 23, 29, 53] 6 x [20, 25, 33, 50, 55] 7 x [12, 17, 18, 19, 25] 3 x [12, 13, 17, 19, 25] 4 x [22, 28, 31, 52, 59] 5 x [4, 16, 33, 50, 52] 9 x [38, 44, 47, 52, 53] 4 x [4, 11, 38, 46, 52] 1 x [5, 22, 24, 26, 48] 10 x [10, 26, 48, 49, 49] 11 x [9, 27, 42, 48, 56] 1 x [4, 11, 11, 34, 48] 1 x [11, 13, 26, 57] 8 x [11, 33, 41, 54, 56] 2 x [33, 35, 36, 50, 55] 1 x [11, 23, 33, 54, 60] 1 x [10, 33, 49, 49, 60] 1 x [10, 14, 33, 60] 1 x [1, 35, 41, 47, 53] 1 x [7, 9, 19, 32, 41] 3 x [27, 35, 36, 39, 59] 8 x [17, 21, 30, 39, 51] 7 x [14, 19, 32, 39, 39] 4 x [12, 17, 21, 23, 35] 1 x [9, 35, 37, 46, 51] 1 x [4, 35, 35, 36, 59] 16 x [1, 4, 12, 13, 23] 1 x [4, 11, 13, 46] 1 x [6, 7, 9, 15, 30] 1 x [2, 9, 12, 24, 30] 4 x [1, 3, 12, 19, 56] 1 x [3, 9, 15, 43, 56] 18 x [9, 27, 32, 40, 43] 3 x [23, 40, 53, 53, 59] 8 x [5, 8, 11, 24, 46]