Build (method = -2) #dp: 3369 Step-3' Graph: 100 vertices and 306 arcs (0.02s) Step-4' Graph: 48 vertices and 202 arcs (0.02s) #V4/#V3 = 0.48 #A4/#A3 = 0.66 Ready! (0.02s) Optimize a model with 58 rows, 203 columns and 523 nonzeros Presolve removed 20 rows and 39 columns Presolve time: 0.00s Presolved: 38 rows, 164 columns, 447 nonzeros Variable types: 0 continuous, 164 integer (0 binary) Found heuristic solution: objective 96.0000000 Optimize a model with 38 rows, 164 columns and 447 nonzeros Presolved: 38 rows, 164 columns, 447 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.210e+02 Factor NZ : 5.090e+02 Factor Ops : 7.979e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.69407558e+02 -2.89151572e+03 1.93e+03 2.22e-16 5.24e+01 0s 1 2.18225152e+02 -1.07475203e+03 3.12e+02 4.44e-16 9.04e+00 0s 2 8.43183228e+01 -3.38228691e+02 2.32e+01 5.55e-16 1.49e+00 0s 3 4.04750807e+01 -6.14337547e+01 6.57e-14 4.44e-16 3.02e-01 0s 4 2.02638067e+01 -4.48444667e+00 2.04e-14 2.22e-16 7.32e-02 0s 5 1.69626994e+01 5.90690141e+00 3.43e-14 3.33e-16 3.27e-02 0s 6 1.51538490e+01 1.21819604e+01 2.21e-14 2.35e-16 8.79e-03 0s 7 1.43217755e+01 1.42535069e+01 1.65e-14 2.22e-16 2.02e-04 0s 8 1.42857504e+01 1.42856821e+01 1.82e-14 3.33e-16 2.02e-07 0s 9 1.42857143e+01 1.42857143e+01 1.62e-13 2.68e-16 2.02e-13 0s Barrier solved model in 9 iterations and 0.00 seconds Optimal objective 1.42857143e+01 Root relaxation: objective 1.428571e+01, 107 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 24 96.00000 14.28571 85.1% - 0s H 0 0 15.0000000 14.28571 4.76% - 0s Explored 0 nodes (135 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: 4 x [4, 5, 6, 6, 7, 8, 9] 1 x [2, 3, 4, 5, 6, 9] 1 x [5, 6, 7, 10, 10] 6 x [4, 5, 5, 7, 9, 10, 10] 2 x [1, 2, 3, 3, 3, 7, 10] 1 x [1, 1, 1, 1, 7]