Build (method = -2) #dp: 3701 Step-3' Graph: 362 vertices and 1455 arcs (0.02s) Step-4' Graph: 308 vertices and 1347 arcs (0.02s) #V4/#V3 = 0.85 #A4/#A3 = 0.93 Ready! (0.02s) Optimize a model with 318 rows, 1348 columns and 3440 nonzeros Presolve removed 60 rows and 118 columns Presolve time: 0.01s Presolved: 258 rows, 1230 columns, 3279 nonzeros Variable types: 0 continuous, 1230 integer (0 binary) Found heuristic solution: objective 811.0000000 Optimize a model with 258 rows, 1230 columns and 3279 nonzeros Presolved: 258 rows, 1230 columns, 3279 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.981e+03 Factor NZ : 7.149e+03 Factor Ops : 2.506e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.53190980e+03 -1.68576129e+05 1.15e+05 2.22e-16 4.36e+02 0s 1 1.80980199e+03 -9.77166103e+04 1.80e+04 1.11e-15 9.07e+01 0s 2 1.26389609e+03 -2.95824580e+04 5.09e+03 4.88e-15 2.40e+01 0s 3 1.01392111e+03 -7.42658496e+03 4.63e+02 1.33e-15 4.20e+00 0s 4 9.43187658e+02 -2.59008828e+03 4.60e-12 9.99e-16 1.43e+00 0s 5 7.99673223e+02 -1.32141700e+03 3.95e-12 1.16e-15 8.59e-01 0s 6 7.58324845e+02 -1.08335602e+03 2.16e-12 9.85e-16 7.46e-01 0s 7 6.44771492e+02 -8.56267281e+02 2.28e-12 9.68e-16 6.08e-01 0s 8 6.17761169e+02 -5.91325098e+02 2.17e-12 9.66e-16 4.90e-01 0s 9 3.11446939e+02 -2.61564052e+02 7.67e-13 1.04e-15 2.32e-01 0s 10 1.91511906e+02 -8.14029655e+01 3.37e-13 7.12e-16 1.10e-01 0s 11 1.75087676e+02 -4.13952433e+01 4.88e-13 8.50e-16 8.76e-02 0s 12 1.52010419e+02 7.65526828e+00 5.89e-13 7.77e-16 5.84e-02 0s 13 1.33030348e+02 5.53663488e+01 2.71e-13 6.40e-16 3.14e-02 0s 14 1.26014583e+02 8.04834465e+01 2.13e-13 6.60e-16 1.84e-02 0s 15 1.22559928e+02 1.05319365e+02 1.57e-13 6.45e-16 6.98e-03 0s 16 1.17760582e+02 1.12727750e+02 4.98e-13 5.01e-16 2.04e-03 0s 17 1.16657799e+02 1.14466084e+02 1.10e-12 4.66e-16 8.87e-04 0s 18 1.16224433e+02 1.15177728e+02 7.29e-13 5.55e-16 4.24e-04 0s 19 1.16087920e+02 1.15785514e+02 2.25e-12 5.37e-16 1.22e-04 0s 20 1.16034423e+02 1.15928617e+02 1.43e-12 6.66e-16 4.28e-05 0s 21 1.16003094e+02 1.15968633e+02 5.24e-13 7.09e-16 1.40e-05 0s 22 1.15991035e+02 1.15984784e+02 8.27e-13 6.53e-16 2.53e-06 0s 23 1.15989012e+02 1.15988983e+02 5.66e-13 5.04e-16 1.19e-08 0s 24 1.15989000e+02 1.15989000e+02 2.07e-12 4.81e-16 1.19e-11 0s Barrier solved model in 24 iterations and 0.03 seconds Optimal objective 1.15989000e+02 Root relaxation: objective 1.159890e+02, 194 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 115.98900 0 44 811.00000 115.98900 85.7% - 0s H 0 0 117.0000000 115.98900 0.86% - 0s H 0 0 116.0000000 115.98900 0.01% - 0s Explored 0 nodes (406 simplex iterations) in 0.10 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.160000000000e+02, best bound 1.160000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.10 seconds Total run time: 0.13 seconds Objective: 116 Solution: 44 x [1, 2, 2, 5, 6, 6, 7, 7, 9] 16 x [1, 4, 4, 4, 4, 4, 4, 5, 6] 10 x [1, 1, 1, 4, 4, 5, 7, 8] 15 x [3, 4, 5, 6, 6, 6, 9, 9, 9] 4 x [4, 5, 7, 8, 9, 9, 9, 9] 2 x [5, 5, 5, 5, 6, 7, 7, 9] 3 x [4, 4, 5, 5, 5, 5, 7] 3 x [4, 7, 9, 9, 9, 9, 9, 10] 1 x [1, 3, 4, 7, 8, 9, 10, 10] 8 x [3, 3, 3, 4, 7, 9, 10, 10] 3 x [1, 3, 4, 4, 7, 10, 10, 10] 4 x [1, 7, 7, 10, 10, 10, 10, 10] 3 x [1, 1, 3, 3, 4, 7, 9, 9]