Build (method = -2) #dp: 3869 Step-3' Graph: 558 vertices and 1667 arcs (0.02s) Step-4' Graph: 416 vertices and 1383 arcs (0.02s) #V4/#V3 = 0.75 #A4/#A3 = 0.83 Ready! (0.02s) Optimize a model with 433 rows, 1384 columns and 3324 nonzeros Presolve removed 118 rows and 224 columns Presolve time: 0.02s Presolved: 315 rows, 1160 columns, 3186 nonzeros Variable types: 0 continuous, 1160 integer (0 binary) Found heuristic solution: objective 59.0000000 Optimize a model with 315 rows, 1160 columns and 3186 nonzeros Presolved: 315 rows, 1160 columns, 3186 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.172e+03 Factor NZ : 1.032e+04 Factor Ops : 5.053e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.43280769e+02 -1.81297084e+04 2.03e+04 1.11e-16 5.01e+01 0s 1 2.15379693e+02 -1.01246122e+04 3.52e+03 5.55e-16 1.08e+01 0s 2 1.29864308e+02 -3.69456857e+03 8.08e+02 9.55e-15 2.85e+00 0s 3 7.40296276e+01 -6.28076975e+02 6.98e+01 7.22e-16 3.86e-01 0s 4 5.38312156e+01 -2.23083879e+02 1.58e+01 5.41e-16 1.33e-01 0s 5 4.43026960e+01 -1.28717249e+02 5.82e+00 6.73e-16 7.81e-02 0s 6 3.66607757e+01 -1.12372606e+02 3.26e+00 6.83e-16 6.60e-02 0s 7 3.38042092e+01 -7.71312870e+01 2.15e+00 5.67e-16 4.87e-02 0s 8 2.78367892e+01 -4.70737825e+01 1.41e+00 4.52e-16 3.28e-02 0s 9 2.47343001e+01 -1.86885274e+00 7.01e-01 3.59e-16 1.16e-02 0s 10 2.27659800e+01 1.13634218e+01 3.69e-01 4.18e-16 4.96e-03 0s 11 2.14486095e+01 1.53356332e+01 1.73e-01 3.17e-16 2.65e-03 0s 12 2.10164394e+01 1.81533189e+01 1.01e-01 4.01e-16 1.24e-03 0s 13 2.07708698e+01 1.94303215e+01 5.86e-02 5.54e-16 5.81e-04 0s 14 2.06425717e+01 1.98493573e+01 3.74e-02 4.40e-16 3.44e-04 0s 15 2.05188261e+01 2.00846732e+01 1.59e-02 3.57e-16 1.88e-04 0s 16 2.04410471e+01 2.02771500e+01 3.67e-03 3.32e-16 7.06e-05 0s 17 2.04117180e+01 2.03563749e+01 5.69e-04 2.88e-16 2.38e-05 0s 18 2.04067286e+01 2.03756800e+01 3.32e-04 3.00e-16 1.33e-05 0s 19 2.04040144e+01 2.03853095e+01 2.18e-04 3.33e-16 8.03e-06 0s 20 2.04005049e+01 2.03931859e+01 8.54e-05 5.55e-16 3.14e-06 0s 21 2.03978092e+01 2.03970550e+01 7.56e-06 2.22e-16 3.24e-07 0s 22 2.03975194e+01 2.03975125e+01 6.42e-08 3.33e-16 2.98e-09 0s 23 2.03975155e+01 2.03975155e+01 3.65e-11 2.34e-16 2.98e-12 0s Barrier solved model in 23 iterations and 0.03 seconds Optimal objective 2.03975155e+01 Root relaxation: objective 2.039752e+01, 183 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.39752 0 70 59.00000 20.39752 65.4% - 0s H 0 0 34.0000000 20.39752 40.0% - 0s H 0 0 22.0000000 20.39752 7.28% - 0s H 0 0 21.0000000 20.39752 2.87% - 0s Explored 0 nodes (419 simplex iterations) in 0.11 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.100000000000e+01, best bound 2.100000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.11 seconds Total run time: 0.14 seconds Objective: 21 Solution: 2 x [1, 2, 3, 6, 7, 8, 12, 15, 17] 1 x [1, 2, 3, 6, 8, 11, 12, 13, 16, 17] 1 x [1, 2, 3, 6, 12, 13, 16, 17] 2 x [1, 2, 3, 8, 9, 11, 12, 13, 14, 17] 1 x [1, 2, 3, 8, 11, 12, 13, 16, 17] 1 x [1, 2, 4, 5, 6, 7, 10, 16] 5 x [1, 2, 4, 6, 7, 8, 11, 15, 16] 2 x [1, 3, 4, 5, 6, 10, 11, 13, 16, 17] 2 x [2, 3, 5, 6, 7, 9, 11, 12, 16, 17] 1 x [2, 6, 8, 9, 12, 13, 15, 16, 17] 3 x [4, 5, 6, 7, 8, 9, 11, 12, 13, 15, 17]