Build (method = -2) #dp: 279 Step-3' Graph: 38 vertices and 105 arcs (0.00s) Step-4' Graph: 5 vertices and 39 arcs (0.00s) #V4/#V3 = 0.13 #A4/#A3 = 0.37 Ready! (0.00s) Optimize a model with 17 rows, 40 columns and 116 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 15 rows, 38 columns, 112 nonzeros Variable types: 0 continuous, 38 integer (0 binary) Found heuristic solution: objective 527.0000000 Found heuristic solution: objective 508.0000000 Optimize a model with 15 rows, 38 columns and 112 nonzeros Presolved: 15 rows, 38 columns, 112 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.900e+01 Factor NZ : 1.200e+02 Factor Ops : 1.240e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.13688695e+03 -1.41454527e+03 1.14e+02 0.00e+00 6.34e+01 0s 1 3.46848154e+02 -3.10392730e+02 4.81e+00 5.55e-16 8.59e+00 0s 2 2.02882058e+02 1.14602804e+02 7.79e-02 9.16e-15 1.01e+00 0s 3 1.76887556e+02 1.71156508e+02 9.06e-14 2.36e-16 6.51e-02 0s 4 1.76012383e+02 1.75981517e+02 5.96e-14 2.22e-16 3.51e-04 0s 5 1.76000000e+02 1.76000000e+02 5.77e-14 1.30e-16 1.89e-09 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.76000000e+02 Root relaxation: objective 1.760000e+02, 31 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 176.0000000 176.00000 0.0% - 0s Explored 0 nodes (31 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.760000000000e+02, best bound 1.760000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 176 Solution: 20 x [1, 7, 7] 10 x [3, 5, 10] 30 x [5, 6, 7] 8 x [3, 7, 12] 2 x [7, 7, 12] 20 x [4, 7, 8] 4 x [4, 7, 11] 64 x [4, 4, 7] 12 x [2, 7, 7] 6 x [7, 7, 9]