Build (method = -2) #dp: 629 Step-3' Graph: 36 vertices and 252 arcs (0.00s) Step-4' Graph: 34 vertices and 248 arcs (0.00s) #V4/#V3 = 0.94 #A4/#A3 = 0.98 Ready! (0.00s) Optimize a model with 54 rows, 249 columns and 695 nonzeros Presolve removed 8 rows and 8 columns Presolve time: 0.00s Presolved: 46 rows, 241 columns, 673 nonzeros Variable types: 0 continuous, 241 integer (6 binary) Found heuristic solution: objective 337.0000000 Found heuristic solution: objective 268.0000000 Optimize a model with 46 rows, 241 columns and 673 nonzeros Presolved: 46 rows, 241 columns, 673 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.800e+02 Factor NZ : 8.500e+02 Factor Ops : 1.907e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.18452234e+03 -5.42820402e+03 7.55e+03 1.14e-01 1.15e+02 0s 1 1.00663365e+03 -2.73673713e+03 1.34e+03 4.44e-16 2.21e+01 0s 2 3.42202562e+02 -8.21726674e+02 9.07e+01 2.22e-15 3.02e+00 0s 3 2.38300595e+02 -1.42267382e+02 2.89e+00 1.22e-15 7.80e-01 0s 4 1.67056758e+02 5.90811543e+01 5.76e-01 3.33e-16 2.19e-01 0s 5 1.54174978e+02 9.26521265e+01 3.14e-01 2.22e-16 1.25e-01 0s 6 1.45696629e+02 1.21278533e+02 1.65e-01 2.22e-16 4.96e-02 0s 7 1.41168857e+02 1.25456560e+02 8.02e-02 2.22e-16 3.19e-02 0s 8 1.37524782e+02 1.33533936e+02 1.94e-02 2.03e-16 8.08e-03 0s 9 1.37097380e+02 1.35364344e+02 8.50e-03 3.33e-16 3.51e-03 0s 10 1.36748431e+02 1.36243668e+02 2.02e-03 2.22e-16 1.02e-03 0s 11 1.36524648e+02 1.36482964e+02 1.14e-04 2.22e-16 8.43e-05 0s 12 1.36500140e+02 1.36499820e+02 7.25e-13 2.43e-16 6.45e-07 0s 13 1.36500000e+02 1.36500000e+02 3.24e-13 3.33e-16 9.00e-13 0s Barrier solved model in 13 iterations and 0.00 seconds Optimal objective 1.36500000e+02 Root relaxation: objective 1.365000e+02, 54 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 136.50000 0 4 268.00000 136.50000 49.1% - 0s H 0 0 137.0000000 136.50000 0.36% - 0s Explored 0 nodes (64 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.370000000000e+02, best bound 1.370000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.02 seconds Objective: 137 Solution: 15 x [1, 5] 7 x [5, 6] 2 x [2, 5] 7 x [8, 9] 20 x [3, 8] 8 x [4, 12, 13] 17 x [11, 13, 14] 7 x [5, 9, 13] 3 x [7, 12, 12, 13] 1 x [10, 18] 27 x [17, 20] 2 x [20, 20] 5 x [9, 18, 19] 3 x [9, 15, 18] 4 x [3, 9, 11, 18] 4 x [11, 18, 18] 4 x [14, 14, 18, 18] 1 x [9, 16]