Build (method = -2) #dp: 5944 Step-3' Graph: 264 vertices and 1116 arcs (0.03s) Step-4' Graph: 220 vertices and 1028 arcs (0.03s) #V4/#V3 = 0.83 #A4/#A3 = 0.92 Ready! (0.03s) Optimize a model with 230 rows, 1029 columns and 2659 nonzeros Presolve removed 54 rows and 100 columns Presolve time: 0.01s Presolved: 176 rows, 929 columns, 2526 nonzeros Variable types: 0 continuous, 929 integer (0 binary) Found heuristic solution: objective 82.0000000 Found heuristic solution: objective 61.0000000 Found heuristic solution: objective 57.0000000 Optimize a model with 176 rows, 929 columns and 2526 nonzeros Presolved: 176 rows, 929 columns, 2526 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.423e+03 Factor NZ : 4.714e+03 Factor Ops : 1.546e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.97985134e+02 -1.38510071e+04 1.10e+04 2.22e-16 4.62e+01 0s 1 2.17129741e+02 -6.93715452e+03 1.89e+03 5.55e-16 9.52e+00 0s 2 1.39058037e+02 -2.74237729e+03 5.21e+02 4.66e-15 2.82e+00 0s 3 1.03280527e+02 -7.09292002e+02 3.58e+01 4.22e-15 5.01e-01 0s 4 9.85649186e+01 -3.26601328e+02 3.90e-01 3.33e-15 2.28e-01 0s 5 7.82195292e+01 -3.19106082e+02 1.64e-01 3.22e-15 2.13e-01 0s 6 5.44832354e+01 -1.62980642e+02 1.12e-12 1.89e-15 1.16e-01 0s 7 3.57113038e+01 -6.92366094e+01 6.37e-13 9.99e-16 5.62e-02 0s 8 2.58273986e+01 -1.79825614e+01 3.91e-13 5.43e-16 2.35e-02 0s 9 1.74644827e+01 -2.98721477e+00 2.38e-13 5.58e-16 1.09e-02 0s 10 1.50579538e+01 4.22507257e+00 1.69e-13 4.97e-16 5.80e-03 0s 11 1.19716990e+01 8.89167093e+00 7.44e-14 5.67e-16 1.65e-03 0s 12 1.15133942e+01 1.04686711e+01 2.19e-13 5.79e-16 5.59e-04 0s 13 1.11250581e+01 1.10422939e+01 1.86e-13 4.37e-16 4.43e-05 0s 14 1.11111255e+01 1.11110689e+01 5.01e-13 5.12e-16 3.03e-08 0s 15 1.11111111e+01 1.11111111e+01 4.15e-13 4.34e-16 3.04e-14 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 1.11111111e+01 Root relaxation: objective 1.111111e+01, 524 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.11111 0 35 57.00000 11.11111 80.5% - 0s H 0 0 12.0000000 11.11111 7.41% - 0s Explored 0 nodes (1067 simplex iterations) in 0.07 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.04 seconds Gurobi run time: 0.07 seconds Total run time: 0.11 seconds Objective: 12 Solution: 2 x [1, 1, 4, 5, 6, 8, 9, 10, 10] 1 x [4, 5, 6, 7, 8, 8, 9, 10] 1 x [1, 1, 5, 6, 6, 7, 8, 8, 9] 1 x [3, 4, 5] 5 x [1, 1, 3, 3, 3, 6, 7, 7, 8] 1 x [2, 4, 4, 4, 4, 4, 8, 10] 1 x [2, 2, 4, 4, 4, 4, 4, 8, 10]