Build (method = -2) #dp: 71 Step-3' Graph: 16 vertices and 49 arcs (0.00s) Step-4' Graph: 10 vertices and 37 arcs (0.00s) #V4/#V3 = 0.62 #A4/#A3 = 0.76 Ready! (0.00s) Optimize a model with 20 rows, 38 columns and 100 nonzeros Presolve removed 6 rows and 6 columns Presolve time: 0.00s Presolved: 14 rows, 32 columns, 84 nonzeros Variable types: 0 continuous, 32 integer (3 binary) Found heuristic solution: objective 97.0000000 Found heuristic solution: objective 84.0000000 Found heuristic solution: objective 80.0000000 Optimize a model with 14 rows, 32 columns and 84 nonzeros Presolved: 14 rows, 32 columns, 84 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.700e+01 Factor NZ : 1.050e+02 Factor Ops : 1.015e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.12032502e+02 -2.70408180e+02 3.94e+02 1.45e-01 2.39e+01 0s 1 1.06267647e+02 -8.54740485e+01 3.49e+01 4.44e-16 3.60e+00 0s 2 6.11939467e+01 2.93770153e+01 3.98e-02 2.22e-16 4.61e-01 0s 3 4.84303809e+01 4.33919227e+01 2.41e-03 2.53e-16 7.30e-02 0s 4 4.67793627e+01 4.63185636e+01 9.61e-05 1.33e-16 6.68e-03 0s 5 4.65016900e+01 4.64965468e+01 1.55e-06 2.27e-16 7.45e-05 0s 6 4.65000000e+01 4.65000000e+01 1.52e-12 2.35e-16 1.38e-10 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.65000000e+01 Root relaxation: objective 4.650000e+01, 10 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 46.50000 0 4 80.00000 46.50000 41.9% - 0s H 0 0 47.0000000 46.50000 1.06% - 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 4.700000000000e+01, best bound 4.700000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 47 Solution: 5 x [6, 10] 1 x [8, 10] 11 x [2, 8] 13 x [3, 5] 2 x [1, 5] 5 x [1, 9] 3 x [1, 3] 6 x [1, 7, 7] 1 x [4, 7]