Build (method = -2) #dp: 1898 Step-3' Graph: 31 vertices and 590 arcs (0.01s) Step-4' Graph: 31 vertices and 590 arcs (0.01s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.01s) Optimize a model with 71 rows, 591 columns and 1722 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.01s Presolved: 69 rows, 589 columns, 1718 nonzeros Variable types: 0 continuous, 589 integer (89 binary) Found heuristic solution: objective 200.0000000 Found heuristic solution: objective 151.0000000 Optimize a model with 69 rows, 589 columns and 1718 nonzeros Presolved: 69 rows, 589 columns, 1718 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.540e+02 Factor NZ : 1.680e+03 Factor Ops : 5.057e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.71386226e+03 -7.34095451e+03 2.80e+03 9.38e-02 8.38e+01 0s 1 1.29432027e+03 -3.78786773e+03 4.46e+02 7.77e-16 1.50e+01 0s 2 3.12656290e+02 -1.59784755e+03 2.63e+01 2.00e-15 2.06e+00 0s 3 1.65540301e+02 -1.35318812e+02 4.04e-01 8.88e-16 2.51e-01 0s 4 7.86633518e+01 -3.16492096e+01 6.21e-02 2.44e-16 9.13e-02 0s 5 6.06865136e+01 1.40047880e+01 2.63e-02 3.33e-16 3.86e-02 0s 6 5.46509133e+01 2.76928189e+01 1.20e-02 2.24e-16 2.23e-02 0s 7 5.11498893e+01 3.91083455e+01 5.52e-03 2.22e-16 9.95e-03 0s 8 5.00039073e+01 4.50201215e+01 3.41e-03 2.22e-16 4.12e-03 0s 9 4.92472899e+01 4.80756646e+01 1.54e-03 4.10e-16 9.67e-04 0s 10 4.84718111e+01 4.84169940e+01 2.60e-06 2.22e-16 4.53e-05 0s 11 4.84666668e+01 4.84666639e+01 7.73e-12 2.22e-16 2.40e-09 0s 12 4.84666667e+01 4.84666667e+01 3.62e-14 2.22e-16 2.40e-12 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 4.84666667e+01 Root relaxation: objective 4.846667e+01, 500 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 48.46667 0 21 151.00000 48.46667 67.9% - 0s H 0 0 49.0000000 48.46667 1.09% - 0s Explored 0 nodes (725 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.900000000000e+01, best bound 4.900000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 49 Solution: 3 x [14, 27, 34] 1 x [1, 14, 34] 4 x [7, 16, 27, 28, 35] 2 x [15, 22, 24, 35] 1 x [14, 35, 39, 40] 1 x [7, 19, 35] 1 x [5, 13, 24, 26] 3 x [4, 5, 12, 19, 28] 5 x [6, 11, 12, 30, 37] 8 x [10, 26, 32, 33] 1 x [9, 10, 16, 24, 37] 1 x [10, 20, 32, 32] 1 x [4, 16, 17, 19, 21, 31] 1 x [2, 4, 11, 16, 19, 31, 37] 1 x [3, 9, 16, 25, 30] 6 x [3, 21, 22, 24, 29] 3 x [9, 17, 18, 23, 28, 37] 2 x [9, 17, 23, 30, 36, 38] 2 x [9, 17, 19, 19, 23, 30] 1 x [8, 17, 21, 29, 31] 1 x [8, 17, 21, 31]