Build (method = -2) #dp: 66 Step-3' Graph: 12 vertices and 37 arcs (0.00s) Step-4' Graph: 8 vertices and 29 arcs (0.00s) #V4/#V3 = 0.67 #A4/#A3 = 0.78 Ready! (0.00s) Optimize a model with 18 rows, 30 columns and 81 nonzeros Presolve removed 7 rows and 7 columns Presolve time: 0.00s Presolved: 11 rows, 23 columns, 62 nonzeros Variable types: 0 continuous, 23 integer (0 binary) Found heuristic solution: objective 997.0000000 Found heuristic solution: objective 693.0000000 Optimize a model with 11 rows, 23 columns and 62 nonzeros Presolved: 11 rows, 23 columns, 62 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.600e+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 1.50493626e+03 -2.01493366e+03 6.66e+02 2.22e-16 1.24e+02 0s 1 8.10448882e+02 -1.78514176e+01 7.39e-13 3.33e-16 1.64e+01 0s 2 6.28344758e+02 4.72676898e+02 5.68e-14 3.33e-16 3.06e+00 0s 3 5.51116491e+02 5.40075418e+02 2.84e-13 2.22e-16 2.16e-01 0s 4 5.46556817e+02 5.46454646e+02 5.68e-14 1.68e-16 2.00e-03 0s 5 5.46500000e+02 5.46500000e+02 1.14e-13 2.30e-16 4.68e-09 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.46500000e+02 Root relaxation: objective 5.465000e+02, 10 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 546.50000 0 2 693.00000 546.50000 21.1% - 0s H 0 0 547.0000000 546.50000 0.09% - 0s Explored 0 nodes (13 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.470000000000e+02, best bound 5.470000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 547 Solution: 58 x [5] 88 x [2, 8] 35 x [4] 3 x [3, 4] 24 x [4, 8] 2 x [4, 7] 66 x [6, 7] 122 x [3, 10] 1 x [1] 138 x [1, 9] 10 x [1, 1]