Build (method = -2) #dp: 82 Step-3' Graph: 24 vertices and 62 arcs (0.00s) Step-4' Graph: 13 vertices and 40 arcs (0.00s) #V4/#V3 = 0.54 #A4/#A3 = 0.65 Ready! (0.00s) Optimize a model with 17 rows, 41 columns and 105 nonzeros Presolve removed 5 rows and 9 columns Presolve time: 0.00s Presolved: 12 rows, 32 columns, 87 nonzeros Variable types: 0 continuous, 32 integer (0 binary) Found heuristic solution: objective 454.0000000 Found heuristic solution: objective 439.0000000 Optimize a model with 12 rows, 32 columns and 87 nonzeros Presolved: 12 rows, 32 columns, 87 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.100e+01 Factor NZ : 7.800e+01 Factor Ops : 6.500e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.58071126e+03 -4.04865074e+03 1.51e+03 1.11e-16 2.22e+02 0s 1 5.04400659e+02 -9.22828936e+02 1.42e+02 3.33e-16 2.88e+01 0s 2 1.63501805e+02 -9.28460678e+01 7.91e-01 2.66e-15 3.79e+00 0s 3 1.20158451e+02 4.09814977e+01 3.97e-02 5.55e-16 1.16e+00 0s 4 1.01717752e+02 5.74172976e+01 5.82e-03 2.22e-16 6.52e-01 0s 5 9.20537396e+01 8.40477226e+01 2.12e-03 1.11e-16 1.18e-01 0s 6 9.11903193e+01 9.08173051e+01 3.00e-14 7.31e-17 5.49e-03 0s 7 9.10000250e+01 9.09999103e+01 7.78e-14 1.42e-16 1.69e-06 0s 8 9.10000000e+01 9.09999999e+01 2.13e-13 1.11e-16 1.69e-09 0s Barrier solved model in 8 iterations and 0.00 seconds Optimal objective 9.10000000e+01 Root relaxation: objective 9.100000e+01, 18 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 91.0000000 91.00000 0.0% - 0s Explored 0 nodes (18 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.100000000000e+01, best bound 9.100000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 91 Solution: 15 x [1, 2, 3, 3, 4] 7 x [1, 1, 1, 3, 4] 3 x [1, 1, 1, 1, 3] 66 x [1, 1, 1, 1, 1]