Build (method = -2) #dp: 582 Step-3' Graph: 47 vertices and 132 arcs (0.00s) Step-4' Graph: 10 vertices and 58 arcs (0.00s) #V4/#V3 = 0.21 #A4/#A3 = 0.44 Ready! (0.00s) Optimize a model with 19 rows, 59 columns and 163 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 17 rows, 57 columns, 159 nonzeros Variable types: 0 continuous, 57 integer (0 binary) Found heuristic solution: objective 96.0000000 Found heuristic solution: objective 93.0000000 Optimize a model with 17 rows, 57 columns and 159 nonzeros Presolved: 17 rows, 57 columns, 159 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.500e+01 Factor NZ : 1.530e+02 Factor Ops : 1.785e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.49132485e+02 -7.05630753e+02 1.28e+02 1.11e-16 2.29e+01 0s 1 1.02110746e+02 -2.53368808e+02 3.76e+00 5.55e-16 3.26e+00 0s 2 4.49432411e+01 -1.85481935e+01 5.28e-02 5.55e-16 5.24e-01 0s 3 2.35625108e+01 5.49621401e+00 9.97e-03 1.39e-16 1.47e-01 0s 4 2.02880866e+01 1.90105010e+01 8.46e-04 2.29e-16 1.04e-02 0s 5 2.00020293e+01 1.99917951e+01 7.08e-15 1.11e-16 8.32e-05 0s 6 2.00000020e+01 1.99999918e+01 1.32e-14 2.22e-16 8.32e-08 0s 7 2.00000000e+01 2.00000000e+01 1.60e-14 2.22e-16 8.35e-14 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 43 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 20.0000000 20.00000 0.0% - 0s Explored 0 nodes (43 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 20 Solution: 4 x [1, 4, 5, 5, 7] 2 x [2, 4, 5, 6, 9] 11 x [1, 2, 5, 6, 8] 1 x [2, 3, 4, 5, 9] 1 x [1, 2, 2, 4, 5] 1 x [2, 3, 4, 5, 5]