Build (method = -2) #dp: 78 Step-3' Graph: 13 vertices and 42 arcs (0.00s) Step-4' Graph: 9 vertices and 34 arcs (0.00s) #V4/#V3 = 0.69 #A4/#A3 = 0.81 Ready! (0.00s) Optimize a model with 19 rows, 35 columns and 94 nonzeros Presolve removed 7 rows and 9 columns Presolve time: 0.00s Presolved: 12 rows, 26 columns, 69 nonzeros Variable types: 0 continuous, 26 integer (0 binary) Found heuristic solution: objective 968.0000000 Found heuristic solution: objective 832.0000000 Optimize a model with 12 rows, 26 columns and 69 nonzeros Presolved: 12 rows, 26 columns, 69 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.800e+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.90914248e+03 -1.99268414e+03 8.00e+02 1.11e-16 1.33e+02 0s 1 8.02195501e+02 -2.73416151e+02 1.14e-13 3.33e-16 1.87e+01 0s 2 6.08117625e+02 4.65731462e+02 7.46e-14 4.44e-16 2.46e+00 0s 3 5.52616528e+02 5.46809182e+02 1.71e-13 2.22e-16 1.00e-01 0s 4 5.51001696e+02 5.50995789e+02 1.42e-13 1.11e-16 1.02e-04 0s 5 5.51000000e+02 5.51000000e+02 1.46e-13 1.94e-16 1.02e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.51000000e+02 Root relaxation: objective 5.510000e+02, 12 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 551.0000000 551.00000 0.0% - 0s Explored 0 nodes (12 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.510000000000e+02, best bound 5.510000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 551 Solution: 109 x [1] 31 x [1, 4] 9 x [7] 18 x [2, 7] 99 x [3] 36 x [8, 10] 45 x [5, 10] 6 x [6, 8] 83 x [6, 6] 115 x [2, 5, 9]