Build (method = -2) #dp: 5431 Step-3' Graph: 422 vertices and 1666 arcs (0.03s) Step-4' Graph: 348 vertices and 1518 arcs (0.03s) #V4/#V3 = 0.82 #A4/#A3 = 0.91 Ready! (0.03s) Optimize a model with 358 rows, 1519 columns and 3874 nonzeros Presolve removed 91 rows and 178 columns Presolve time: 0.02s Presolved: 267 rows, 1341 columns, 3630 nonzeros Variable types: 0 continuous, 1341 integer (0 binary) Found heuristic solution: objective 913.0000000 Optimize a model with 267 rows, 1341 columns and 3630 nonzeros Presolved: 267 rows, 1341 columns, 3630 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.124e+03 Factor NZ : 8.481e+03 Factor Ops : 3.515e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.89340249e+03 -2.52475570e+05 1.88e+05 2.22e-16 6.30e+02 0s 1 2.60318110e+03 -1.59409901e+05 3.12e+04 8.88e-16 1.39e+02 0s 2 1.63662177e+03 -5.40174104e+04 1.04e+04 1.55e-15 4.27e+01 0s 3 1.06203958e+03 -1.45890471e+04 1.19e+03 2.66e-15 7.88e+00 0s 4 9.93022905e+02 -2.21781343e+03 9.27e+01 3.55e-15 1.27e+00 0s 5 7.16088591e+02 -1.60765520e+03 5.00e-12 2.66e-15 8.63e-01 0s 6 4.74376320e+02 -6.65461109e+02 3.13e-12 1.22e-15 4.23e-01 0s 7 3.10439480e+02 -3.09755329e+02 1.89e-12 6.63e-16 2.30e-01 0s 8 1.86557159e+02 -2.47957210e+02 6.86e-13 7.39e-16 1.61e-01 0s 9 1.74288502e+02 -1.48633574e+02 6.15e-13 5.55e-16 1.20e-01 0s 10 1.67453063e+02 -4.50401178e+01 7.83e-13 3.94e-16 7.89e-02 0s 11 1.29604427e+02 1.63353250e+01 8.21e-13 4.05e-16 4.21e-02 0s 12 1.33305915e+02 5.56042572e+01 6.45e-13 3.44e-16 2.89e-02 0s 13 1.18326768e+02 7.59305856e+01 7.37e-13 4.60e-16 1.57e-02 0s 14 1.10488456e+02 8.87573256e+01 4.71e-13 3.95e-16 8.07e-03 0s 15 1.07571986e+02 9.70039628e+01 7.69e-13 3.35e-16 3.93e-03 0s 16 1.05801020e+02 1.02959381e+02 3.12e-12 2.95e-16 1.06e-03 0s 17 1.05098316e+02 1.04267939e+02 3.25e-13 3.11e-16 3.08e-04 0s 18 1.04956278e+02 1.04627007e+02 6.85e-13 2.70e-16 1.22e-04 0s 19 1.04913124e+02 1.04752022e+02 5.43e-13 3.33e-16 5.98e-05 0s 20 1.04872648e+02 1.04813301e+02 2.13e-12 3.83e-16 2.20e-05 0s 21 1.04855476e+02 1.04845576e+02 4.57e-13 2.86e-16 3.68e-06 0s 22 1.04853013e+02 1.04852927e+02 1.63e-12 2.22e-16 3.18e-08 0s 23 1.04853000e+02 1.04853000e+02 3.99e-13 2.92e-16 5.29e-14 0s Barrier solved model in 23 iterations and 0.03 seconds Optimal objective 1.04853000e+02 Root relaxation: objective 1.048530e+02, 268 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 104.85300 0 53 913.00000 104.85300 88.5% - 0s H 0 0 106.0000000 104.85300 1.08% - 0s H 0 0 105.0000000 104.85300 0.14% - 0s Explored 0 nodes (439 simplex iterations) in 0.13 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.050000000000e+02, best bound 1.050000000000e+02, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.13 seconds Total run time: 0.17 seconds Objective: 105 Solution: 4 x [1, 1, 2, 3, 5, 5, 6, 6, 7, 8] 5 x [2, 5, 5, 6, 6, 6, 7, 7, 8] 2 x [2, 3, 5, 5, 5, 7, 7, 8, 10] 1 x [2, 2, 3, 6, 7, 7, 8, 8] 7 x [3, 3, 7, 7, 8, 8, 8, 10, 10] 26 x [3, 3, 3, 3, 4, 5, 6, 7, 10, 10] 6 x [4, 5, 5, 5, 6, 7, 10, 10] 8 x [3, 4, 4, 4, 6, 6, 7, 9, 10] 1 x [1, 4, 4, 4, 6, 6, 9, 9, 9, 10] 3 x [1, 1, 3, 5, 6, 6, 6, 6, 10, 10] 19 x [5, 9, 9, 9, 10, 10, 10, 10, 10, 10] 16 x [3, 3, 3, 3, 3, 3, 5, 5, 5, 10] 7 x [5, 5, 5, 5, 5, 7, 10, 10]