Build (method = -2) #dp: 4146 Step-3' Graph: 201 vertices and 685 arcs (0.02s) Step-4' Graph: 143 vertices and 569 arcs (0.02s) #V4/#V3 = 0.71 #A4/#A3 = 0.83 Ready! (0.02s) Optimize a model with 153 rows, 570 columns and 1436 nonzeros Presolve removed 55 rows and 103 columns Presolve time: 0.01s Presolved: 98 rows, 467 columns, 1282 nonzeros Variable types: 0 continuous, 467 integer (36 binary) Found heuristic solution: objective 94.0000000 Found heuristic solution: objective 90.0000000 Optimize a model with 98 rows, 467 columns and 1282 nonzeros Presolved: 98 rows, 467 columns, 1282 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.310e+02 Factor NZ : 2.144e+03 Factor Ops : 5.740e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.22848812e+02 -6.00236646e+03 6.47e+03 4.51e-02 4.25e+01 0s 1 2.19354040e+02 -3.02698243e+03 1.16e+03 5.55e-16 8.72e+00 0s 2 1.07059573e+02 -8.91366292e+02 1.46e+02 3.33e-16 1.52e+00 0s 3 8.11810099e+01 -1.34209496e+02 1.23e+01 3.33e-16 2.51e-01 0s 4 4.18423182e+01 -4.92382577e+01 2.61e+00 3.54e-16 1.00e-01 0s 5 2.86475619e+01 -3.21130177e+01 1.55e+00 2.71e-16 6.65e-02 0s 6 2.73803769e+01 -2.79304719e+01 1.47e+00 2.35e-16 6.06e-02 0s 7 2.05918263e+01 -1.24880614e+01 9.68e-01 1.94e-16 3.62e-02 0s 8 1.35186621e+01 -5.45327784e-01 3.71e-01 2.01e-16 1.53e-02 0s 9 1.25082972e+01 6.48567264e+00 2.24e-01 1.69e-16 6.54e-03 0s 10 1.12361915e+01 1.08429325e+01 2.17e-03 2.22e-16 4.18e-04 0s 11 1.11112758e+01 1.11104779e+01 3.04e-14 2.22e-16 8.46e-07 0s 12 1.11111113e+01 1.11111105e+01 5.55e-14 2.22e-16 8.46e-10 0s 13 1.11111111e+01 1.11111111e+01 4.62e-14 3.33e-16 8.92e-16 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 1.11111111e+01 Root relaxation: objective 1.111111e+01, 247 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.11111 0 22 90.00000 11.11111 87.7% - 0s H 0 0 13.0000000 11.11111 14.5% - 0s H 0 0 12.0000000 11.11111 7.41% - 0s Explored 0 nodes (405 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.200000000000e+01, best bound 1.200000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.03 seconds Total run time: 0.06 seconds Objective: 12 Solution: 5 x [1, 2, 3, 3, 6, 6, 8, 9, 10] 1 x [1, 2, 6, 7, 9] 1 x [1, 1, 1, 2, 5, 7, 8, 9] 2 x [2, 2, 5, 5, 7, 7, 9, 9, 10] 1 x [2, 2, 2, 4, 5, 7, 9] 1 x [3, 5, 5, 5, 5, 5, 7, 9, 9] 1 x [5, 5, 5, 5, 5, 7, 9, 9]