Build (method = -2) #dp: 715 Step-3' Graph: 93 vertices and 399 arcs (0.00s) Step-4' Graph: 71 vertices and 355 arcs (0.00s) #V4/#V3 = 0.76 #A4/#A3 = 0.89 Ready! (0.00s) Optimize a model with 91 rows, 356 columns and 941 nonzeros Presolve removed 18 rows and 32 columns Presolve time: 0.00s Presolved: 73 rows, 324 columns, 880 nonzeros Variable types: 0 continuous, 324 integer (0 binary) Found heuristic solution: objective 134.0000000 Optimize a model with 73 rows, 324 columns and 880 nonzeros Presolved: 73 rows, 324 columns, 880 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.430e+02 Factor NZ : 1.546e+03 Factor Ops : 3.900e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.34151753e+02 -4.57599422e+03 2.81e+03 1.11e-16 4.55e+01 0s 1 2.97529558e+02 -2.21286014e+03 3.78e+02 7.77e-16 7.96e+00 0s 2 1.79284638e+02 -4.28151208e+02 2.17e+01 1.33e-15 1.05e+00 0s 3 1.43699742e+02 -5.32653655e+01 5.31e-02 4.44e-16 2.99e-01 0s 4 1.13363548e+02 3.09643112e+01 7.16e-03 3.33e-16 1.25e-01 0s 5 1.03118636e+02 7.27707392e+01 3.50e-03 1.73e-16 4.60e-02 0s 6 9.53674103e+01 8.29976583e+01 1.33e-03 2.98e-16 1.87e-02 0s 7 9.29150993e+01 8.70744283e+01 6.36e-04 2.33e-16 8.85e-03 0s 8 9.14059237e+01 8.83332680e+01 1.87e-04 2.97e-16 4.66e-03 0s 9 9.05606863e+01 9.02972262e+01 2.01e-05 3.11e-16 3.99e-04 0s 10 9.05009275e+01 9.04976539e+01 7.65e-08 3.41e-16 4.96e-06 0s 11 9.05000009e+01 9.04999977e+01 5.67e-11 3.24e-16 4.96e-09 0s 12 9.05000000e+01 9.05000000e+01 1.44e-10 3.33e-16 4.96e-12 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 9.05000000e+01 Root relaxation: objective 9.050000e+01, 130 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 90.50000 0 3 134.00000 90.50000 32.5% - 0s H 0 0 91.0000000 90.50000 0.55% - 0s Explored 0 nodes (226 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.100000000000e+01, best bound 9.100000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.02 seconds Total run time: 0.03 seconds Objective: 91 Solution: 10 x [9, 20] 1 x [11] 1 x [9, 11] 6 x [8, 11] 1 x [2, 11] 8 x [13, 19] 1 x [13, 14] 6 x [16, 19] 6 x [1, 3] 15 x [4, 10] 4 x [6, 18] 3 x [6, 10] 1 x [3, 6] 6 x [12, 14] 3 x [12, 14, 17] 6 x [12, 14, 15, 15] 5 x [2, 8, 12] 3 x [5, 7] 4 x [7, 7] 1 x [5]