Build (method = -2) #dp: 4196 Step-3' Graph: 470 vertices and 2202 arcs (0.02s) Step-4' Graph: 447 vertices and 2156 arcs (0.02s) #V4/#V3 = 0.95 #A4/#A3 = 0.98 Ready! (0.02s) Optimize a model with 457 rows, 2157 columns and 5594 nonzeros Presolve removed 45 rows and 87 columns Presolve time: 0.02s Presolved: 412 rows, 2070 columns, 5512 nonzeros Variable types: 0 continuous, 2070 integer (0 binary) Found heuristic solution: objective 838.0000000 Optimize a model with 412 rows, 2070 columns and 5512 nonzeros Presolved: 412 rows, 2070 columns, 5512 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.242e+03 Factor NZ : 1.836e+04 (roughly 1 MByte of memory) Factor Ops : 1.370e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.02377042e+03 -3.49057238e+05 2.74e+05 2.22e-16 6.58e+02 0s 1 1.93483009e+03 -2.06397391e+05 4.07e+04 1.11e-15 1.27e+02 0s 2 1.35101066e+03 -6.33856193e+04 1.19e+04 2.55e-15 3.44e+01 0s 3 1.11014191e+03 -1.90271260e+04 2.79e+03 4.22e-14 8.42e+00 0s 4 9.96329943e+02 -6.68936210e+03 2.37e+01 7.99e-15 1.87e+00 0s 5 9.79940407e+02 -3.69946480e+03 2.06e-01 5.22e-15 1.13e+00 0s 6 8.88019303e+02 -3.45391978e+03 1.33e-01 4.88e-15 1.05e+00 0s 7 7.58953918e+02 -1.72515358e+03 6.60e-02 3.33e-15 5.99e-01 0s 8 6.68947220e+02 -1.35322058e+03 4.75e-02 2.89e-15 4.87e-01 0s 9 5.71784699e+02 -9.85759971e+02 3.62e-02 3.26e-15 3.75e-01 0s 10 3.92088684e+02 -3.92723239e+02 1.95e-02 2.22e-15 1.89e-01 0s 11 3.23371076e+02 -2.00396144e+02 1.54e-02 2.40e-15 1.26e-01 0s 12 2.59913876e+02 -9.64986256e+01 1.05e-02 2.67e-15 8.59e-02 0s 13 1.90626313e+02 -2.14113456e+01 5.30e-03 2.64e-15 5.11e-02 0s 14 1.50259858e+02 5.81466073e+01 2.38e-03 1.78e-15 2.22e-02 0s 15 1.50548104e+02 8.59344124e+01 1.87e-03 2.16e-15 1.56e-02 0s 16 1.37118396e+02 9.95507279e+01 1.11e-03 1.97e-15 9.05e-03 0s 17 1.29466221e+02 1.08022127e+02 6.50e-04 2.26e-15 5.17e-03 0s 18 1.27286980e+02 1.11043753e+02 4.78e-04 2.57e-15 3.91e-03 0s 19 1.25446409e+02 1.15659623e+02 2.59e-04 2.60e-15 2.36e-03 0s 20 1.24405489e+02 1.19646598e+02 1.47e-04 2.30e-15 1.15e-03 0s 21 1.23700010e+02 1.20483988e+02 8.21e-05 3.02e-15 7.75e-04 0s 22 1.23163579e+02 1.21628612e+02 3.61e-05 2.51e-15 3.70e-04 0s 23 1.23010609e+02 1.22027681e+02 2.43e-05 2.33e-15 2.37e-04 0s 24 1.22805597e+02 1.22329956e+02 9.94e-06 2.41e-15 1.15e-04 0s 25 1.22675567e+02 1.22384100e+02 3.66e-06 2.81e-15 7.02e-05 0s 26 1.22622887e+02 1.22489008e+02 1.56e-06 2.40e-15 3.23e-05 0s 27 1.22606932e+02 1.22526193e+02 1.02e-06 2.37e-15 1.95e-05 0s 28 1.22592198e+02 1.22563465e+02 3.26e-07 2.02e-15 6.92e-06 0s 29 1.22585174e+02 1.22581991e+02 4.04e-08 1.76e-15 7.67e-07 0s 30 1.22584001e+02 1.22583995e+02 3.19e-11 1.60e-15 1.43e-09 0s 31 1.22584000e+02 1.22584000e+02 3.27e-10 1.71e-15 1.43e-12 0s Barrier solved model in 31 iterations and 0.08 seconds Optimal objective 1.22584000e+02 Root relaxation: objective 1.225840e+02, 538 iterations, 0.09 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 122.58400 0 42 838.00000 122.58400 85.4% - 0s H 0 0 123.0000000 122.58400 0.34% - 0s Explored 0 nodes (1471 simplex iterations) in 0.23 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.230000000000e+02, best bound 1.230000000000e+02, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.23 seconds Total run time: 0.26 seconds Objective: 123 Solution: 16 x [1, 1, 3, 4, 5, 7, 9, 10] 13 x [1, 1, 2, 2, 3, 4, 4, 4, 10] 2 x [2, 2, 2, 2, 2, 3, 4, 7, 8, 10] 2 x [2, 2, 2, 2, 2, 3, 4, 8, 10] 5 x [2, 2, 3, 4, 6, 10, 10, 10] 3 x [2, 2, 3, 3, 4, 5, 5, 10] 17 x [2, 2, 2, 2, 2, 3, 3, 9, 10] 1 x [2, 2, 2, 2, 3, 3, 4, 6, 6] 26 x [3, 3, 3, 4, 5, 8, 9] 1 x [1, 2, 2, 2, 2, 2, 4, 4, 4, 8, 10] 36 x [1, 8, 8, 8, 8, 8, 9, 10] 1 x [1, 2, 2, 2, 2, 2, 4, 4, 4, 8]