Build (method = -2) #dp: 1451 Step-3' Graph: 142 vertices and 528 arcs (0.01s) Step-4' Graph: 101 vertices and 446 arcs (0.01s) #V4/#V3 = 0.71 #A4/#A3 = 0.84 Ready! (0.01s) Optimize a model with 110 rows, 447 columns and 1150 nonzeros Presolve removed 28 rows and 51 columns Presolve time: 0.01s Presolved: 82 rows, 396 columns, 1081 nonzeros Variable types: 0 continuous, 396 integer (51 binary) Found heuristic solution: objective 74.0000000 Optimize a model with 82 rows, 396 columns and 1081 nonzeros Presolved: 82 rows, 396 columns, 1081 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.130e+02 Factor NZ : 1.681e+03 Factor Ops : 4.297e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.66181711e+02 -5.32518631e+03 6.17e+03 1.11e-01 4.97e+01 0s 1 2.28198440e+02 -2.41690754e+03 1.03e+03 2.00e-15 9.13e+00 0s 2 9.98803636e+01 -6.87715360e+02 1.34e+02 1.17e-15 1.53e+00 0s 3 6.42153684e+01 -1.10848114e+02 4.85e+00 1.28e-15 2.31e-01 0s 4 4.01674056e+01 -4.15120181e+01 1.94e+00 9.51e-16 1.06e-01 0s 5 2.20555835e+01 -7.08307589e+00 7.76e-01 9.35e-16 3.76e-02 0s 6 1.58028756e+01 1.12173639e-01 4.17e-01 1.50e-15 2.02e-02 0s 7 1.58767838e+01 1.90279561e+00 3.71e-01 1.50e-15 1.80e-02 0s 8 1.36786777e+01 9.67056082e+00 1.38e-01 1.20e-15 5.13e-03 0s 9 1.28677041e+01 1.15790841e+01 2.13e-02 8.84e-16 1.63e-03 0s 10 1.25080016e+01 1.24883059e+01 2.34e-04 9.19e-16 2.48e-05 0s 11 1.25000081e+01 1.24999883e+01 6.93e-14 1.38e-15 2.48e-08 0s 12 1.25000000e+01 1.25000000e+01 1.07e-13 1.22e-15 2.48e-11 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 175 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 15 74.00000 12.50000 83.1% - 0s H 0 0 14.0000000 12.50000 10.7% - 0s H 0 0 13.0000000 12.50000 3.85% - 0s Explored 0 nodes (271 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.01 seconds Gurobi run time: 0.02 seconds Total run time: 0.04 seconds Objective: 13 Solution: 4 x [1, 3, 3, 3, 3, 3, 3, 7] 1 x [1, 2, 3, 3, 3, 3, 4, 5] 3 x [2, 3, 3, 3, 5, 5, 5, 6] 1 x [1, 1, 2, 3, 9, 9, 9, 9] 1 x [1, 2, 2, 9, 9] 2 x [1, 1, 1, 3, 9, 9, 9, 9] 1 x [3, 3, 3, 3, 3, 3, 8]