Build (method = -2) #dp: 20427 Step-3' Graph: 348 vertices and 1610 arcs (0.11s) Step-4' Graph: 271 vertices and 1458 arcs (0.11s) #V4/#V3 = 0.78 #A4/#A3 = 0.91 Ready! (0.11s) Optimize a model with 290 rows, 1459 columns and 3843 nonzeros Presolve removed 29 rows and 53 columns Presolve time: 0.01s Presolved: 261 rows, 1406 columns, 3793 nonzeros Variable types: 0 continuous, 1406 integer (22 binary) Found heuristic solution: objective 196.0000000 Optimize a model with 261 rows, 1406 columns and 3793 nonzeros Presolved: 261 rows, 1406 columns, 3793 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.331e+03 Factor NZ : 8.181e+03 Factor Ops : 3.181e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.06848748e+03 -4.10173726e+04 5.48e+04 1.44e-01 1.71e+02 0s 1 9.88459707e+02 -2.14193737e+04 8.62e+03 6.66e-16 2.99e+01 0s 2 3.74090666e+02 -8.09146706e+03 1.54e+03 6.66e-16 6.25e+00 0s 3 2.31106678e+02 -1.35699241e+03 1.92e+02 2.66e-15 8.49e-01 0s 4 1.98101604e+02 -2.91131907e+02 2.74e+01 2.22e-15 1.95e-01 0s 5 1.65409805e+02 -3.01669236e+02 1.86e+01 2.00e-15 1.81e-01 0s 6 1.08497244e+02 -1.56142812e+02 7.22e+00 1.44e-15 9.84e-02 0s 7 8.15992372e+01 -6.22073114e+01 5.03e+00 3.89e-16 5.35e-02 0s 8 5.07112527e+01 -3.69566340e+01 2.48e+00 5.41e-16 3.22e-02 0s 9 3.74890472e+01 -1.10010660e+01 1.11e+00 3.21e-16 1.76e-02 0s 10 3.31550413e+01 1.47103306e+01 6.87e-01 3.30e-16 6.74e-03 0s 11 3.09518975e+01 2.38502193e+01 3.97e-01 2.46e-16 2.60e-03 0s 12 2.88698533e+01 2.79252312e+01 8.43e-04 2.90e-16 3.34e-04 0s 13 2.85722718e+01 2.85650766e+01 5.10e-06 3.33e-16 2.54e-06 0s 14 2.85714294e+01 2.85714222e+01 4.39e-13 3.33e-16 2.54e-09 0s 15 2.85714286e+01 2.85714286e+01 5.09e-13 3.33e-16 2.87e-15 0s Barrier solved model in 15 iterations and 0.02 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 940 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.57143 0 36 196.00000 28.57143 85.4% - 0s H 0 0 30.0000000 28.57143 4.76% - 0s H 0 0 29.0000000 28.57143 1.48% - 0s Explored 0 nodes (2172 simplex iterations) in 0.15 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.12 seconds Gurobi run time: 0.15 seconds Total run time: 0.27 seconds Objective: 29 Solution: 1 x [4, 5, 6, 8, 11, 13, 19] 1 x [5, 8, 10, 14, 17, 18, 19] 6 x [4, 4, 5, 10, 11, 14, 18] 1 x [3, 4, 7, 7, 10, 14] 1 x [3, 7, 7, 7, 7, 10, 18] 3 x [1, 2, 4, 6, 11, 12, 13] 1 x [2, 2, 3, 12, 19] 1 x [1, 10, 13, 15, 17, 17, 18] 11 x [1, 6, 9, 13, 16, 18, 19] 1 x [1, 6, 11, 11, 12, 13, 19] 2 x [3, 10, 10, 12, 14, 14, 19]