Build (method = -2) #dp: 69 Step-3' Graph: 10 vertices and 36 arcs (0.00s) Step-4' Graph: 9 vertices and 34 arcs (0.00s) #V4/#V3 = 0.90 #A4/#A3 = 0.94 Ready! (0.00s) Optimize a model with 19 rows, 35 columns and 94 nonzeros Presolve removed 7 rows and 8 columns Presolve time: 0.00s Presolved: 12 rows, 27 columns, 70 nonzeros Variable types: 0 continuous, 27 integer (0 binary) Found heuristic solution: objective 995.0000000 Found heuristic solution: objective 955.0000000 Found heuristic solution: objective 783.0000000 Found heuristic solution: objective 758.0000000 Optimize a model with 12 rows, 27 columns and 70 nonzeros Presolved: 12 rows, 27 columns, 70 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.300e+01 Factor NZ : 7.800e+01 Factor Ops : 6.500e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.81328030e+03 -2.06999643e+03 4.35e+02 1.11e-16 1.35e+02 0s 1 8.64950741e+02 -1.16039086e+02 2.18e+01 2.22e-16 1.83e+01 0s 2 6.37396689e+02 4.17844043e+02 1.07e+00 3.33e-16 3.74e+00 0s 3 5.70897233e+02 5.47660863e+02 4.37e-02 3.33e-16 3.94e-01 0s 4 5.65036447e+02 5.64871695e+02 3.99e-05 3.33e-16 2.79e-03 0s 5 5.65000000e+02 5.65000000e+02 5.92e-11 2.22e-16 3.60e-09 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.65000000e+02 Root relaxation: objective 5.650000e+02, 13 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 (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.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: 1 x [10] 76 x [9] 47 x [1] 6 x [6] 138 x [6, 7] 59 x [4, 6] 42 x [8, 8] 33 x [2, 3] 82 x [2, 5] 81 x [2, 2]