Build (method = -2) #dp: 116 Step-3' Graph: 26 vertices and 69 arcs (0.00s) Step-4' Graph: 5 vertices and 27 arcs (0.00s) #V4/#V3 = 0.19 #A4/#A3 = 0.39 Ready! (0.00s) Optimize a model with 13 rows, 28 columns and 80 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 11 rows, 26 columns, 76 nonzeros Variable types: 0 continuous, 26 integer (0 binary) Found heuristic solution: objective 278.0000000 Found heuristic solution: objective 249.0000000 Optimize a model with 11 rows, 26 columns and 76 nonzeros Presolved: 11 rows, 26 columns, 76 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.700e+01 Factor NZ : 6.600e+01 Factor Ops : 5.060e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.77146667e+02 -7.21612258e+02 8.54e+01 1.11e-16 4.67e+01 0s 1 1.77342974e+02 -1.96064656e+02 2.54e+00 4.44e-16 6.83e+00 0s 2 1.06993499e+02 4.78447583e+01 6.11e-02 2.22e-16 9.91e-01 0s 3 9.40065226e+01 8.57454872e+01 1.06e-02 2.22e-16 1.37e-01 0s 4 9.30068299e+01 9.29589027e+01 7.57e-05 1.11e-16 7.96e-04 0s 5 9.30000000e+01 9.30000000e+01 1.09e-10 1.11e-16 9.00e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 9.30000000e+01 Root relaxation: objective 9.300000e+01, 20 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 93.0000000 93.00000 0.0% - 0s Explored 0 nodes (20 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.300000000000e+01, best bound 9.300000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 93 Solution: 30 x [1, 2, 2] 4 x [3, 7, 8] 2 x [3, 6, 8] 12 x [2, 4, 6] 4 x [2, 4, 8] 18 x [2, 2, 6] 23 x [2, 2, 5]