Build (method = -2) #dp: 18541 Step-3' Graph: 359 vertices and 1656 arcs (0.10s) Step-4' Graph: 267 vertices and 1472 arcs (0.10s) #V4/#V3 = 0.74 #A4/#A3 = 0.89 Ready! (0.10s) Optimize a model with 285 rows, 1473 columns and 3895 nonzeros Presolve removed 48 rows and 92 columns Presolve time: 0.01s Presolved: 237 rows, 1381 columns, 3783 nonzeros Variable types: 0 continuous, 1381 integer (0 binary) Found heuristic solution: objective 176.0000000 Optimize a model with 237 rows, 1381 columns and 3783 nonzeros Presolved: 237 rows, 1381 columns, 3783 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.188e+03 Factor NZ : 7.108e+03 Factor Ops : 2.511e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.42622019e+03 -3.14991601e+04 3.02e+04 2.22e-16 9.78e+01 0s 1 5.87827863e+02 -1.36640669e+04 4.25e+03 6.66e-16 1.59e+01 0s 2 2.85151620e+02 -5.75687898e+03 9.86e+02 1.22e-15 4.27e+00 0s 3 2.07727141e+02 -1.57058061e+03 1.61e+02 2.00e-15 8.97e-01 0s 4 1.70771140e+02 -4.23221377e+02 5.47e+00 3.11e-15 2.19e-01 0s 5 1.29414549e+02 -2.48805034e+02 3.07e+00 1.78e-15 1.38e-01 0s 6 1.09507034e+02 -1.79926076e+02 2.35e+00 1.44e-15 1.06e-01 0s 7 8.36763757e+01 -1.19306200e+02 1.50e+00 1.33e-15 7.39e-02 0s 8 5.74661799e+01 -4.81154764e+01 8.77e-01 1.21e-15 3.84e-02 0s 9 4.25031809e+01 -6.55302519e+00 4.93e-01 1.01e-15 1.79e-02 0s 10 3.31796018e+01 1.72896790e+01 2.58e-01 8.28e-16 5.82e-03 0s 11 3.04660498e+01 2.34796637e+01 1.20e-01 9.43e-16 2.55e-03 0s 12 2.89840037e+01 2.78492564e+01 3.23e-04 1.36e-15 4.08e-04 0s 13 2.88416286e+01 2.83572533e+01 2.20e-04 1.27e-15 1.74e-04 0s 14 2.85742981e+01 2.85407150e+01 9.35e-07 8.86e-16 1.21e-05 0s 15 2.85714286e+01 2.85714281e+01 7.75e-13 9.80e-16 1.84e-10 0s 16 2.85714286e+01 2.85714286e+01 1.92e-13 7.86e-16 1.84e-13 0s Barrier solved model in 16 iterations and 0.02 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 989 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.57143 0 17 176.00000 28.57143 83.8% - 0s H 0 0 29.0000000 28.57143 1.48% - 0s Explored 0 nodes (1582 simplex iterations) in 0.10 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.900000000000e+01, best bound 2.900000000000e+01, gap 0.0% Preprocessing time: 0.11 seconds Gurobi run time: 0.10 seconds Total run time: 0.21 seconds Objective: 29 Solution: 1 x [2, 3, 4, 13, 18, 18] 1 x [2, 3, 3, 4, 13, 18, 18] 5 x [3, 4, 4, 6, 10, 18, 18] 2 x [5, 5, 6, 8, 12, 13, 16] 1 x [4, 6, 13, 13, 15, 16] 1 x [1, 7, 7, 8, 9, 10, 16] 1 x [1, 1, 7, 7, 10, 12, 16] 2 x [1, 7, 7, 8, 9, 16, 17] 5 x [1, 1, 7, 9, 12, 15, 16] 1 x [4, 4, 11, 13, 15, 16] 1 x [4, 4, 11, 11, 13, 15, 16] 4 x [3, 5, 5, 8, 13, 14, 16] 4 x [3, 5, 5, 8, 13, 16, 18]