Build (method = -2) #dp: 68801 Step-3' Graph: 642 vertices and 10117 arcs (0.68s) Step-4' Graph: 462 vertices and 9764 arcs (0.69s) #V4/#V3 = 0.72 #A4/#A3 = 0.97 Ready! (0.69s) Optimize a model with 537 rows, 9765 columns and 28369 nonzeros Presolve removed 27 rows and 45 columns Presolve time: 0.26s Presolved: 510 rows, 9720 columns, 28333 nonzeros Variable types: 0 continuous, 9720 integer (6623 binary) Found heuristic solution: objective 55.0000000 Optimize a model with 510 rows, 9720 columns and 28333 nonzeros Presolved: 510 rows, 9720 columns, 28333 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 1.705e+04 Factor NZ : 5.014e+04 (roughly 5 MBytes of memory) Factor Ops : 6.525e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.35301033e+04 -1.12419115e+05 2.35e+05 1.77e-01 4.67e+01 0s 1 3.26012385e+03 -2.06544741e+04 4.32e+04 6.66e-16 8.38e+00 0s 2 6.62578530e+02 -7.59453922e+03 4.59e+03 2.00e-15 1.15e+00 0s 3 2.43592726e+02 -1.79647995e+03 5.72e+02 8.88e-16 1.89e-01 0s 4 1.08358749e+02 -3.75270175e+02 9.05e+01 9.99e-16 3.73e-02 0s 5 7.20590741e+01 -2.02470945e+02 3.88e+01 6.66e-16 1.89e-02 0s 6 5.01795165e+01 -1.02166445e+02 1.95e+01 3.68e-16 9.76e-03 0s 7 4.01920397e+01 -4.65139977e+01 1.38e+01 4.44e-16 5.55e-03 0s 8 3.27214873e+01 -2.59687597e+01 9.99e+00 3.00e-16 3.70e-03 0s 9 2.25592211e+01 -1.08871139e+01 4.42e+00 3.17e-16 1.97e-03 0s 10 1.98436397e+01 1.84989134e+00 2.86e+00 3.07e-16 1.04e-03 0s 11 1.80126400e+01 1.06730967e+01 1.11e+00 3.33e-16 4.02e-04 0s 12 1.68804838e+01 1.47291948e+01 3.23e-02 3.33e-16 1.11e-04 0s 13 1.66772049e+01 1.65010965e+01 6.25e-05 3.84e-16 9.05e-06 0s 14 1.66666705e+01 1.66666160e+01 3.26e-13 4.44e-16 2.80e-09 0s 15 1.66666667e+01 1.66666666e+01 2.65e-13 4.44e-16 2.80e-12 0s Barrier solved model in 15 iterations and 0.17 seconds Optimal objective 1.66666667e+01 Root relaxation: objective 1.666667e+01, 6576 iterations, 0.24 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 16.66667 0 51 55.00000 16.66667 69.7% - 1s H 0 0 17.0000000 16.66667 1.96% - 1s Explored 0 nodes (9831 simplex iterations) in 1.31 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.700000000000e+01, best bound 1.700000000000e+01, gap 0.0% Preprocessing time: 0.73 seconds Gurobi run time: 1.31 seconds Total run time: 2.03 seconds Objective: 17 Solution: 1 x [3, 8, 9, 36, 47, 60] 1 x [35, 36, 55, 56, 62, 64] 1 x [14, 24, 29, 32, 58, 62] 1 x [18, 25, 26, 30, 41, 74] 1 x [19, 21, 38, 43, 69] 1 x [4, 12, 38, 44, 52, 57] 1 x [3, 22, 40, 54, 72, 75] 1 x [11, 39, 42, 50, 66] 1 x [2, 7, 23, 34, 49, 68] 1 x [5, 36, 37, 54, 59, 70] 1 x [14, 22, 28, 35, 42, 51] 1 x [4, 5, 15, 33, 54, 67] 1 x [6, 10, 14, 28, 31, 42] 1 x [20, 27, 49, 56, 56, 69] 1 x [1, 9, 20, 48, 63, 65] 1 x [16, 17, 45, 53, 64, 71] 1 x [9, 13, 46, 61, 63, 73]