Build (method = -2) #dp: 66824 Step-3' Graph: 1232 vertices and 8172 arcs (0.47s) Step-4' Graph: 1139 vertices and 7991 arcs (0.48s) #V4/#V3 = 0.92 #A4/#A3 = 0.98 Ready! (0.48s) Optimize a model with 1158 rows, 7992 columns and 21706 nonzeros Presolve removed 141 rows and 274 columns Presolve time: 0.10s Presolved: 1017 rows, 7718 columns, 21435 nonzeros Variable types: 0 continuous, 7718 integer (0 binary) Found heuristic solution: objective 178.0000000 Optimize a model with 1017 rows, 7718 columns and 21435 nonzeros Presolved: 1017 rows, 7718 columns, 21435 nonzeros Root barrier log... Ordering time: 0.04s Barrier statistics: AA' NZ : 1.352e+04 Factor NZ : 1.088e+05 (roughly 4 MBytes of memory) Factor Ops : 1.960e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.55019783e+03 -2.10967710e+05 1.49e+05 2.22e-16 1.20e+02 0s 1 7.11891370e+02 -1.29257735e+05 2.72e+04 1.11e-15 2.64e+01 0s 2 4.45938874e+02 -6.29034917e+04 8.80e+03 1.55e-15 9.40e+00 0s 3 2.79234538e+02 -2.64855692e+04 2.66e+03 2.22e-15 3.16e+00 0s 4 2.10198423e+02 -8.35209026e+03 3.62e+02 1.64e-14 7.26e-01 0s 5 2.00285596e+02 -2.15887076e+03 2.58e+01 7.11e-15 1.62e-01 0s 6 1.98720161e+02 -5.48286773e+02 2.06e-02 2.00e-15 4.84e-02 0s 7 1.51992939e+02 -5.68639508e+02 1.24e-02 2.11e-15 4.66e-02 0s 8 1.50680901e+02 -4.84987944e+02 1.16e-02 1.67e-15 4.11e-02 0s 9 1.26652498e+02 -3.22705406e+02 8.69e-03 1.33e-15 2.91e-02 0s 10 1.06880552e+02 -1.88334101e+02 6.47e-03 8.88e-16 1.91e-02 0s 11 8.76230443e+01 -1.09896012e+02 5.13e-03 4.89e-16 1.28e-02 0s 12 5.64065162e+01 -5.52306885e+01 2.86e-03 3.53e-16 7.22e-03 0s 13 3.89614488e+01 -3.46654708e+01 1.86e-03 2.45e-16 4.76e-03 0s 14 3.67351219e+01 -1.93774053e+01 1.71e-03 2.95e-16 3.63e-03 0s 15 3.16222345e+01 -9.76377382e+00 1.29e-03 3.09e-16 2.68e-03 0s 16 2.58455836e+01 5.11679175e-01 8.21e-04 2.52e-16 1.64e-03 0s 17 2.25086131e+01 8.63508822e+00 5.26e-04 2.22e-16 8.98e-04 0s 18 2.15738008e+01 1.42378765e+01 3.07e-04 3.33e-16 4.75e-04 0s 19 2.01988586e+01 1.83224460e+01 1.45e-05 3.10e-16 1.21e-04 0s 20 2.00017457e+01 1.99825534e+01 2.35e-08 2.70e-16 1.24e-06 0s 21 2.00000017e+01 1.99999826e+01 9.46e-13 3.65e-16 1.24e-09 0s 22 2.00000000e+01 2.00000000e+01 1.26e-12 3.02e-16 1.24e-12 0s Barrier solved model in 22 iterations and 0.39 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 5459 iterations, 0.48 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.00000 0 71 178.00000 20.00000 88.8% - 2s H 0 0 22.0000000 20.00000 9.09% - 2s H 0 0 20.0000000 20.00000 0.0% - 2s Explored 0 nodes (11864 simplex iterations) in 2.25 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.51 seconds Gurobi run time: 2.25 seconds Total run time: 2.76 seconds Objective: 20 Solution: 2 x [9, 10, 11, 11, 11, 11, 15, 15, 15, 19] 1 x [5, 5, 5, 5, 5, 6, 6, 8, 17, 19] 2 x [4, 6, 6, 6, 7, 10, 12, 12, 19, 19] 3 x [4, 8, 8, 10, 10, 12, 15, 18, 19, 19] 1 x [4, 6, 6, 8, 8, 12, 12, 17, 19, 19] 1 x [6, 6, 8, 12, 12, 14, 15, 17, 19, 19] 3 x [4, 10, 10, 11, 13, 13, 15, 16, 18, 18] 1 x [4, 6, 6, 11, 11, 11, 11, 12, 12, 12] 1 x [1, 6, 6, 8, 12, 13, 13, 14, 16, 17] 1 x [1, 6, 6, 8, 10, 10, 14, 16, 17, 18] 1 x [3, 9, 10, 10, 10, 10, 11, 14, 15, 18] 2 x [2, 3, 7, 7, 7, 7, 13, 13, 14, 18] 1 x [2, 3, 7, 7, 9, 10, 13, 13, 14, 14]