Build (method = -2) #dp: 1842 Step-3' Graph: 78 vertices and 229 arcs (0.01s) Step-4' Graph: 28 vertices and 129 arcs (0.01s) #V4/#V3 = 0.36 #A4/#A3 = 0.56 Ready! (0.01s) Optimize a model with 38 rows, 130 columns and 341 nonzeros Presolve removed 11 rows and 21 columns Presolve time: 0.00s Presolved: 27 rows, 109 columns, 300 nonzeros Variable types: 0 continuous, 109 integer (6 binary) Found heuristic solution: objective 104.0000000 Found heuristic solution: objective 93.0000000 Found heuristic solution: objective 57.0000000 Optimize a model with 27 rows, 109 columns and 300 nonzeros Presolved: 27 rows, 109 columns, 300 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.340e+02 Factor NZ : 2.900e+02 Factor Ops : 3.762e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.92829415e+02 -1.44606108e+03 5.37e+02 7.71e-02 3.68e+01 0s 1 1.63915357e+02 -6.09682893e+02 5.97e+01 5.55e-16 5.83e+00 0s 2 5.87348070e+01 -1.23061295e+02 1.11e+00 7.77e-16 8.22e-01 0s 3 2.19503017e+01 -4.85991999e+00 1.35e-01 2.22e-16 1.19e-01 0s 4 1.65008069e+01 1.05382785e+01 3.34e-02 2.05e-16 2.63e-02 0s 5 1.50051343e+01 1.40487487e+01 1.20e-02 1.80e-16 4.21e-03 0s 6 1.42865794e+01 1.42809198e+01 1.47e-08 1.54e-16 2.49e-05 0s 7 1.42857143e+01 1.42857143e+01 2.75e-14 6.55e-17 3.11e-11 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.42857143e+01 Root relaxation: objective 1.428571e+01, 77 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 12 57.00000 14.28571 74.9% - 0s H 0 0 16.0000000 14.28571 10.7% - 0s H 0 0 15.0000000 14.28571 4.76% - 0s Explored 0 nodes (91 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.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.02 seconds Objective: 15 Solution: 1 x [1, 1, 2, 5, 6, 8, 9] 7 x [1, 2, 3, 3, 6, 7, 9] 1 x [6, 9] 2 x [4, 7, 8, 9, 9, 9, 10] 1 x [1, 2, 3, 3, 4, 8, 10] 3 x [1, 1, 1, 1, 2, 3, 4]