Build (method = -2) #dp: 82 Step-3' Graph: 14 vertices and 46 arcs (0.00s) Step-4' Graph: 10 vertices and 38 arcs (0.00s) #V4/#V3 = 0.71 #A4/#A3 = 0.83 Ready! (0.00s) Optimize a model with 20 rows, 39 columns and 104 nonzeros Presolve removed 11 rows and 18 columns Presolve time: 0.00s Presolved: 9 rows, 21 columns, 53 nonzeros Variable types: 0 continuous, 21 integer (0 binary) Found heuristic solution: objective 883.0000000 Found heuristic solution: objective 713.0000000 Optimize a model with 9 rows, 21 columns and 53 nonzeros Presolved: 9 rows, 21 columns, 53 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.100e+01 Factor NZ : 4.500e+01 Factor Ops : 2.850e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.53617334e+03 -7.97752524e+02 7.52e+02 5.55e-17 1.14e+02 0s 1 8.38532835e+02 2.21295165e+02 5.12e+01 3.33e-16 1.58e+01 0s 2 6.55131963e+02 5.63760041e+02 4.13e+00 1.11e-16 2.09e+00 0s 3 6.28349684e+02 6.15093886e+02 1.67e-01 1.11e-16 2.95e-01 0s 4 6.25539862e+02 6.25411385e+02 8.53e-14 3.33e-16 2.86e-03 0s 5 6.25500000e+02 6.25499999e+02 2.84e-14 1.11e-16 1.78e-08 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 6.25500000e+02 Root relaxation: objective 6.255000e+02, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 625.50000 0 3 713.00000 625.50000 12.3% - 0s H 0 0 626.0000000 625.50000 0.08% - 0s Explored 0 nodes (8 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.260000000000e+02, best bound 6.260000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 626 Solution: 62 x [7] 111 x [7, 10] 212 x [9] 6 x [2, 9] 46 x [1, 5] 54 x [1, 3] 1 x [8] 30 x [6, 8] 7 x [4, 8] 74 x [6, 6] 23 x [1, 1, 1]