Build (method = -2) #dp: 3723 Step-3' Graph: 172 vertices and 575 arcs (0.02s) Step-4' Graph: 107 vertices and 445 arcs (0.02s) #V4/#V3 = 0.62 #A4/#A3 = 0.77 Ready! (0.02s) Optimize a model with 117 rows, 446 columns and 1132 nonzeros Presolve removed 26 rows and 50 columns Presolve time: 0.00s Presolved: 91 rows, 396 columns, 1060 nonzeros Variable types: 0 continuous, 396 integer (44 binary) Found heuristic solution: objective 72.0000000 Optimize a model with 91 rows, 396 columns and 1060 nonzeros Presolved: 91 rows, 396 columns, 1060 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.820e+02 Factor NZ : 1.711e+03 Factor Ops : 3.631e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.33739620e+03 -8.57201413e+03 1.06e+04 1.15e-01 9.80e+01 0s 1 3.63279927e+02 -4.40341689e+03 1.67e+03 7.77e-16 1.77e+01 0s 2 1.44962015e+02 -1.46076497e+03 2.13e+02 7.22e-16 3.16e+00 0s 3 1.06874280e+02 -2.17401880e+02 1.39e+01 1.44e-15 4.45e-01 0s 4 6.14683461e+01 -8.23800039e+01 3.97e+00 6.66e-16 1.87e-01 0s 5 3.60596946e+01 -2.97668479e+01 1.97e+00 5.13e-16 8.51e-02 0s 6 2.00548485e+01 -1.09721968e+01 8.23e-01 3.75e-16 3.98e-02 0s 7 1.56376988e+01 3.69536686e-01 4.13e-01 3.96e-16 1.95e-02 0s 8 1.44130023e+01 1.02952084e+01 1.61e-01 2.33e-16 5.25e-03 0s 9 1.42100063e+01 1.10275245e+01 1.21e-01 2.35e-16 4.04e-03 0s 10 1.25564614e+01 1.23094379e+01 2.18e-14 2.49e-16 3.09e-04 0s 11 1.25009850e+01 1.24996667e+01 1.86e-14 2.17e-16 1.65e-06 0s 12 1.25000010e+01 1.24999997e+01 2.97e-14 3.33e-16 1.65e-09 0s 13 1.25000000e+01 1.25000000e+01 4.57e-14 3.38e-16 1.69e-15 0s Barrier solved model in 13 iterations and 0.00 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 227 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 12.50000 0 23 72.00000 12.50000 82.6% - 0s H 0 0 15.0000000 12.50000 16.7% - 0s H 0 0 14.0000000 12.50000 10.7% - 0s H 0 0 13.0000000 12.50000 3.85% - 0s Explored 0 nodes (321 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.300000000000e+01, best bound 1.300000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.02 seconds Total run time: 0.05 seconds Objective: 13 Solution: 4 x [1, 4, 4, 4, 5, 6, 6, 10] 1 x [1, 1, 1, 4, 5, 8, 9, 9] 1 x [1, 1, 3, 4, 4, 5, 5, 9] 5 x [2, 5, 5, 6, 6, 9, 9, 10] 1 x [1, 7, 7, 9, 10, 10] 1 x [6, 7, 7, 10, 10, 10]