Build (method = -2) #dp: 3261 Step-3' Graph: 269 vertices and 1073 arcs (0.02s) Step-4' Graph: 212 vertices and 959 arcs (0.02s) #V4/#V3 = 0.79 #A4/#A3 = 0.89 Ready! (0.02s) Optimize a model with 222 rows, 960 columns and 2463 nonzeros Presolve removed 44 rows and 88 columns Presolve time: 0.01s Presolved: 178 rows, 872 columns, 2343 nonzeros Variable types: 0 continuous, 872 integer (0 binary) Found heuristic solution: objective 693.0000000 Optimize a model with 178 rows, 872 columns and 2343 nonzeros Presolved: 178 rows, 872 columns, 2343 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.345e+03 Factor NZ : 4.254e+03 Factor Ops : 1.122e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.06075881e+04 -2.43875335e+05 1.66e+05 2.22e-16 9.61e+02 0s 1 3.31682966e+03 -1.17103057e+05 2.78e+04 6.66e-16 1.86e+02 0s 2 1.71135355e+03 -4.28993240e+04 6.77e+03 3.11e-15 4.80e+01 0s 3 1.15594885e+03 -9.07364731e+03 5.11e+02 3.77e-15 7.07e+00 0s 4 1.00183685e+03 -1.86814868e+03 1.45e+02 2.22e-15 1.81e+00 0s 5 9.40860053e+02 -9.71920202e+02 1.93e-01 1.33e-15 1.09e+00 0s 6 7.55351116e+02 -9.20004900e+02 1.47e-01 9.99e-16 9.55e-01 0s 7 4.46763404e+02 -4.67532550e+02 8.66e-02 4.44e-16 5.21e-01 0s 8 3.79234174e+02 -1.79630807e+02 7.15e-02 3.33e-16 3.19e-01 0s 9 3.39733958e+02 -1.25019500e+02 6.34e-02 4.44e-16 2.65e-01 0s 10 2.18068291e+02 -2.75472549e+01 3.15e-02 2.70e-16 1.40e-01 0s 11 1.77809693e+02 3.98764651e+01 1.81e-02 2.22e-16 7.86e-02 0s 12 1.54977051e+02 6.81482457e+01 1.06e-02 2.22e-16 4.95e-02 0s 13 1.48048851e+02 1.04912090e+02 7.62e-03 1.91e-16 2.46e-02 0s 14 1.38099603e+02 1.18381366e+02 2.50e-03 1.81e-16 1.12e-02 0s 15 1.35476792e+02 1.26027942e+02 1.31e-03 2.22e-16 5.39e-03 0s 16 1.32834964e+02 1.29101122e+02 4.49e-04 1.11e-16 2.13e-03 0s 17 1.32101721e+02 1.29785123e+02 2.61e-04 2.22e-16 1.32e-03 0s 18 1.31403292e+02 1.30367032e+02 1.02e-04 1.95e-16 5.91e-04 0s 19 1.31272721e+02 1.30623821e+02 7.37e-05 1.13e-16 3.70e-04 0s 20 1.31059989e+02 1.30810283e+02 2.84e-05 1.74e-16 1.42e-04 0s 21 1.30947333e+02 1.30881011e+02 6.19e-06 1.85e-16 3.78e-05 0s 22 1.30912186e+02 1.30905379e+02 3.71e-07 3.23e-16 3.88e-06 0s 23 1.30909017e+02 1.30908937e+02 6.78e-10 2.65e-16 4.53e-08 0s 24 1.30909000e+02 1.30909000e+02 3.78e-13 3.33e-16 9.48e-13 0s Barrier solved model in 24 iterations and 0.02 seconds Optimal objective 1.30909000e+02 Root relaxation: objective 1.309090e+02, 105 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 130.90900 0 33 693.00000 130.90900 81.1% - 0s H 0 0 132.0000000 130.90900 0.83% - 0s H 0 0 131.0000000 130.90900 0.07% - 0s Explored 0 nodes (190 simplex iterations) in 0.06 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.310000000000e+02, best bound 1.310000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.06 seconds Total run time: 0.09 seconds Objective: 131 Solution: 21 x [2, 3, 7, 9, 9, 9, 10] 15 x [2, 4, 4, 6, 6, 7, 9, 9] 16 x [2, 3, 4, 4, 4, 5, 6, 7] 16 x [4, 4, 5, 6, 6, 7, 7, 8] 4 x [1, 3, 3, 3, 5, 7, 7, 8] 12 x [6, 6, 7, 7, 7, 8, 8] 7 x [4, 4, 7, 7, 7, 7] 1 x [3, 4, 4, 4, 6, 8, 9] 22 x [2, 4, 6, 6, 8, 8, 8, 9] 13 x [2, 3, 5, 8, 8, 8, 9, 9] 4 x [3, 3, 3, 4, 4, 4, 6, 6]