Build (method = -2) #dp: 558 Step-3' Graph: 79 vertices and 334 arcs (0.00s) Step-4' Graph: 47 vertices and 270 arcs (0.00s) #V4/#V3 = 0.59 #A4/#A3 = 0.81 Ready! (0.00s) Optimize a model with 66 rows, 271 columns and 730 nonzeros Presolve removed 11 rows and 17 columns Presolve time: 0.00s Presolved: 55 rows, 254 columns, 698 nonzeros Variable types: 0 continuous, 254 integer (28 binary) Found heuristic solution: objective 160.0000000 Optimize a model with 55 rows, 254 columns and 698 nonzeros Presolved: 55 rows, 254 columns, 698 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.820e+02 Factor NZ : 1.091e+03 Factor Ops : 2.599e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.63656315e+03 -3.05692240e+03 4.47e+03 1.55e-01 5.17e+01 0s 1 5.33352757e+02 -1.42021808e+03 7.80e+02 5.55e-16 1.01e+01 0s 2 2.03533008e+02 -3.73854736e+02 6.59e+01 1.89e-15 1.47e+00 0s 3 1.35034912e+02 -1.48563965e+01 5.77e+00 6.66e-16 3.04e-01 0s 4 1.04046760e+02 5.96801120e+01 1.32e+00 5.55e-16 8.76e-02 0s 5 1.01042745e+02 6.75085378e+01 8.76e-01 4.09e-16 6.58e-02 0s 6 9.49345017e+01 7.55238376e+01 4.36e-01 3.47e-16 3.79e-02 0s 7 9.09486695e+01 8.18816304e+01 1.73e-01 4.44e-16 1.76e-02 0s 8 8.95890081e+01 8.66507136e+01 3.72e-02 3.33e-16 5.67e-03 0s 9 8.90341086e+01 8.75575596e+01 1.32e-02 3.04e-16 2.84e-03 0s 10 8.87807596e+01 8.83301158e+01 5.60e-03 2.93e-16 8.68e-04 0s 11 8.86040478e+01 8.85478950e+01 1.39e-04 3.08e-16 1.08e-04 0s 12 8.85834164e+01 8.85832192e+01 2.05e-07 3.27e-16 3.79e-07 0s 13 8.85833333e+01 8.85833333e+01 5.04e-13 3.12e-16 5.36e-13 0s Barrier solved model in 13 iterations and 0.00 seconds Optimal objective 8.85833333e+01 Root relaxation: objective 8.858333e+01, 59 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 88.58333 0 15 160.00000 88.58333 44.6% - 0s H 0 0 90.0000000 88.58333 1.57% - 0s H 0 0 89.0000000 88.58333 0.47% - 0s Explored 0 nodes (101 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.900000000000e+01, best bound 8.900000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.02 seconds Objective: 89 Solution: 9 x [6, 17] 13 x [6, 16] 11 x [1, 2] 2 x [3, 12] 11 x [18, 19] 9 x [3, 18] 2 x [10, 19] 1 x [1, 10, 11] 3 x [10, 11, 11, 14] 1 x [4, 7] 7 x [7, 15] 1 x [3, 7, 13] 1 x [3, 7, 17] 4 x [7, 7] 1 x [4, 14] 11 x [8, 14, 15] 2 x [3, 5, 9]