Build (method = -2) #dp: 7641 Step-3' Graph: 1108 vertices and 3317 arcs (0.05s) Step-4' Graph: 762 vertices and 2625 arcs (0.05s) #V4/#V3 = 0.69 #A4/#A3 = 0.79 Ready! (0.05s) Optimize a model with 781 rows, 2626 columns and 6358 nonzeros Presolve removed 203 rows and 388 columns Presolve time: 0.06s Presolved: 578 rows, 2238 columns, 6118 nonzeros Variable types: 0 continuous, 2238 integer (274 binary) Optimize a model with 578 rows, 2238 columns and 6118 nonzeros Presolved: 578 rows, 2238 columns, 6118 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.115e+03 Factor NZ : 2.552e+04 (roughly 1 MByte of memory) Factor Ops : 2.147e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.35463455e+02 -2.19244044e+04 4.53e+04 1.43e-02 5.33e+01 0s 1 1.95493556e+02 -1.33689849e+04 6.34e+03 5.20e-02 9.27e+00 0s 2 1.04348149e+02 -5.36831024e+03 1.08e+03 1.45e-03 2.14e+00 0s 3 7.79022666e+01 -1.26351793e+03 1.52e+02 3.33e-15 4.07e-01 0s 4 6.50319117e+01 -5.41516813e+02 3.00e+01 1.78e-15 1.53e-01 0s 5 5.41639574e+01 -3.60637708e+02 1.26e+01 8.88e-16 9.89e-02 0s 6 4.12965731e+01 -2.27902642e+02 3.40e+00 5.27e-16 6.16e-02 0s 7 3.75276824e+01 -1.76204771e+02 1.61e+00 3.71e-16 4.84e-02 0s 8 3.12769564e+01 -5.98222646e+01 4.48e-01 4.98e-16 2.05e-02 0s 9 2.92412468e+01 2.47078087e+01 2.50e-03 4.79e-16 1.01e-03 0s 10 2.90015707e+01 2.89872513e+01 7.42e-06 3.84e-16 3.21e-06 0s 11 2.90000000e+01 2.90000000e+01 1.04e-11 4.68e-16 4.44e-12 0s Barrier solved model in 11 iterations and 0.05 seconds Optimal objective 2.90000000e+01 Root relaxation: objective 2.900000e+01, 1070 iterations, 0.06 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 29.00000 0 26 - 29.00000 - - 0s H 0 0 29.0000000 29.00000 0.0% - 0s Explored 0 nodes (1505 simplex iterations) in 0.29 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.07 seconds Gurobi run time: 0.29 seconds Total run time: 0.35 seconds Objective: 29 Solution: 5 x [1, 3, 4, 5, 8, 13, 16] 3 x [1, 3, 5, 9, 12, 13, 15, 16, 18, 19] 1 x [1, 3, 5, 9, 12, 15, 16, 18, 19] 1 x [1, 3, 11, 16] 1 x [1, 3, 16, 17] 3 x [1, 4, 7, 9, 10, 16, 19] 1 x [1, 4, 7, 9, 16, 19] 1 x [1, 16, 19] 3 x [2, 4, 8, 9, 10, 12, 14, 15, 16] 1 x [2, 4, 9, 10, 12, 14, 15, 16] 2 x [2, 4, 9, 16] 1 x [3, 4, 5, 6, 16, 17, 18, 19] 1 x [3, 4, 6, 9, 16, 17, 19] 1 x [3, 4, 6, 16, 17, 18, 19] 1 x [3, 4, 6, 16, 17, 19] 2 x [9, 12, 16, 17, 18, 19] 1 x [9, 16, 17, 18, 19]