Build (method = -2) #dp: 21935 Step-3' Graph: 496 vertices and 2414 arcs (0.20s) Step-4' Graph: 285 vertices and 2014 arcs (0.20s) #V4/#V3 = 0.57 #A4/#A3 = 0.83 Ready! (0.20s) Optimize a model with 323 rows, 2015 columns and 5458 nonzeros Presolve removed 30 rows and 63 columns Presolve time: 0.04s Presolved: 293 rows, 1952 columns, 5333 nonzeros Variable types: 0 continuous, 1952 integer (156 binary) Found heuristic solution: objective 90.0000000 Found heuristic solution: objective 73.0000000 Optimize a model with 293 rows, 1952 columns and 5333 nonzeros Presolved: 293 rows, 1952 columns, 5333 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.500e+03 Factor NZ : 9.425e+03 Factor Ops : 4.483e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.24362347e+03 -3.48249035e+04 4.82e+04 1.75e-01 1.64e+02 0s 1 1.49729696e+03 -1.33094184e+04 8.69e+03 3.55e-15 2.99e+01 0s 2 2.44911537e+02 -5.76374955e+03 6.68e+02 2.55e-15 3.37e+00 0s 3 1.52881057e+02 -1.90712521e+03 1.01e+02 3.11e-15 7.18e-01 0s 4 1.14460203e+02 -4.62458347e+02 1.88e+01 2.55e-15 1.66e-01 0s 5 9.53127868e+01 -1.69371911e+02 1.33e+01 2.29e-15 7.57e-02 0s 6 8.74119354e+01 -1.23743339e+02 6.94e+00 3.30e-15 5.74e-02 0s 7 5.54781627e+01 -1.18647947e+02 2.92e+00 3.52e-15 4.58e-02 0s 8 2.48792177e+01 -3.48404308e+01 1.10e+00 2.34e-15 1.56e-02 0s 9 1.49519550e+01 -8.21471006e-01 3.48e-01 2.40e-15 4.11e-03 0s 10 1.39768282e+01 7.90858643e+00 1.94e-01 2.24e-15 1.58e-03 0s 11 1.29779834e+01 1.08162220e+01 2.34e-03 3.11e-15 5.50e-04 0s 12 1.25610614e+01 1.22644098e+01 2.67e-04 2.66e-15 7.54e-05 0s 13 1.25002560e+01 1.24970603e+01 2.97e-07 2.72e-15 8.12e-07 0s 14 1.25000000e+01 1.25000000e+01 2.64e-13 2.73e-15 8.51e-13 0s Barrier solved model in 14 iterations and 0.03 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 1419 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 12.50000 0 44 73.00000 12.50000 82.9% - 0s H 0 0 16.0000000 12.50000 21.9% - 0s H 0 0 15.0000000 12.50000 16.7% - 0s H 0 0 13.0000000 12.50000 3.85% - 0s Explored 0 nodes (2039 simplex iterations) in 0.18 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.300000000000e+01, best bound 1.300000000000e+01, gap 0.0% Preprocessing time: 0.22 seconds Gurobi run time: 0.18 seconds Total run time: 0.40 seconds Objective: 13 Solution: 1 x [1, 5, 12, 17, 19, 29, 33, 33] 2 x [5, 13, 17, 20, 25, 26, 35, 38] 1 x [5, 22, 23, 27, 28, 29, 29, 38] 2 x [2, 4, 7, 8, 10, 14, 15, 24] 1 x [1, 4, 6, 27, 32, 37] 1 x [3, 6, 8, 25, 28, 28, 30] 1 x [1, 3, 3, 8, 8, 29, 32, 33] 1 x [9, 12, 16, 17, 21, 25, 35, 38] 2 x [11, 12, 18, 20, 26, 31, 34, 36] 1 x [9, 14, 20, 24, 26, 30, 30]