Build (method = -2) #dp: 8146 Step-3' Graph: 1092 vertices and 3269 arcs (0.06s) Step-4' Graph: 818 vertices and 2721 arcs (0.06s) #V4/#V3 = 0.75 #A4/#A3 = 0.83 Ready! (0.06s) Optimize a model with 837 rows, 2722 columns and 6534 nonzeros Presolve removed 259 rows and 509 columns Presolve time: 0.06s Presolved: 578 rows, 2213 columns, 6189 nonzeros Variable types: 0 continuous, 2213 integer (106 binary) Found heuristic solution: objective 58.0000000 Optimize a model with 578 rows, 2213 columns and 6189 nonzeros Presolved: 578 rows, 2213 columns, 6189 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.141e+03 Factor NZ : 2.528e+04 (roughly 1 MByte of memory) Factor Ops : 1.981e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.41077772e+02 -2.78663356e+04 5.94e+04 8.58e-03 7.02e+01 0s 1 2.54904147e+02 -1.76541114e+04 1.03e+04 8.88e-16 1.42e+01 0s 2 1.24582017e+02 -7.32315526e+03 2.07e+03 8.44e-15 3.40e+00 0s 3 8.56015090e+01 -1.50214671e+03 3.79e+02 2.79e-15 6.39e-01 0s 4 5.36485016e+01 -5.27970903e+02 6.92e+01 1.96e-15 1.77e-01 0s 5 4.26929213e+01 -2.10631674e+02 1.42e+01 1.29e-15 6.44e-02 0s 6 3.83286448e+01 -1.84113765e+02 8.64e+00 1.71e-15 5.43e-02 0s 7 3.48245057e+01 -1.13332885e+02 2.40e+00 1.60e-15 3.43e-02 0s 8 3.15859778e+01 -8.13884027e+01 1.21e+00 1.68e-15 2.59e-02 0s 9 2.65395146e+01 -4.35063138e+01 5.48e-01 1.51e-15 1.59e-02 0s 10 2.41222845e+01 -1.06132332e+01 2.85e-01 1.27e-15 7.89e-03 0s 11 2.25122172e+01 1.52108156e+01 6.40e-02 9.51e-16 1.66e-03 0s 12 2.20016115e+01 2.18936466e+01 1.70e-13 1.22e-15 2.43e-05 0s 13 2.20000000e+01 2.19999995e+01 1.22e-13 8.63e-16 1.20e-10 0s 14 2.20000000e+01 2.20000000e+01 1.39e-13 1.07e-15 1.20e-13 0s Barrier solved model in 14 iterations and 0.06 seconds Optimal objective 2.20000000e+01 Root relaxation: objective 2.200000e+01, 1153 iterations, 0.07 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 22.0000000 22.00000 0.0% - 0s Explored 0 nodes (1420 simplex iterations) in 0.21 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.200000000000e+01, best bound 2.200000000000e+01, gap 0.0% Preprocessing time: 0.08 seconds Gurobi run time: 0.21 seconds Total run time: 0.29 seconds Objective: 22 Solution: 3 x [1, 2, 4, 5, 8, 10, 12] 2 x [1, 2, 4, 5, 9, 12, 14, 16, 18, 19] 4 x [1, 2, 5, 6, 9, 10, 12, 14, 16, 17, 18] 1 x [1, 3, 4, 8, 12, 16, 18, 19] 1 x [1, 3, 4, 12, 16, 18, 19] 1 x [1, 4, 5, 9, 12, 14, 18] 1 x [1, 4, 6, 7, 9, 10, 12, 14, 19] 1 x [1, 4, 6, 7, 9, 12, 13] 1 x [1, 5, 6, 9, 10, 12, 15] 4 x [2, 6, 7, 8, 9, 10, 11, 12, 15, 16] 1 x [2, 6, 7, 8, 9, 12, 14, 15, 16, 17, 18, 19] 1 x [2, 6, 7, 8, 9, 12, 14, 15, 16, 18, 19] 1 x [6, 9, 10, 12, 14, 15, 19]