Build (method = -2) #dp: 48655 Step-3' Graph: 1405 vertices and 12038 arcs (0.33s) Step-4' Graph: 1335 vertices and 11901 arcs (0.34s) #V4/#V3 = 0.95 #A4/#A3 = 0.99 Ready! (0.34s) Optimize a model with 1355 rows, 11902 columns and 33044 nonzeros Presolve removed 83 rows and 144 columns Presolve time: 0.17s Presolved: 1272 rows, 11758 columns, 33038 nonzeros Variable types: 0 continuous, 11758 integer (698 binary) Found heuristic solution: objective 164.0000000 Found heuristic solution: objective 140.0000000 Found heuristic solution: objective 134.0000000 Optimize a model with 1272 rows, 11758 columns and 33038 nonzeros Presolve removed 1 rows and 1 columns Presolved: 1271 rows, 11757 columns, 33043 nonzeros Root barrier log... Ordering time: 0.02s Barrier statistics: AA' NZ : 2.015e+04 Factor NZ : 1.149e+05 (roughly 6 MBytes of memory) Factor Ops : 1.660e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.22094264e+04 -3.76142148e+05 6.39e+05 4.64e-02 3.74e+02 0s 1 3.26338279e+03 -2.52399560e+05 7.89e+04 7.77e-16 5.34e+01 0s 2 1.52476902e+03 -1.03220623e+05 1.95e+04 2.22e-15 1.38e+01 0s 3 1.16692538e+03 -3.93547534e+04 5.13e+03 5.77e-15 3.83e+00 0s 4 1.02307972e+03 -1.94589677e+04 3.30e+03 1.51e-14 2.09e+00 0s 5 9.36775779e+02 -1.61229921e+04 2.60e+03 8.88e-15 1.67e+00 0s 6 6.43592970e+02 -9.53766430e+03 1.23e+03 6.66e-15 8.54e-01 0s 7 5.14143244e+02 -5.54182478e+03 6.90e+02 8.44e-15 4.76e-01 0s 8 4.11550998e+02 -3.37195257e+03 3.16e+02 4.00e-15 2.50e-01 0s 9 3.81430788e+02 -2.05072615e+03 2.23e+02 1.78e-15 1.54e-01 0s 10 3.61638020e+02 -1.08697197e+03 1.64e+02 1.01e-15 8.94e-02 0s 11 3.24886841e+02 -5.20860249e+02 7.40e+01 7.42e-16 4.44e-02 0s 12 2.89509662e+02 -3.87849762e+02 6.14e+01 1.06e-15 3.53e-02 0s 13 2.41382368e+02 -2.88546129e+02 4.47e+01 1.13e-15 2.70e-02 0s 14 2.08830314e+02 -2.30839017e+02 3.60e+01 1.16e-15 2.21e-02 0s 15 1.81523648e+02 -1.88134958e+02 2.77e+01 1.34e-15 1.83e-02 0s 16 1.61893313e+02 -1.61799081e+02 2.32e+01 1.19e-15 1.58e-02 0s 17 1.43114430e+02 -1.49846954e+02 2.02e+01 1.34e-15 1.43e-02 0s 18 1.10104124e+02 -1.20935446e+02 1.53e+01 1.22e-15 1.12e-02 0s 19 7.73070561e+01 -8.38794747e+01 1.04e+01 1.03e-15 7.76e-03 0s 20 6.02828084e+01 -6.82378503e+01 7.88e+00 1.04e-15 6.14e-03 0s 21 4.29165187e+01 -4.32429425e+01 5.22e+00 8.88e-16 4.10e-03 0s 22 3.63138654e+01 -2.93577011e+01 4.19e+00 8.85e-16 3.12e-03 0s 23 3.41091682e+01 -2.35232382e+01 3.68e+00 1.01e-15 2.73e-03 0s 24 2.94854495e+01 -9.54623315e+00 2.71e+00 8.13e-16 1.83e-03 0s 25 2.63671080e+01 4.08479508e+00 1.88e+00 7.00e-16 1.04e-03 0s 26 2.51872162e+01 1.10739262e+01 1.25e+00 7.19e-16 6.47e-04 0s 27 2.45282888e+01 1.33239786e+01 1.04e+00 8.67e-16 5.11e-04 0s 28 2.39217225e+01 1.54033321e+01 8.40e-01 1.04e-15 3.86e-04 1s 29 2.26082100e+01 1.83285623e+01 3.78e-01 7.36e-16 1.90e-04 1s 30 2.21886076e+01 1.98571189e+01 2.29e-01 6.59e-16 1.03e-04 1s 31 2.18723882e+01 2.06859424e+01 1.01e-01 6.27e-16 5.19e-05 1s 32 2.17345288e+01 2.12043351e+01 5.04e-02 7.77e-16 2.32e-05 1s 33 2.16630445e+01 2.13468063e+01 2.75e-02 6.98e-16 1.38e-05 1s 34 2.15991164e+01 2.14441391e+01 9.52e-03 6.85e-16 6.70e-06 1s 35 2.15947785e+01 2.14661773e+01 8.56e-03 8.60e-16 5.57e-06 1s 36 2.15807982e+01 2.15118624e+01 5.31e-03 6.77e-16 2.99e-06 1s 37 2.15750794e+01 2.15236894e+01 4.10e-03 7.06e-16 2.23e-06 1s 38 2.15618179e+01 2.15417943e+01 1.28e-03 6.08e-16 8.66e-07 1s 39 2.15551583e+01 2.15536867e+01 5.23e-06 8.88e-16 6.26e-08 1s 40 2.15550002e+01 2.15549987e+01 2.12e-12 5.43e-16 6.32e-11 1s 41 2.15550000e+01 2.15550000e+01 1.26e-12 5.55e-16 6.75e-17 1s Barrier solved model in 41 iterations and 0.71 seconds Optimal objective 2.15550000e+01 Root relaxation: objective 2.155500e+01, 5963 iterations, 0.85 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 21.55500 0 71 134.00000 21.55500 83.9% - 3s H 0 0 23.0000000 21.55500 6.28% - 3s H 0 0 22.0000000 21.55500 2.02% - 4s Explored 0 nodes (16096 simplex iterations) in 4.31 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.200000000000e+01, best bound 2.200000000000e+01, gap 0.0% Preprocessing time: 0.38 seconds Gurobi run time: 4.31 seconds Total run time: 4.69 seconds Objective: 22 Solution: 2 x [1, 4, 8, 8, 9, 13, 15, 16, 19] 1 x [1, 2, 3, 3, 13, 15, 19, 19, 20] 1 x [1, 3, 3, 4, 4, 6, 15, 15, 18, 20] 2 x [3, 4, 5, 6, 13, 15, 15, 16, 16] 1 x [3, 6, 6, 9, 13, 15, 16, 18, 18] 1 x [9, 13, 15, 16, 18, 19, 20, 20] 1 x [11, 13, 13, 14, 15, 16, 18] 5 x [6, 8, 8, 9, 9, 10, 11, 12, 19] 1 x [2, 4, 5, 5, 6, 7, 7, 10, 11, 19] 1 x [3, 9, 9, 10, 10, 12, 15, 19] 1 x [3, 9, 10, 10, 12, 12, 15, 19] 1 x [2, 2, 2, 2, 2, 10, 10, 10, 10, 16] 3 x [4, 11, 11, 15, 16, 18, 19, 19, 20, 20] 1 x [3, 3, 3, 3, 4, 4, 4, 12, 17, 17]