Build (method = -2) #dp: 3150 Step-3' Graph: 100 vertices and 301 arcs (0.01s) Step-4' Graph: 49 vertices and 199 arcs (0.01s) #V4/#V3 = 0.49 #A4/#A3 = 0.66 Ready! (0.01s) Optimize a model with 59 rows, 200 columns and 512 nonzeros Presolve removed 22 rows and 43 columns Presolve time: 0.00s Presolved: 37 rows, 157 columns, 432 nonzeros Variable types: 0 continuous, 157 integer (0 binary) Found heuristic solution: objective 98.0000000 Optimize a model with 37 rows, 157 columns and 432 nonzeros Presolved: 37 rows, 157 columns, 432 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.170e+02 Factor NZ : 5.590e+02 Factor Ops : 1.023e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.71125547e+02 -2.04929356e+03 1.33e+03 2.22e-16 4.13e+01 0s 1 1.69075172e+02 -8.52128247e+02 1.56e+02 4.44e-16 6.19e+00 0s 2 7.14042197e+01 -1.56556891e+02 4.98e+00 4.44e-16 7.50e-01 0s 3 3.14576905e+01 -1.25832946e+01 5.75e-01 3.05e-16 1.38e-01 0s 4 1.74075425e+01 5.37309911e+00 1.64e-01 1.74e-16 3.75e-02 0s 5 1.56096333e+01 1.23472665e+01 5.82e-02 2.91e-16 1.01e-02 0s 6 1.43078155e+01 1.42302706e+01 1.75e-04 1.73e-16 2.39e-04 0s 7 1.42857153e+01 1.42857103e+01 5.41e-09 2.22e-16 1.55e-08 0s 8 1.42857143e+01 1.42857143e+01 3.27e-14 2.22e-16 1.55e-11 0s Barrier solved model in 8 iterations and 0.00 seconds Optimal objective 1.42857143e+01 Root relaxation: objective 1.428571e+01, 106 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 14.28571 0 18 98.00000 14.28571 85.4% - 0s H 0 0 16.0000000 14.28571 10.7% - 0s H 0 0 15.0000000 14.28571 4.76% - 0s Explored 0 nodes (144 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.500000000000e+01, best bound 1.500000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.01 seconds Total run time: 0.03 seconds Objective: 15 Solution: 3 x [1, 1, 4, 5, 7, 8, 10] 7 x [1, 2, 2, 6, 6, 9, 10] 1 x [1, 4, 6, 6, 8, 9, 10] 1 x [1, 1, 5, 6, 6, 8, 10] 1 x [1, 1, 5] 1 x [2, 3, 4, 6, 8, 10] 1 x [2, 3, 3, 4, 6, 8, 10]