Build (method = -2) #dp: 59 Step-3' Graph: 17 vertices and 44 arcs (0.00s) Step-4' Graph: 9 vertices and 28 arcs (0.00s) #V4/#V3 = 0.53 #A4/#A3 = 0.64 Ready! (0.00s) Optimize a model with 19 rows, 29 columns and 73 nonzeros Presolve removed 11 rows and 13 columns Presolve time: 0.00s Presolved: 8 rows, 16 columns, 41 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Found heuristic solution: objective 743.0000000 Found heuristic solution: objective 627.0000000 Optimize a model with 8 rows, 16 columns and 41 nonzeros Presolved: 8 rows, 16 columns, 41 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.200e+01 Factor NZ : 3.600e+01 Factor Ops : 2.040e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.03054101e+03 -9.21411636e+02 2.81e+02 0.00e+00 1.09e+02 0s 1 6.99868347e+02 2.49669675e+02 1.81e+01 2.22e-16 1.46e+01 0s 2 6.03593196e+02 4.93430891e+02 1.42e+00 2.89e-15 3.19e+00 0s 3 5.68845978e+02 5.42109257e+02 7.59e-02 6.66e-16 7.65e-01 0s 4 5.65150504e+02 5.64363815e+02 9.24e-04 4.34e-17 2.25e-02 0s 5 5.65000603e+02 5.64999130e+02 3.23e-06 1.51e-16 4.21e-05 0s 6 5.65000000e+02 5.65000000e+02 3.35e-12 1.11e-16 4.33e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 5.65000000e+02 Root relaxation: objective 5.650000e+02, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 565.0000000 565.00000 0.0% - 0s Explored 0 nodes (6 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.650000000000e+02, best bound 5.650000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 565 Solution: 84 x [1] 6 x [2] 32 x [2, 9] 162 x [2, 10] 102 x [3] 31 x [4, 8] 65 x [5, 8] 2 x [6, 7] 19 x [6, 8] 62 x [7, 8, 9]