Build (method = -2) #dp: 387 Step-3' Graph: 41 vertices and 113 arcs (0.00s) Step-4' Graph: 6 vertices and 43 arcs (0.00s) #V4/#V3 = 0.15 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 16 rows, 44 columns and 127 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 14 rows, 42 columns, 123 nonzeros Variable types: 0 continuous, 42 integer (0 binary) Found heuristic solution: objective 97.0000000 Optimize a model with 14 rows, 42 columns and 123 nonzeros Presolved: 14 rows, 42 columns, 123 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.500e+01 Factor NZ : 1.050e+02 Factor Ops : 1.015e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.45986605e+02 -4.34074828e+02 2.96e+01 1.11e-16 1.75e+01 0s 1 6.43372327e+01 -1.58761853e+02 2.84e-14 2.78e-16 2.46e+00 0s 2 3.67679498e+01 -8.90256054e+00 1.15e-14 2.22e-16 4.91e-01 0s 3 2.52322573e+01 2.14865224e+01 1.93e-14 1.11e-16 3.98e-02 0s 4 2.50010670e+01 2.49728546e+01 7.07e-15 2.22e-16 3.00e-04 0s 5 2.50000000e+01 2.50000000e+01 6.45e-15 2.22e-16 3.07e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 34 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 (34 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 [3, 5, 7, 8] 2 x [4, 6, 7, 8] 1 x [3, 7, 8, 10] 12 x [1, 2, 3, 4] 7 x [6, 9, 10, 10]