Build (method = -2) #dp: 269 Step-3' Graph: 47 vertices and 128 arcs (0.00s) Step-4' Graph: 27 vertices and 88 arcs (0.00s) #V4/#V3 = 0.57 #A4/#A3 = 0.69 Ready! (0.00s) Optimize a model with 31 rows, 89 columns and 229 nonzeros Presolve removed 6 rows and 11 columns Presolve time: 0.00s Presolved: 25 rows, 78 columns, 208 nonzeros Variable types: 0 continuous, 78 integer (0 binary) Found heuristic solution: objective 163.0000000 Optimize a model with 25 rows, 78 columns and 208 nonzeros Presolved: 25 rows, 78 columns, 208 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.090e+02 Factor NZ : 2.620e+02 Factor Ops : 3.320e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.37536796e+02 -3.65997381e+03 2.61e+03 2.22e-16 1.13e+02 0s 1 2.23612655e+02 -1.61788164e+03 3.99e+02 7.77e-16 2.09e+01 0s 2 9.98671109e+01 -2.83316052e+02 1.62e+01 9.99e-16 2.58e+00 0s 3 4.47428124e+01 -2.57346848e+01 8.62e-01 2.22e-16 4.45e-01 0s 4 2.37174683e+01 -2.85205777e-01 2.03e-01 2.40e-16 1.51e-01 0s 5 2.43879963e+01 1.96126382e+00 1.67e-01 1.96e-16 1.41e-01 0s 6 2.13249170e+01 1.10243538e+01 8.24e-02 3.17e-16 6.46e-02 0s 7 1.95896593e+01 1.37991969e+01 5.63e-02 2.22e-16 3.63e-02 0s 8 1.82472452e+01 1.76839366e+01 1.12e-03 2.75e-16 3.52e-03 0s 9 1.81219393e+01 1.80950378e+01 9.05e-05 2.68e-16 1.68e-04 0s 10 1.81111220e+01 1.81110951e+01 4.50e-14 3.33e-16 1.68e-07 0s 11 1.81111111e+01 1.81111111e+01 5.93e-14 1.96e-16 1.68e-13 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.81111111e+01 Root relaxation: objective 1.811111e+01, 26 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 18.11111 0 17 163.00000 18.11111 88.9% - 0s H 0 0 20.0000000 18.11111 9.44% - 0s H 0 0 19.0000000 18.11111 4.68% - 0s Explored 0 nodes (39 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.900000000000e+01, best bound 1.900000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.01 seconds Objective: 19 Solution: 1 x [1, 1, 1, 1, 2, 3, 3, 3, 4, 4] 1 x [1, 1, 1, 1, 2, 3, 3, 3, 4, 4, 4] 3 x [1, 1, 1, 1, 1, 1, 2, 3, 3, 4] 13 x [1, 1, 1, 1, 1, 1, 2, 4, 4, 4] 1 x [1, 3]