Build (method = -2) #dp: 153 Step-3' Graph: 12 vertices and 52 arcs (0.00s) Step-4' Graph: 6 vertices and 40 arcs (0.00s) #V4/#V3 = 0.50 #A4/#A3 = 0.77 Ready! (0.00s) Optimize a model with 26 rows, 41 columns and 116 nonzeros Presolve removed 9 rows and 9 columns Presolve time: 0.00s Presolved: 17 rows, 32 columns, 90 nonzeros Variable types: 0 continuous, 32 integer (1 binary) Found heuristic solution: objective 117.0000000 Found heuristic solution: objective 79.0000000 Optimize a model with 17 rows, 32 columns and 90 nonzeros Presolved: 17 rows, 32 columns, 90 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.100e+01 Factor NZ : 1.530e+02 Factor Ops : 1.785e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.39024750e+02 -2.12122652e+02 1.80e+01 2.22e-16 1.16e+01 0s 1 1.01410599e+02 -2.62339251e+01 5.81e-01 3.33e-16 1.78e+00 0s 2 7.41834890e+01 4.56772648e+01 6.66e-03 4.44e-16 3.71e-01 0s 3 6.61766130e+01 6.43118267e+01 1.15e-04 2.58e-16 2.42e-02 0s 4 6.60029692e+01 6.59971300e+01 4.10e-07 3.33e-16 7.58e-05 0s 5 6.60000000e+01 6.60000000e+01 1.58e-12 4.23e-16 1.89e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 6.60000000e+01 Root relaxation: objective 6.600000e+01, 21 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 66.0000000 66.00000 0.0% - 0s Explored 0 nodes (21 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.600000000000e+01, best bound 6.600000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 66 Solution: 10 x [4] 4 x [1] 4 x [9, 12] 7 x [6, 19] 3 x [6, 9] 1 x [8, 13] 4 x [3, 8] 2 x [5, 15] 3 x [10, 14] 6 x [2, 7] 4 x [2, 20] 9 x [11, 16] 8 x [13, 17] 1 x [13, 18]