Build (method = -2) #dp: 383 Step-3' Graph: 43 vertices and 120 arcs (0.00s) Step-4' Graph: 8 vertices and 50 arcs (0.00s) #V4/#V3 = 0.19 #A4/#A3 = 0.42 Ready! (0.00s) Optimize a model with 18 rows, 51 columns and 143 nonzeros Presolve removed 3 rows and 4 columns Presolve time: 0.00s Presolved: 15 rows, 47 columns, 135 nonzeros Variable types: 0 continuous, 47 integer (0 binary) Found heuristic solution: objective 58.0000000 Found heuristic solution: objective 53.0000000 Optimize a model with 15 rows, 47 columns and 135 nonzeros Presolved: 15 rows, 47 columns, 135 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.000e+01 Factor NZ : 1.200e+02 Factor Ops : 1.240e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.83429219e+02 -4.87443719e+02 6.41e+01 2.22e-16 1.83e+01 0s 1 7.67662384e+01 -1.56487096e+02 2.13e-14 4.44e-16 2.31e+00 0s 2 3.84583865e+01 -1.39202187e+01 7.11e-15 2.78e-16 5.09e-01 0s 3 2.59430899e+01 2.11360237e+01 7.99e-15 1.11e-16 4.62e-02 0s 4 2.50433331e+01 2.48431728e+01 6.39e-15 4.44e-16 1.92e-03 0s 5 2.50000069e+01 2.49999834e+01 3.91e-15 2.22e-16 2.26e-07 0s 6 2.50000000e+01 2.50000000e+01 1.69e-12 1.11e-16 2.26e-13 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 38 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 25.0000000 25.00000 0.0% - 0s Explored 0 nodes (38 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+01, best bound 2.500000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 25 Solution: 3 x [2, 6, 6, 10] 1 x [2, 5, 6, 6] 3 x [3, 4, 7, 9] 6 x [3, 3, 4, 8] 10 x [1, 4, 6, 9] 2 x [4, 5, 7, 9]