Build (method = -2) #dp: 27930 Step-3' Graph: 514 vertices and 7634 arcs (0.24s) Step-4' Graph: 380 vertices and 7220 arcs (0.25s) #V4/#V3 = 0.74 #A4/#A3 = 0.95 Ready! (0.25s) Optimize a model with 433 rows, 7221 columns and 20891 nonzeros Presolve removed 25 rows and 51 columns Presolve time: 0.10s Presolved: 408 rows, 7170 columns, 20796 nonzeros Variable types: 0 continuous, 7170 integer (261 binary) Found heuristic solution: objective 175.0000000 Optimize a model with 408 rows, 7170 columns and 20796 nonzeros Presolved: 408 rows, 7170 columns, 20796 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.262e+04 Factor NZ : 3.110e+04 (roughly 3 MBytes of memory) Factor Ops : 3.243e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.05975407e+04 -2.89171439e+05 1.24e+05 1.08e-01 1.48e+02 0s 1 2.88925010e+03 -7.84776731e+04 1.86e+04 1.78e-15 2.40e+01 0s 2 9.95460544e+02 -3.58476725e+04 3.25e+03 2.66e-15 5.56e+00 0s 3 4.84053194e+02 -1.34151642e+04 9.68e+02 4.88e-15 1.77e+00 0s 4 2.45813093e+02 -5.03577492e+03 1.66e+02 2.49e-14 4.77e-01 0s 5 2.05436696e+02 -1.64370099e+03 3.83e+01 1.58e-14 1.44e-01 0s 6 1.95343011e+02 -1.10572797e+03 1.37e+01 1.07e-14 9.45e-02 0s 7 1.90992350e+02 -5.78242967e+02 7.11e+00 6.33e-15 5.48e-02 0s 8 1.65968704e+02 -4.02018723e+02 1.15e+00 4.00e-15 3.97e-02 0s 9 1.11436718e+02 -2.31801063e+02 5.66e-01 2.22e-15 2.39e-02 0s 10 6.89748421e+01 -1.62004865e+02 3.25e-01 1.78e-15 1.61e-02 0s 11 5.41309225e+01 -9.61030909e+01 2.31e-01 1.10e-15 1.05e-02 0s 12 4.68205207e+01 -6.23013368e+01 1.83e-01 8.98e-16 7.60e-03 0s 13 3.95589442e+01 -2.91407332e+01 1.11e-01 7.81e-16 4.78e-03 0s 14 3.46065411e+01 -3.21503571e-01 5.71e-02 6.76e-16 2.43e-03 0s 15 3.19223373e+01 1.42393963e+01 3.12e-02 6.77e-16 1.23e-03 0s 16 3.02233935e+01 2.36360687e+01 1.41e-02 6.66e-16 4.58e-04 0s 17 2.90098589e+01 2.57301266e+01 4.08e-03 7.76e-16 2.28e-04 0s 18 2.86301050e+01 2.71915778e+01 4.60e-04 6.71e-16 1.00e-04 0s 19 2.85791796e+01 2.83314104e+01 3.75e-05 6.31e-16 1.72e-05 0s 20 2.85714550e+01 2.85711849e+01 7.94e-08 4.92e-16 1.88e-08 0s 21 2.85714286e+01 2.85714286e+01 2.66e-13 4.59e-16 4.29e-14 0s Barrier solved model in 21 iterations and 0.13 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 4734 iterations, 0.20 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.57143 0 88 175.00000 28.57143 83.7% - 1s H 0 0 31.0000000 28.57143 7.83% - 1s H 0 0 29.0000000 28.57143 1.48% - 1s Explored 0 nodes (7971 simplex iterations) in 1.20 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.28 seconds Gurobi run time: 1.20 seconds Total run time: 1.48 seconds Objective: 29 Solution: 1 x [6, 11, 20, 25, 40, 45, 45] 1 x [1, 6, 8, 13, 40, 40, 46] 2 x [4, 9, 35, 36, 39, 42, 50] 1 x [1, 1, 5, 30, 33, 39, 45] 1 x [30, 30, 33, 39, 41, 48, 49] 1 x [8, 11, 18, 30, 39, 43] 1 x [4, 9, 36, 36, 38, 42, 50] 1 x [2, 32, 34, 38, 41, 50, 53] 2 x [2, 14, 34, 38, 43, 43, 53] 1 x [3, 6, 8, 16, 27, 37, 47] 2 x [5, 7, 26, 32, 32, 51, 53] 1 x [3, 6, 8, 24, 32, 32, 51] 1 x [5, 6, 11, 28, 29, 31, 47] 3 x [1, 3, 11, 28, 29, 31, 52] 1 x [13, 19, 19, 27, 31, 43, 48] 1 x [20, 22, 27, 28, 44] 1 x [4, 4, 17, 22, 27, 28, 46] 2 x [8, 14, 22, 27, 28, 44, 44] 1 x [17, 18, 19, 20, 21, 25, 42] 1 x [10, 11, 11, 13, 18, 21, 25] 1 x [12, 12, 20, 22, 23, 23, 42] 2 x [10, 15, 16, 16, 17, 43, 47]