Build (method = -2) #dp: 305 Step-3' Graph: 69 vertices and 200 arcs (0.00s) Step-4' Graph: 35 vertices and 132 arcs (0.00s) #V4/#V3 = 0.51 #A4/#A3 = 0.66 Ready! (0.00s) Optimize a model with 55 rows, 133 columns and 333 nonzeros Presolve removed 17 rows and 24 columns Presolve time: 0.00s Presolved: 38 rows, 109 columns, 280 nonzeros Variable types: 0 continuous, 109 integer (1 binary) Found heuristic solution: objective 148.0000000 Found heuristic solution: objective 129.0000000 Found heuristic solution: objective 121.0000000 Optimize a model with 38 rows, 109 columns and 280 nonzeros Presolved: 38 rows, 109 columns, 280 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.860e+02 Factor NZ : 5.570e+02 Factor Ops : 9.931e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.52048322e+02 -1.59946198e+03 1.12e+03 2.22e-16 3.43e+01 0s 1 2.24827650e+02 -5.44659230e+02 1.90e+02 6.66e-16 6.76e+00 0s 2 1.40948732e+02 -9.52033677e+01 3.13e+00 3.89e-16 1.08e+00 0s 3 1.21117150e+02 3.93614536e+01 1.17e-01 3.89e-16 3.62e-01 0s 4 1.09805225e+02 7.84816209e+01 8.87e-04 5.27e-16 1.39e-01 0s 5 1.03066910e+02 9.41809805e+01 1.65e-04 4.51e-16 3.93e-02 0s 6 1.01808747e+02 9.97847285e+01 7.42e-05 4.09e-16 8.96e-03 0s 7 1.01107066e+02 1.00656920e+02 2.20e-05 4.65e-16 1.99e-03 0s 8 1.01058026e+02 1.00946341e+02 5.94e-06 4.42e-16 4.94e-04 0s 9 1.01000971e+02 1.00990368e+02 2.14e-07 4.44e-16 4.69e-05 0s 10 1.01000001e+02 1.00999990e+02 2.15e-12 4.01e-16 4.69e-08 0s 11 1.01000000e+02 1.01000000e+02 7.96e-13 3.79e-16 4.69e-11 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.01000000e+02 Root relaxation: objective 1.010000e+02, 63 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 101.0000000 101.00000 0.0% - 0s Explored 0 nodes (72 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.010000000000e+02, best bound 1.010000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.01 seconds Objective: 101 Solution: 12 x [1] 6 x [1, 19] 1 x [2] 2 x [3] 2 x [3, 16] 6 x [3, 18] 13 x [4, 17, 19] 1 x [4, 20] 1 x [5, 15] 5 x [6, 15] 1 x [7, 13] 18 x [7, 14] 1 x [8, 14] 4 x [8, 15] 9 x [9, 12] 9 x [10, 11] 1 x [10, 12] 8 x [11, 12] 1 x [11, 13]