Build (method = -2) #dp: 8809 Step-3' Graph: 320 vertices and 3937 arcs (0.09s) Step-4' Graph: 212 vertices and 3641 arcs (0.09s) #V4/#V3 = 0.66 #A4/#A3 = 0.92 Ready! (0.09s) Optimize a model with 257 rows, 3642 columns and 10508 nonzeros Presolve removed 4 rows and 4 columns Presolve time: 0.06s Presolved: 253 rows, 3638 columns, 10515 nonzeros Variable types: 0 continuous, 3638 integer (866 binary) Found heuristic solution: objective 84.0000000 Optimize a model with 253 rows, 3638 columns and 10515 nonzeros Presolved: 253 rows, 3638 columns, 10515 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.833e+03 Factor NZ : 1.430e+04 (roughly 2 MBytes of memory) Factor Ops : 1.066e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.27393886e+03 -4.28630744e+04 6.04e+04 2.12e-01 7.51e+01 0s 1 2.32414690e+03 -1.10839415e+04 1.21e+04 2.00e-15 1.50e+01 0s 2 5.55234255e+02 -5.38389497e+03 1.70e+03 3.11e-15 2.55e+00 0s 3 2.69458362e+02 -1.77143399e+03 1.80e+02 4.66e-15 4.17e-01 0s 4 1.49719425e+02 -3.83639847e+02 2.39e+01 1.55e-15 8.55e-02 0s 5 1.11360483e+02 -1.79091440e+02 1.52e+01 1.65e-15 4.59e-02 0s 6 1.05258931e+02 -1.65013911e+02 1.38e+01 1.37e-15 4.26e-02 0s 7 8.36909775e+01 -1.23141166e+02 9.91e+00 1.80e-15 3.20e-02 0s 8 5.09648810e+01 -6.71277510e+01 5.27e+00 1.35e-15 1.79e-02 0s 9 2.91446604e+01 -2.19992064e+01 1.46e+00 1.79e-15 7.37e-03 0s 10 2.55463183e+01 7.47562984e+00 7.52e-01 1.22e-15 2.58e-03 0s 11 2.46463470e+01 1.39176006e+01 5.88e-01 1.28e-15 1.53e-03 0s 12 2.35368406e+01 1.79574281e+01 3.91e-01 1.24e-15 7.90e-04 0s 13 2.28099179e+01 1.96991292e+01 2.74e-01 1.35e-15 4.39e-04 0s 14 2.13102054e+01 2.03834697e+01 3.43e-02 1.22e-15 1.28e-04 0s 15 2.10974880e+01 2.07650611e+01 1.14e-02 1.37e-15 4.60e-05 0s 16 2.09950391e+01 2.09230815e+01 1.75e-03 1.15e-15 9.92e-06 0s 17 2.09757383e+01 2.09502327e+01 3.41e-04 1.11e-15 3.50e-06 0s 18 2.09704870e+01 2.09695908e+01 2.52e-07 1.32e-15 1.23e-07 0s 19 2.09703127e+01 2.09703118e+01 1.28e-13 1.25e-15 1.23e-10 0s 20 2.09703125e+01 2.09703125e+01 4.85e-14 1.43e-15 1.23e-13 0s Barrier solved model in 20 iterations and 0.08 seconds Optimal objective 2.09703125e+01 Root relaxation: objective 2.097031e+01, 1365 iterations, 0.10 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.97031 0 54 84.00000 20.97031 75.0% - 0s H 0 0 22.0000000 20.97031 4.68% - 0s H 0 0 21.0000000 20.97031 0.14% - 0s Explored 0 nodes (2925 simplex iterations) in 0.44 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.11 seconds Gurobi run time: 0.44 seconds Total run time: 0.55 seconds Objective: 21 Solution: 1 x [38, 40, 43, 44, 45] 1 x [32, 33, 39, 43, 45] 2 x [38, 39, 42, 42, 44] 1 x [33, 35, 41, 42, 43] 1 x [33, 34, 36, 41, 43] 1 x [2, 6, 9, 18, 18, 39] 1 x [3, 5, 6, 12, 29, 37] 1 x [3, 5, 6, 22, 25, 33] 1 x [3, 3, 7, 17, 30, 32] 1 x [2, 6, 9, 9, 30, 31] 1 x [1, 4, 7, 24, 27, 31] 1 x [7, 8, 10, 12, 24, 31] 1 x [3, 3, 7, 26, 26, 30] 1 x [3, 6, 16, 17, 21, 30] 1 x [1, 13, 15, 17, 19, 28] 1 x [6, 11, 15, 15, 20, 27] 1 x [6, 13, 14, 16, 21, 24] 1 x [3, 6, 18, 21, 23, 23] 1 x [1, 11, 15, 20, 23, 23] 1 x [7, 10, 10, 20, 23, 23]