Build (method = -2) #dp: 125 Step-3' Graph: 30 vertices and 83 arcs (0.00s) Step-4' Graph: 11 vertices and 45 arcs (0.00s) #V4/#V3 = 0.37 #A4/#A3 = 0.54 Ready! (0.00s) Optimize a model with 31 rows, 46 columns and 120 nonzeros Presolve removed 21 rows and 28 columns Presolve time: 0.00s Presolved: 10 rows, 18 columns, 45 nonzeros Variable types: 0 continuous, 18 integer (0 binary) Found heuristic solution: objective 170.0000000 Found heuristic solution: objective 165.0000000 Optimize a model with 10 rows, 18 columns and 45 nonzeros Presolved: 10 rows, 18 columns, 45 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.200e+01 Factor NZ : 5.500e+01 Factor Ops : 3.850e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.86478824e+02 -3.71289382e+01 3.01e+01 1.11e-16 8.32e+00 0s 1 1.63630718e+02 1.17635621e+02 3.76e-02 1.67e-16 1.17e+00 0s 2 1.48766276e+02 1.44678064e+02 5.77e-15 1.11e-16 1.02e-01 0s 3 1.48072526e+02 1.47927425e+02 7.11e-15 1.37e-16 3.63e-03 0s 4 1.48000075e+02 1.47999929e+02 2.58e-14 5.55e-16 3.63e-06 0s 5 1.48000000e+02 1.48000000e+02 1.42e-14 9.07e-17 3.63e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.48000000e+02 Root relaxation: objective 1.480000e+02, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 148.0000000 148.00000 0.0% - 0s Explored 0 nodes (7 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.480000000000e+02, best bound 1.480000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 148 Solution: 11 x [1] 15 x [2] 13 x [3] 13 x [4] 14 x [5] 5 x [6, 20] 6 x [7, 19] 9 x [8] 8 x [9] 13 x [10] 1 x [11, 19] 2 x [11, 20] 3 x [12, 17] 15 x [12, 18] 1 x [13, 15] 3 x [13, 16] 8 x [14, 15] 2 x [15, 16] 6 x [16, 17]