Build (method = -2) #dp: 69 Step-3' Graph: 14 vertices and 43 arcs (0.00s) Step-4' Graph: 9 vertices and 33 arcs (0.00s) #V4/#V3 = 0.64 #A4/#A3 = 0.77 Ready! (0.00s) Optimize a model with 19 rows, 34 columns and 91 nonzeros Presolve removed 7 rows and 8 columns Presolve time: 0.00s Presolved: 12 rows, 26 columns, 70 nonzeros Variable types: 0 continuous, 26 integer (0 binary) Found heuristic solution: objective 97.0000000 Found heuristic solution: objective 77.0000000 Optimize a model with 12 rows, 26 columns and 70 nonzeros Presolved: 12 rows, 26 columns, 70 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.100e+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.72038255e+02 -2.04534286e+02 1.25e+02 5.55e-17 1.45e+01 0s 1 8.21835647e+01 -1.80641718e+01 1.14e-13 5.55e-16 1.76e+00 0s 2 6.52306338e+01 3.86346443e+01 9.77e-15 6.66e-16 4.67e-01 0s 3 5.79197398e+01 5.59242132e+01 3.55e-15 4.51e-16 3.50e-02 0s 4 5.75035544e+01 5.74952856e+01 1.42e-14 1.50e-16 1.45e-04 0s 5 5.75000000e+01 5.75000000e+01 1.51e-14 3.33e-16 1.59e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.75000000e+01 Root relaxation: objective 5.750000e+01, 12 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 57.50000 0 2 77.00000 57.50000 25.3% - 0s H 0 0 58.0000000 57.50000 0.86% - 0s Explored 0 nodes (14 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.800000000000e+01, best bound 5.800000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 58 Solution: 8 x [8] 7 x [9] 1 x [9, 10] 1 x [4, 9] 15 x [5, 10] 3 x [1, 4] 6 x [3, 6] 1 x [2] 2 x [2, 7] 14 x [6, 7]