Build (method = -2) #dp: 26121 Step-3' Graph: 493 vertices and 7110 arcs (0.23s) Step-4' Graph: 368 vertices and 6640 arcs (0.23s) #V4/#V3 = 0.75 #A4/#A3 = 0.93 Ready! (0.23s) Optimize a model with 419 rows, 6641 columns and 19178 nonzeros Presolve removed 24 rows and 47 columns Presolve time: 0.09s Presolved: 395 rows, 6594 columns, 19093 nonzeros Variable types: 0 continuous, 6594 integer (235 binary) Found heuristic solution: objective 184.0000000 Optimize a model with 395 rows, 6594 columns and 19093 nonzeros Presolved: 395 rows, 6594 columns, 19093 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.159e+04 Factor NZ : 2.984e+04 (roughly 3 MBytes of memory) Factor Ops : 3.098e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.59070559e+03 -2.00263382e+05 1.23e+05 5.22e-02 1.25e+02 0s 1 2.61698040e+03 -4.53451998e+04 2.51e+04 1.44e-15 2.50e+01 0s 2 6.43815926e+02 -1.89168708e+04 3.53e+03 1.29e-14 4.29e+00 0s 3 4.51895763e+02 -7.53509871e+03 7.21e+02 5.13e-04 1.05e+00 0s 4 3.86504990e+02 -2.97557445e+03 9.45e+01 3.20e-14 2.94e-01 0s 5 3.66159074e+02 -2.10750756e+03 7.29e+01 2.24e-14 2.11e-01 0s 6 3.36460828e+02 -1.59013340e+03 5.78e+01 1.73e-14 1.62e-01 0s 7 3.20425794e+02 -1.01086537e+03 5.16e+01 1.11e-14 1.13e-01 0s 8 2.93437147e+02 -8.81972845e+02 4.03e+01 9.77e-15 9.76e-02 0s 9 1.98828105e+02 -3.89845827e+02 1.65e+01 3.77e-15 4.73e-02 0s 10 1.80820397e+02 -3.40716871e+02 1.31e+01 3.44e-15 4.15e-02 0s 11 1.53911357e+02 -3.02853750e+02 1.14e+01 2.66e-15 3.63e-02 0s 12 1.34310477e+02 -2.21531172e+02 9.49e+00 2.89e-15 2.83e-02 0s 13 1.15076485e+02 -1.64622562e+02 7.78e+00 2.66e-15 2.23e-02 0s 14 7.28415419e+01 -9.23561493e+01 4.10e+00 1.50e-15 1.30e-02 0s 15 5.00954890e+01 -5.09867721e+01 2.39e+00 1.67e-15 7.93e-03 0s 16 3.84887650e+01 -2.90912184e+01 1.38e+00 1.71e-15 5.25e-03 0s 17 3.66665801e+01 -1.56327642e+01 8.96e-01 1.47e-15 4.03e-03 0s 18 3.40453970e+01 9.62460000e+00 5.36e-01 1.35e-15 1.88e-03 0s 19 3.23810623e+01 1.79599920e+01 3.84e-01 1.50e-15 1.11e-03 0s 20 2.94664650e+01 2.55655925e+01 5.84e-02 1.26e-15 2.97e-04 0s 21 2.86972463e+01 2.71599063e+01 6.93e-03 1.45e-15 1.16e-04 0s 22 2.85867728e+01 2.84227301e+01 7.29e-04 1.23e-15 1.24e-05 0s 23 2.85715987e+01 2.85701534e+01 1.16e-13 1.40e-15 1.09e-07 0s 24 2.85714287e+01 2.85714273e+01 1.76e-13 1.21e-15 1.09e-10 0s 25 2.85714286e+01 2.85714286e+01 1.14e-13 1.26e-15 1.53e-16 0s Barrier solved model in 25 iterations and 0.15 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 4291 iterations, 0.21 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.57143 0 91 184.00000 28.57143 84.5% - 1s H 0 0 30.0000000 28.57143 4.76% - 1s H 0 0 29.0000000 28.57143 1.48% - 1s Explored 0 nodes (8313 simplex iterations) in 1.30 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.900000000000e+01, best bound 2.900000000000e+01, gap 0.0% Preprocessing time: 0.26 seconds Gurobi run time: 1.30 seconds Total run time: 1.56 seconds Objective: 29 Solution: 1 x [14, 28, 32, 38, 42, 42, 51] 2 x [7, 26, 30, 38, 46, 48, 49] 2 x [3, 4, 5, 10, 30, 38, 45] 2 x [8, 12, 22, 30, 37, 43, 46] 1 x [20, 27, 29, 37, 45] 1 x [3, 10, 18, 34, 36, 47, 47] 1 x [10, 17, 21, 33, 36, 42, 44] 2 x [2, 12, 23, 30, 36, 46, 47] 1 x [10, 17, 21, 23, 36, 43, 44] 1 x [25, 32, 33, 35, 39, 40, 41] 2 x [1, 5, 26, 32, 35, 50, 50] 2 x [24, 29, 29, 35, 44, 44, 49] 1 x [10, 26, 34, 45, 47, 49] 2 x [1, 6, 13, 29, 30, 32, 41] 1 x [14, 27, 29, 32, 41, 43, 51] 1 x [7, 11, 11, 31, 40, 43, 50] 1 x [22, 28, 31, 31, 39, 40, 41] 1 x [8, 9, 15, 20, 20, 29, 45] 1 x [8, 9, 19, 20, 20, 25, 45] 1 x [7, 12, 15, 16, 19, 44, 48] 1 x [3, 12, 16, 19, 45, 48, 50] 1 x [3, 5, 9, 11, 11, 11, 43]