Build (method = -2) #dp: 3473 Step-3' Graph: 422 vertices and 1939 arcs (0.02s) Step-4' Graph: 400 vertices and 1895 arcs (0.03s) #V4/#V3 = 0.95 #A4/#A3 = 0.98 Ready! (0.03s) Optimize a model with 420 rows, 1896 columns and 4900 nonzeros Presolve removed 71 rows and 149 columns Presolve time: 0.04s Presolved: 349 rows, 1747 columns, 4672 nonzeros Variable types: 0 continuous, 1747 integer (0 binary) Found heuristic solution: objective 163.0000000 Found heuristic solution: objective 154.0000000 Optimize a model with 349 rows, 1747 columns and 4672 nonzeros Presolved: 349 rows, 1747 columns, 4672 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.713e+03 Factor NZ : 1.290e+04 Factor Ops : 7.667e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.14172082e+03 -3.58077549e+04 2.86e+04 2.22e-16 8.09e+01 0s 1 4.74837583e+02 -2.18207616e+04 5.81e+03 8.88e-16 1.95e+01 0s 2 2.97259573e+02 -8.65022856e+03 1.30e+03 1.55e-15 4.98e+00 0s 3 2.58809419e+02 -3.30901693e+03 1.68e+02 4.44e-15 1.27e+00 0s 4 2.48238868e+02 -1.17829498e+03 1.10e+01 1.24e-14 4.17e-01 0s 5 2.22420209e+02 -8.56342764e+02 6.58e+00 9.33e-15 3.13e-01 0s 6 2.10934275e+02 -5.73138264e+02 4.04e+00 6.66e-15 2.26e-01 0s 7 1.92922832e+02 -3.11736788e+02 1.59e+00 4.00e-15 1.45e-01 0s 8 1.81804226e+02 -2.00470614e+02 1.10e+00 3.00e-15 1.09e-01 0s 9 1.68970238e+02 -1.87068210e+02 7.23e-01 2.66e-15 1.02e-01 0s 10 1.42927151e+02 -8.71401342e+01 3.56e-01 2.00e-15 6.57e-02 0s 11 1.18733511e+02 -6.86178142e+00 1.51e-01 1.11e-15 3.59e-02 0s 12 1.07729833e+02 6.37859901e+01 7.65e-02 4.84e-16 1.26e-02 0s 13 9.97468348e+01 9.14764597e+01 1.71e-02 2.33e-16 2.36e-03 0s 14 9.75984224e+01 9.74657451e+01 6.83e-04 4.07e-16 3.80e-05 0s 15 9.75000990e+01 9.74999658e+01 1.18e-12 3.37e-16 3.80e-08 0s 16 9.75000000e+01 9.75000000e+01 5.61e-13 3.15e-16 3.90e-14 0s Barrier solved model in 16 iterations and 0.05 seconds Optimal objective 9.75000000e+01 Root relaxation: objective 9.750000e+01, 861 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 97.50000 0 2 154.00000 97.50000 36.7% - 0s H 0 0 98.0000000 97.50000 0.51% - 0s Explored 0 nodes (1228 simplex iterations) in 0.15 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.800000000000e+01, best bound 9.800000000000e+01, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.15 seconds Total run time: 0.19 seconds Objective: 98 Solution: 7 x [20] 4 x [19, 20] 2 x [6] 1 x [6, 19] 4 x [1, 6] 1 x [6, 12] 1 x [6, 12, 12] 2 x [17] 11 x [8, 17] 4 x [15, 17] 2 x [9, 13] 4 x [9, 11] 8 x [1, 7, 9] 4 x [7, 9] 2 x [1, 4, 12] 2 x [4, 7] 11 x [14] 5 x [8, 14] 2 x [12, 12, 14] 4 x [3, 5] 2 x [3, 7, 10] 3 x [3, 7] 4 x [2, 3, 16, 16, 16] 1 x [18] 7 x [18, 18]