Build (method = -2) #dp: 29614 Step-3' Graph: 710 vertices and 4184 arcs (0.17s) Step-4' Graph: 646 vertices and 4058 arcs (0.18s) #V4/#V3 = 0.91 #A4/#A3 = 0.97 Ready! (0.18s) Optimize a model with 666 rows, 4059 columns and 10894 nonzeros Presolve removed 87 rows and 167 columns Presolve time: 0.06s Presolved: 579 rows, 3892 columns, 10719 nonzeros Variable types: 0 continuous, 3892 integer (239 binary) Found heuristic solution: objective 152.0000000 Optimize a model with 579 rows, 3892 columns and 10719 nonzeros Presolved: 579 rows, 3892 columns, 10719 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 6.763e+03 Factor NZ : 3.658e+04 (roughly 2 MBytes of memory) Factor Ops : 3.914e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.01261905e+03 -8.82852202e+04 9.59e+04 4.23e-02 1.20e+02 0s 1 7.63391989e+02 -4.77781989e+04 1.35e+04 6.66e-16 2.04e+01 0s 2 4.25758395e+02 -1.89639299e+04 3.88e+03 2.11e-15 5.90e+00 0s 3 3.22153999e+02 -5.31317528e+03 7.66e+02 3.55e-15 1.26e+00 0s 4 2.40413674e+02 -2.50241734e+03 1.55e+02 5.33e-15 4.46e-01 0s 5 2.17430673e+02 -1.01224718e+03 8.52e+01 8.88e-16 1.91e-01 0s 6 2.00035679e+02 -4.91920056e+02 4.32e+01 4.89e-16 1.00e-01 0s 7 1.98628168e+02 -4.20134441e+02 4.06e+01 5.55e-16 9.03e-02 0s 8 1.74570324e+02 -3.59933212e+02 2.62e+01 5.31e-16 7.58e-02 0s 9 1.03266206e+02 -2.26889533e+02 1.37e+01 4.34e-16 4.58e-02 0s 10 7.50051254e+01 -1.27264760e+02 9.09e+00 4.52e-16 2.80e-02 0s 11 6.75762152e+01 -1.11217977e+02 8.07e+00 5.69e-16 2.48e-02 0s 12 5.47736276e+01 -4.61278357e+01 6.26e+00 3.86e-16 1.42e-02 0s 13 4.07625724e+01 -2.60673315e+01 4.09e+00 2.67e-16 9.34e-03 0s 14 3.30827025e+01 -5.93007747e+00 2.62e+00 3.15e-16 5.43e-03 0s 15 2.86490749e+01 1.02304439e+01 1.37e+00 2.22e-16 2.53e-03 0s 16 2.66464510e+01 1.86787278e+01 6.81e-01 2.33e-16 1.08e-03 0s 17 2.66368749e+01 2.01731480e+01 6.05e-01 2.77e-16 8.79e-04 0s 18 2.52403960e+01 2.41031126e+01 4.05e-02 3.12e-16 1.48e-04 0s 19 2.50005598e+01 2.49947886e+01 9.33e-13 3.33e-16 7.40e-07 0s 20 2.50000006e+01 2.49999948e+01 7.42e-13 2.82e-16 7.40e-10 0s 21 2.50000000e+01 2.50000000e+01 4.92e-13 3.33e-16 7.40e-13 0s Barrier solved model in 21 iterations and 0.12 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 2592 iterations, 0.15 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 25.00000 0 47 152.00000 25.00000 83.6% - 0s H 0 0 27.0000000 25.00000 7.41% - 0s H 0 0 26.0000000 25.00000 3.85% - 0s 0 0 25.00000 0 19 26.00000 25.00000 3.85% - 1s 0 0 25.00000 0 62 26.00000 25.00000 3.85% - 1s H 0 0 25.0000000 25.00000 0.0% - 1s Explored 0 nodes (13171 simplex iterations) in 1.65 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: 1.65 seconds Total run time: 1.85 seconds Objective: 25 Solution: 3 x [5, 5, 7, 11, 16, 16, 17, 17] 1 x [3, 7, 11, 12, 12, 13, 15, 18] 2 x [4, 7, 9, 9, 9, 9, 9, 11] 1 x [2, 3, 4, 6, 12, 12, 16, 16] 1 x [2, 3, 5, 9, 9, 14, 16, 16] 1 x [4, 11, 12, 12, 14, 16, 19, 20] 2 x [4, 4, 9, 10, 10, 17, 19, 20] 3 x [3, 4, 4, 9, 17, 18, 19, 20] 1 x [11, 12, 12, 14, 16, 19, 19, 20] 1 x [4, 6, 6, 8, 11, 16, 17, 18] 4 x [1, 6, 6, 11, 12, 12, 16, 16] 2 x [4, 6, 6, 8, 11, 13, 17, 18] 1 x [8, 9, 10, 12, 13, 13, 13, 20] 2 x [4, 8, 17, 18, 18, 18, 20, 20]