Build (method = -2) #dp: 26108 Step-3' Graph: 761 vertices and 7356 arcs (0.16s) Step-4' Graph: 756 vertices and 7346 arcs (0.17s) #V4/#V3 = 0.99 #A4/#A3 = 1.00 Ready! (0.17s) Optimize a model with 775 rows, 7347 columns and 20533 nonzeros Presolve removed 31 rows and 72 columns Presolve time: 0.10s Presolved: 744 rows, 7275 columns, 20414 nonzeros Variable types: 0 continuous, 7275 integer (174 binary) Found heuristic solution: objective 179.0000000 Found heuristic solution: objective 156.0000000 Found heuristic solution: objective 154.0000000 Optimize a model with 744 rows, 7275 columns and 20414 nonzeros Presolved: 744 rows, 7275 columns, 20414 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 1.310e+04 Factor NZ : 9.152e+04 (roughly 4 MBytes of memory) Factor Ops : 1.752e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.81139704e+03 -2.56552315e+05 3.67e+05 3.51e-02 4.70e+02 0s 1 1.56455324e+03 -1.89205865e+05 4.50e+04 1.55e-15 6.65e+01 0s 2 6.64051730e+02 -8.79908356e+04 9.94e+03 3.33e-15 1.65e+01 0s 3 5.38545822e+02 -5.79311196e+04 5.10e+03 8.44e-15 8.63e+00 0s 4 4.05042807e+02 -2.13431634e+04 1.56e+03 8.72e-15 2.72e+00 0s 5 3.55742744e+02 -7.86763673e+03 2.48e+02 6.75e-14 7.38e-01 0s 6 3.50019944e+02 -5.32412525e+03 1.67e+02 4.80e-14 4.91e-01 0s 7 3.45627321e+02 -4.46710816e+03 1.42e+02 3.38e-14 4.09e-01 0s 8 3.38231790e+02 -3.48372838e+03 1.09e+02 2.66e-14 3.16e-01 0s 9 3.16808829e+02 -2.55550637e+03 5.40e+01 1.95e-14 2.18e-01 0s 10 3.04768273e+02 -2.28528252e+03 3.89e+01 1.73e-14 1.92e-01 0s 11 2.88440866e+02 -1.67828153e+03 2.19e+01 1.24e-14 1.42e-01 0s 12 2.55492231e+02 -1.22537372e+03 1.11e+01 8.66e-15 1.04e-01 0s 13 2.18969676e+02 -8.84347516e+02 8.50e+00 5.77e-15 7.75e-02 0s 14 2.04238421e+02 -8.09568248e+02 7.51e+00 5.66e-15 7.11e-02 0s 15 1.84745713e+02 -5.51082229e+02 6.26e+00 3.49e-15 5.15e-02 0s 16 1.87597743e+02 -4.52664792e+02 5.80e+00 3.83e-15 4.48e-02 0s 17 1.87967557e+02 -4.04280550e+02 5.13e+00 4.32e-15 4.13e-02 0s 18 1.73190833e+02 -3.46842436e+02 3.57e+00 4.86e-15 3.61e-02 0s 19 1.63802349e+02 -2.98345483e+02 3.29e+00 5.05e-15 3.21e-02 0s 20 1.21960034e+02 -2.05631875e+02 2.36e+00 4.55e-15 2.27e-02 0s 21 7.36980266e+01 -1.26171908e+02 1.24e+00 3.89e-15 1.38e-02 0s 22 5.29753535e+01 -7.33321108e+01 7.29e-01 3.15e-15 8.74e-03 0s 23 4.06302080e+01 -3.71971516e+01 4.43e-01 3.09e-15 5.38e-03 0s 24 3.48230856e+01 -4.91366117e+00 3.05e-01 2.80e-15 2.75e-03 0s 25 2.84652903e+01 8.60931388e+00 1.61e-01 2.66e-15 1.37e-03 0s 26 2.68632814e+01 1.58692534e+01 1.07e-01 3.28e-15 7.60e-04 0s 27 2.66535072e+01 1.74308579e+01 8.17e-02 3.18e-15 6.37e-04 0s 28 2.60878191e+01 1.93014884e+01 4.58e-02 3.38e-15 4.68e-04 0s 29 2.56744044e+01 2.09730806e+01 3.48e-02 3.25e-15 3.24e-04 0s 30 2.50756615e+01 2.21569500e+01 1.14e-02 3.26e-15 2.01e-04 0s 31 2.49585849e+01 2.36980189e+01 6.96e-03 2.63e-15 8.68e-05 1s 32 2.48783634e+01 2.42233583e+01 4.13e-03 2.76e-15 4.51e-05 1s 33 2.48176258e+01 2.44660245e+01 2.14e-03 2.72e-15 2.42e-05 1s 34 2.47821009e+01 2.45780320e+01 1.09e-03 2.85e-15 1.40e-05 1s 35 2.47690316e+01 2.46686789e+01 7.22e-04 2.41e-15 6.91e-06 1s 36 2.47596153e+01 2.47132279e+01 4.64e-04 2.19e-15 3.20e-06 1s 37 2.47485348e+01 2.47310273e+01 1.69e-04 2.54e-15 1.21e-06 1s 38 2.47425218e+01 2.47405678e+01 1.21e-05 1.84e-15 1.35e-07 1s 39 2.47420005e+01 2.47419985e+01 9.85e-13 2.13e-15 1.42e-10 1s 40 2.47420000e+01 2.47420000e+01 1.95e-12 3.02e-15 1.42e-13 1s Barrier solved model in 40 iterations and 0.67 seconds Optimal objective 2.47420000e+01 Root relaxation: objective 2.474200e+01, 4416 iterations, 0.77 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 24.74200 0 66 154.00000 24.74200 83.9% - 2s H 0 0 26.0000000 24.74200 4.84% - 2s H 0 0 25.0000000 24.74200 1.03% - 2s Explored 0 nodes (11443 simplex iterations) in 2.52 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+01, best bound 2.500000000000e+01, gap 0.0% Preprocessing time: 0.20 seconds Gurobi run time: 2.52 seconds Total run time: 2.72 seconds Objective: 25 Solution: 1 x [2, 2, 5, 12, 13, 16, 16, 18] 1 x [4, 5, 6, 8, 9, 10, 10, 10, 15, 15, 18] 1 x [4, 4, 5, 9, 9, 10, 15, 15, 15, 17, 17, 18] 4 x [3, 11, 12, 17, 18, 18] 2 x [2, 3, 5, 10, 12, 16, 16, 16, 16, 17] 1 x [3, 4, 6, 7, 7, 9, 15, 15] 2 x [1, 3, 5, 5, 6, 7, 7, 7] 1 x [1, 3, 4, 5, 5, 5, 5, 6, 8, 15, 15] 1 x [3, 4, 4, 4, 5, 6, 8, 9] 1 x [3, 3, 5, 7, 12, 17, 19] 1 x [2, 6, 6, 8, 8, 10, 11, 12] 1 x [1, 6, 8, 9, 11, 11, 14, 15] 1 x [4, 7, 11, 11, 11, 15, 15] 1 x [1, 1, 2, 6, 9, 10, 11, 11, 11] 4 x [4, 7, 7, 12, 14, 14] 1 x [4, 7, 8, 8, 9, 9, 10, 10, 12] 1 x [2, 2, 6, 6, 8, 9, 9, 10, 10, 12]