Build (method = -2) #dp: 11980 Step-3' Graph: 163 vertices and 631 arcs (0.07s) Step-4' Graph: 94 vertices and 493 arcs (0.07s) #V4/#V3 = 0.58 #A4/#A3 = 0.78 Ready! (0.07s) Optimize a model with 113 rows, 494 columns and 1303 nonzeros Presolve removed 16 rows and 31 columns Presolve time: 0.00s Presolved: 97 rows, 463 columns, 1252 nonzeros Variable types: 0 continuous, 463 integer (0 binary) Found heuristic solution: objective 183.0000000 Optimize a model with 97 rows, 463 columns and 1252 nonzeros Presolved: 97 rows, 463 columns, 1252 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.160e+02 Factor NZ : 2.048e+03 Factor Ops : 5.054e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.20934746e+03 -9.98527025e+03 7.43e+03 2.22e-16 7.83e+01 0s 1 5.14613359e+02 -3.93168565e+03 9.75e+02 6.66e-16 1.20e+01 0s 2 2.11397798e+02 -1.29669159e+03 1.05e+02 4.44e-16 2.16e+00 0s 3 1.35033450e+02 -3.03759573e+02 4.65e+00 3.33e-16 4.77e-01 0s 4 6.67226379e+01 -1.03549906e+02 1.06e+00 2.78e-16 1.82e-01 0s 5 4.53880575e+01 -4.77682311e+01 4.69e-01 2.95e-16 9.93e-02 0s 6 3.91850817e+01 1.15758777e+01 3.03e-01 2.59e-16 2.95e-02 0s 7 3.62176500e+01 2.70863472e+01 1.32e-01 3.33e-16 9.74e-03 0s 8 3.36548466e+01 3.28682077e+01 4.35e-04 3.33e-16 8.33e-04 0s 9 3.33342205e+01 3.33268189e+01 5.00e-06 3.33e-16 7.83e-06 0s 10 3.33333342e+01 3.33333268e+01 5.08e-14 2.72e-16 7.83e-09 0s 11 3.33333333e+01 3.33333333e+01 6.58e-14 2.22e-16 7.83e-12 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 327 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 33.33333 0 13 183.00000 33.33333 81.8% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (462 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.400000000000e+01, best bound 3.400000000000e+01, gap 0.0% Preprocessing time: 0.08 seconds Gurobi run time: 0.02 seconds Total run time: 0.10 seconds Objective: 34 Solution: 2 x [1, 4, 5, 7, 8, 18] 6 x [1, 3, 5, 7, 16, 18] 1 x [1, 3, 4, 8, 8, 14] 2 x [1, 11, 11, 13, 14, 18] 1 x [5, 6, 9, 10, 12, 15] 2 x [5, 8, 10, 10, 15, 17] 6 x [6, 9, 12, 12, 15, 15] 2 x [5, 6, 6, 9, 10, 17] 1 x [6, 10, 10, 17, 17, 19] 1 x [6, 10, 10, 13, 19, 19] 1 x [6, 10, 10, 16, 19, 19] 8 x [2, 8, 13, 14, 17, 18] 1 x [8, 17]