Build (method = -2) #dp: 35210 Step-3' Graph: 840 vertices and 11102 arcs (0.31s) Step-4' Graph: 761 vertices and 10956 arcs (0.32s) #V4/#V3 = 0.91 #A4/#A3 = 0.99 Ready! (0.32s) Optimize a model with 796 rows, 10957 columns and 31343 nonzeros Presolve removed 42 rows and 54 columns Presolve time: 0.36s Presolved: 754 rows, 10903 columns, 31372 nonzeros Variable types: 0 continuous, 10903 integer (7160 binary) Found heuristic solution: objective 23.0000000 Found heuristic solution: objective 20.0000000 Optimize a model with 754 rows, 10903 columns and 31372 nonzeros Presolved: 754 rows, 10903 columns, 31372 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 1.957e+04 Factor NZ : 8.442e+04 (roughly 5 MBytes of memory) Factor Ops : 1.354e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.72793430e+03 -5.31376993e+04 6.72e+04 2.03e-01 2.64e+01 0s 1 1.90882760e+03 -2.08925439e+04 3.37e+04 2.22e-15 1.26e+01 0s 2 3.17561218e+02 -9.92771381e+03 2.90e+03 2.44e-15 1.41e+00 0s 3 1.92488172e+02 -3.06130014e+03 5.69e+02 1.89e-15 3.23e-01 0s 4 1.22622898e+02 -6.66305380e+02 1.12e+02 1.93e-15 6.82e-02 0s 5 8.12392763e+01 -3.25338084e+02 4.41e+01 2.24e-15 3.06e-02 0s 6 6.27614100e+01 -1.85428389e+02 2.70e+01 2.62e-15 1.80e-02 0s 7 3.73529413e+01 -1.05381516e+02 1.21e+01 2.25e-15 9.14e-03 0s 8 2.50855253e+01 -4.89882639e+01 5.97e+00 2.29e-15 4.46e-03 0s 9 1.81655695e+01 -3.68086397e+01 2.61e+00 2.70e-15 2.95e-03 0s 10 1.50078004e+01 -2.94532345e+01 2.04e+00 3.22e-15 2.35e-03 0s 11 1.29839751e+01 -2.61206423e+01 1.66e+00 3.61e-15 2.03e-03 0s 12 1.12663792e+01 -1.70230502e+01 1.31e+00 3.77e-15 1.45e-03 0s 13 7.48653013e+00 -7.62604395e+00 5.74e-01 2.83e-15 7.42e-04 0s 14 7.11437839e+00 -5.10957071e+00 4.73e-01 3.12e-15 5.96e-04 0s 15 6.84143501e+00 -1.49345412e+00 4.02e-01 2.75e-15 4.06e-04 0s 16 6.15922303e+00 2.12272756e+00 2.12e-01 2.53e-15 1.93e-04 0s 17 5.76601607e+00 4.18814341e+00 4.23e-02 2.14e-15 7.34e-05 0s 18 5.58857349e+00 5.38194799e+00 5.39e-03 1.83e-15 9.57e-06 0s 19 5.55921124e+00 5.52318408e+00 4.20e-04 2.33e-15 1.66e-06 0s 20 5.55555942e+00 5.55552305e+00 4.34e-13 2.22e-15 1.67e-09 0s 21 5.55555556e+00 5.55555552e+00 1.97e-13 2.67e-15 1.67e-12 0s Barrier solved model in 21 iterations and 0.34 seconds Optimal objective 5.55555556e+00 Root relaxation: objective 5.555556e+00, 7061 iterations, 0.49 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 5.55556 0 50 20.00000 5.55556 72.2% - 3s H 0 0 8.0000000 5.55556 30.6% - 3s H 0 0 7.0000000 5.55556 20.6% - 3s 0 0 5.55556 0 127 7.00000 5.55556 20.6% - 3s H 0 0 6.0000000 5.55556 7.41% - 3s Cutting planes: Gomory: 1 Explored 0 nodes (15477 simplex iterations) in 3.90 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.000000000000e+00, best bound 6.000000000000e+00, gap 0.0% Preprocessing time: 0.37 seconds Gurobi run time: 3.90 seconds Total run time: 4.26 seconds Objective: 6 Solution: 1 x [1, 7, 11, 17, 17, 18, 18, 21, 31] 1 x [2, 6, 10, 12, 12, 13, 16, 19, 21] 1 x [3, 3, 9, 14, 15, 17, 20, 22, 35] 1 x [8, 17, 23, 24, 24, 29, 30, 35] 1 x [4, 5, 14, 15, 25, 27, 28, 33] 1 x [5, 12, 15, 26, 32, 32, 34]