Build (method = -2) #dp: 3328 Step-3' Graph: 255 vertices and 1820 arcs (0.02s) Step-4' Graph: 247 vertices and 1804 arcs (0.02s) #V4/#V3 = 0.97 #A4/#A3 = 0.99 Ready! (0.02s) Optimize a model with 264 rows, 1805 columns and 4934 nonzeros Presolve removed 9 rows and 18 columns Presolve time: 0.01s Presolved: 255 rows, 1787 columns, 4915 nonzeros Variable types: 0 continuous, 1787 integer (0 binary) Found heuristic solution: objective 283.0000000 Optimize a model with 255 rows, 1787 columns and 4915 nonzeros Presolved: 255 rows, 1787 columns, 4915 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.880e+03 Factor NZ : 1.117e+04 Factor Ops : 7.690e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.42019611e+03 -7.22342587e+04 5.08e+04 2.22e-16 1.48e+02 0s 1 1.18630790e+03 -3.93096700e+04 1.06e+04 5.55e-16 3.60e+01 0s 2 6.07096564e+02 -1.23243983e+04 2.14e+03 1.11e-15 7.98e+00 0s 3 4.63668904e+02 -3.66200811e+03 2.21e+02 8.88e-16 1.47e+00 0s 4 3.66975538e+02 -8.88190691e+02 7.12e+01 1.67e-15 4.05e-01 0s 5 2.88513899e+02 -5.29412805e+02 4.46e+01 1.55e-15 2.55e-01 0s 6 2.24512443e+02 -3.40155906e+02 2.72e+01 1.11e-15 1.71e-01 0s 7 2.05697433e+02 -3.05078104e+02 2.28e+01 6.66e-16 1.54e-01 0s 8 1.51348969e+02 -1.22306910e+02 1.11e+01 6.66e-16 8.09e-02 0s 9 1.06622755e+02 -1.66283898e+01 3.68e+00 3.33e-16 3.56e-02 0s 10 9.55096176e+01 2.59201437e+01 2.04e+00 3.33e-16 2.00e-02 0s 11 9.03121483e+01 6.01501035e+01 1.33e+00 2.22e-16 8.72e-03 0s 12 8.87292722e+01 6.74755708e+01 9.29e-01 2.28e-16 6.11e-03 0s 13 8.68328226e+01 7.41573029e+01 6.00e-01 3.19e-16 3.63e-03 0s 14 8.51855236e+01 7.73024850e+01 3.11e-01 2.91e-16 2.24e-03 0s 15 8.41436342e+01 8.06405990e+01 1.52e-01 3.12e-16 9.94e-04 0s 16 8.35595770e+01 8.14462268e+01 6.67e-02 2.22e-16 5.96e-04 0s 17 8.33285727e+01 8.21510007e+01 3.68e-02 2.22e-16 3.32e-04 0s 18 8.31710060e+01 8.25577636e+01 1.77e-02 2.38e-16 1.73e-04 0s 19 8.30717188e+01 8.27801332e+01 6.98e-03 3.21e-16 8.19e-05 0s 20 8.30169466e+01 8.28879922e+01 2.03e-03 3.33e-16 3.61e-05 0s 21 8.29995335e+01 8.29348092e+01 1.03e-03 2.07e-16 1.81e-05 0s 22 8.29831273e+01 8.29648892e+01 2.47e-04 2.22e-16 5.10e-06 0s 23 8.29790109e+01 8.29753771e+01 7.96e-05 3.33e-16 1.02e-06 0s 24 8.29776703e+01 8.29766261e+01 2.03e-05 3.03e-16 2.93e-07 0s 25 8.29770929e+01 8.29770732e+01 1.44e-07 2.22e-16 5.50e-09 0s 26 8.29770833e+01 8.29770833e+01 4.55e-11 2.22e-16 1.68e-13 0s Barrier solved model in 26 iterations and 0.06 seconds Optimal objective 8.29770833e+01 Root relaxation: objective 8.297708e+01, 253 iterations, 0.06 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 82.97708 0 31 283.00000 82.97708 70.7% - 0s H 0 0 84.0000000 82.97708 1.22% - 0s H 0 0 83.0000000 82.97708 0.03% - 0s Explored 0 nodes (512 simplex iterations) in 0.16 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.300000000000e+01, best bound 8.300000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.16 seconds Total run time: 0.19 seconds Objective: 83 Solution: 1 x [1, 2, 6, 11, 14, 15] 2 x [1, 2, 6, 6, 11] 1 x [1, 1, 2, 5, 11] 4 x [1, 1, 5, 8, 11, 15] 9 x [3, 5, 5, 5, 17] 4 x [5, 7, 11, 11, 11, 15, 17] 4 x [5, 5, 6, 10, 15, 15] 2 x [5, 6, 7, 11, 11, 13] 16 x [5, 5, 5, 6, 13] 3 x [5, 6, 6, 12, 12, 12] 8 x [5, 5, 9, 13, 13] 8 x [5, 5, 5, 12, 15, 16] 1 x [5, 5, 11, 11, 11, 11, 15, 15] 12 x [5, 5, 11, 11, 11, 11, 11, 11] 8 x [4, 5, 5, 5, 11, 14, 15]