Build (method = -2) #dp: 6484 Step-3' Graph: 956 vertices and 2861 arcs (0.04s) Step-4' Graph: 682 vertices and 2313 arcs (0.05s) #V4/#V3 = 0.71 #A4/#A3 = 0.81 Ready! (0.05s) Optimize a model with 700 rows, 2314 columns and 5582 nonzeros Presolve removed 193 rows and 372 columns Presolve time: 0.03s Presolved: 507 rows, 1942 columns, 5347 nonzeros Variable types: 0 continuous, 1942 integer (0 binary) Optimize a model with 507 rows, 1942 columns and 5347 nonzeros Presolved: 507 rows, 1942 columns, 5347 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.558e+03 Factor NZ : 2.096e+04 (roughly 1 MByte of memory) Factor Ops : 1.425e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.22194168e+03 -2.18203733e+05 4.25e+05 1.44e-02 5.99e+02 0s 1 2.21588564e+03 -1.33007958e+05 7.14e+04 4.51e-02 1.19e+02 0s 2 1.03103256e+03 -4.83029071e+04 1.25e+04 1.11e-15 2.55e+01 0s 3 6.93942265e+02 -9.68377083e+03 1.35e+03 1.03e-15 3.79e+00 0s 4 5.33436435e+02 -2.91051823e+03 2.84e+02 1.33e-15 1.06e+00 0s 5 4.51151782e+02 -1.75336961e+03 9.79e+01 7.36e-16 6.15e-01 0s 6 3.73871202e+02 -9.92938381e+02 4.10e+01 8.26e-16 3.67e-01 0s 7 3.16898061e+02 -4.88407442e+02 2.55e+01 5.88e-16 2.15e-01 0s 8 2.85443006e+02 -1.06069270e+02 1.28e+01 5.82e-16 1.04e-01 0s 9 2.59427550e+02 1.09242634e+02 6.22e+00 5.29e-16 3.99e-02 0s 10 2.43553516e+02 1.71919157e+02 3.35e+00 5.34e-16 1.91e-02 0s 11 2.33557776e+02 2.09066835e+02 5.83e-01 3.27e-16 6.45e-03 0s 12 2.33116803e+02 2.32873689e+02 1.21e-10 3.76e-16 6.27e-05 0s 13 2.33000117e+02 2.32999874e+02 8.36e-10 3.73e-16 6.27e-08 0s 14 2.33000000e+02 2.33000000e+02 9.37e-11 4.41e-16 6.27e-11 0s 15 2.33000000e+02 2.33000000e+02 3.48e-12 6.96e-16 6.27e-14 0s Barrier solved model in 15 iterations and 0.06 seconds Optimal objective 2.33000000e+02 Root relaxation: objective 2.330000e+02, 979 iterations, 0.07 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 233.0000000 233.00000 0.0% - 0s Explored 0 nodes (979 simplex iterations) in 0.16 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.330000000000e+02, best bound 2.330000000000e+02, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.16 seconds Total run time: 0.22 seconds Objective: 233 Solution: 20 x [1, 2, 4, 6, 8, 9, 16, 18] 64 x [1, 2, 4, 6, 8, 11, 12, 16] 6 x [1, 2, 4, 11, 13, 14, 16, 17, 18] 10 x [1, 3, 6, 7, 11, 14, 16, 17, 18] 1 x [1, 3, 6, 7, 11, 14, 16, 18] 1 x [1, 3, 7, 11, 14, 16, 18] 13 x [1, 4, 5, 6, 8, 11, 12, 16, 18] 2 x [1, 4, 5, 6, 11, 14, 16] 31 x [1, 4, 5, 8, 9, 12, 14, 16, 18] 37 x [1, 4, 6, 8, 9, 12, 14, 16, 17, 18] 4 x [1, 4, 6, 8, 11, 13, 14, 16, 18] 2 x [1, 4, 6, 8, 11, 15, 16] 5 x [1, 4, 6, 8, 11, 16, 18] 3 x [1, 4, 11, 13, 14, 16, 17, 18] 2 x [1, 6, 9, 10, 11, 16] 4 x [1, 6, 9, 10, 11, 16, 18] 2 x [1, 6, 9, 10, 14, 16, 17, 18] 2 x [1, 6, 9, 10, 14, 16, 18] 2 x [1, 7, 11, 16, 17, 18] 4 x [2, 3, 4, 5, 10, 12, 14, 16, 18] 9 x [2, 3, 4, 5, 10, 14, 16, 18] 9 x [2, 6, 7, 9, 11, 13, 14, 16, 17, 18]