Build (method = -2) #dp: 7245 Step-3' Graph: 536 vertices and 2478 arcs (0.04s) Step-4' Graph: 454 vertices and 2316 arcs (0.04s) #V4/#V3 = 0.85 #A4/#A3 = 0.93 Ready! (0.04s) Optimize a model with 466 rows, 2317 columns and 6053 nonzeros Presolve removed 63 rows and 123 columns Presolve time: 0.03s Presolved: 403 rows, 2194 columns, 5912 nonzeros Variable types: 0 continuous, 2194 integer (0 binary) Found heuristic solution: objective 380.0000000 Optimize a model with 403 rows, 2194 columns and 5912 nonzeros Presolved: 403 rows, 2194 columns, 5912 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.336e+03 Factor NZ : 1.218e+04 (roughly 1 MByte of memory) Factor Ops : 4.667e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.06143586e+03 -1.37127892e+05 2.82e+05 2.22e-16 5.62e+02 0s 1 1.89794069e+03 -1.00172104e+05 3.58e+04 6.66e-16 8.78e+01 0s 2 8.41830036e+02 -3.58015445e+04 7.59e+03 7.55e-15 2.06e+01 0s 3 5.48841148e+02 -1.34585831e+04 1.29e+03 1.78e-14 4.95e+00 0s 4 4.96125414e+02 -3.03229928e+03 1.37e+02 2.84e-14 9.20e-01 0s 5 4.78436295e+02 -1.37038506e+03 4.11e-12 1.42e-14 4.20e-01 0s 6 3.24289679e+02 -7.15652899e+02 2.05e-12 9.55e-15 2.36e-01 0s 7 2.74568668e+02 -3.16067745e+02 1.66e-12 5.55e-15 1.34e-01 0s 8 2.76631047e+02 -2.15515520e+02 1.59e-12 6.16e-15 1.12e-01 0s 9 2.24917684e+02 -1.84645284e+02 1.18e-12 7.25e-15 9.31e-02 0s 10 1.54671761e+02 -1.25027507e+02 8.89e-12 6.46e-15 6.36e-02 0s 11 1.44328314e+02 -8.80858480e+01 8.08e-12 8.20e-15 5.28e-02 0s 12 1.16456044e+02 -6.05291083e+01 5.53e-12 7.35e-15 4.02e-02 0s 13 8.56826893e+01 -1.53580015e+01 3.16e-12 5.52e-15 2.30e-02 0s 14 6.98156543e+01 1.68490116e+00 1.59e-12 7.00e-15 1.55e-02 0s 15 6.13967207e+01 2.55516379e+01 1.01e-12 5.12e-15 8.15e-03 0s 16 5.73692146e+01 4.44021528e+01 5.74e-13 4.41e-15 2.95e-03 0s 17 5.62863707e+01 4.93252691e+01 4.07e-13 5.18e-15 1.58e-03 0s 18 5.51867314e+01 5.34213560e+01 5.22e-13 3.99e-15 4.01e-04 0s 19 5.48941734e+01 5.48660770e+01 2.11e-12 4.34e-15 6.39e-06 0s 20 5.48888889e+01 5.48888888e+01 3.39e-12 3.56e-15 4.25e-11 0s Barrier solved model in 20 iterations and 0.04 seconds Optimal objective 5.48888889e+01 Root relaxation: objective 5.488889e+01, 1242 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 54.88889 0 31 380.00000 54.88889 85.6% - 0s H 0 0 56.0000000 54.88889 1.98% - 0s H 0 0 55.0000000 54.88889 0.20% - 0s Explored 0 nodes (2346 simplex iterations) in 0.21 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.500000000000e+01, best bound 5.500000000000e+01, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.21 seconds Total run time: 0.27 seconds Objective: 55 Solution: 1 x [1, 1, 4, 4, 5, 8, 9, 11, 12] 2 x [1, 3, 5, 5, 8, 9, 11, 11, 11] 18 x [5, 5, 5, 5, 5, 5, 7, 8, 9] 10 x [5, 5, 5, 5, 5, 5, 5, 8, 11] 2 x [1, 3, 5, 5, 8, 8, 9, 11, 11] 1 x [1, 1, 2, 4, 5, 9, 9, 11, 12] 1 x [2, 4, 5, 5, 5, 6, 6, 11] 1 x [2, 2, 2, 4, 5, 5, 9, 11, 12] 8 x [4, 5, 5, 5, 5, 5, 6, 9, 10] 5 x [4, 5, 5, 5, 5, 5, 6, 6, 11] 1 x [2, 2, 2, 4, 4, 5, 9, 11, 12] 5 x [3, 4, 4, 4, 5, 5, 9, 11, 11]