Build (method = -2) #dp: 56593 Step-3' Graph: 1122 vertices and 8941 arcs (0.39s) Step-4' Graph: 1062 vertices and 8822 arcs (0.40s) #V4/#V3 = 0.95 #A4/#A3 = 0.99 Ready! (0.40s) Optimize a model with 1081 rows, 8823 columns and 24358 nonzeros Presolve removed 80 rows and 148 columns Presolve time: 0.08s Presolved: 1001 rows, 8675 columns, 24212 nonzeros Variable types: 0 continuous, 8675 integer (0 binary) Found heuristic solution: objective 200.0000000 Optimize a model with 1001 rows, 8675 columns and 24212 nonzeros Presolved: 1001 rows, 8675 columns, 24212 nonzeros Root barrier log... Ordering time: 0.05s Barrier statistics: AA' NZ : 1.509e+04 Factor NZ : 1.260e+05 (roughly 5 MBytes of memory) Factor Ops : 2.690e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.43677933e+03 -2.40912956e+05 1.27e+05 2.22e-16 1.11e+02 0s 1 7.07683675e+02 -1.44335573e+05 2.37e+04 2.00e-15 2.52e+01 0s 2 4.57991937e+02 -6.71955715e+04 9.36e+03 4.44e-15 9.95e+00 0s 3 2.87609444e+02 -3.28540778e+04 2.99e+03 2.66e-15 3.72e+00 0s 4 2.14730335e+02 -1.31639629e+04 5.00e+02 8.88e-14 1.05e+00 0s 5 2.00471662e+02 -4.99007048e+03 2.80e+01 6.44e-14 3.12e-01 0s 6 1.99339146e+02 -8.97839591e+02 6.54e-02 1.11e-14 6.32e-02 0s 7 1.70768369e+02 -8.87837468e+02 1.66e-02 1.18e-14 6.10e-02 0s 8 1.30298406e+02 -7.42167293e+02 1.13e-02 9.55e-15 5.02e-02 0s 9 1.07794770e+02 -4.21114132e+02 8.52e-03 4.88e-15 3.05e-02 0s 10 9.12978957e+01 -2.79121410e+02 6.84e-03 3.55e-15 2.13e-02 0s 11 7.85129896e+01 -2.26456138e+02 5.66e-03 3.35e-15 1.76e-02 0s 12 4.37436777e+01 -1.06923549e+02 2.48e-03 2.71e-15 8.68e-03 0s 13 3.54171501e+01 -5.11411535e+01 1.83e-03 2.77e-15 4.98e-03 0s 14 3.30689027e+01 -3.88732542e+01 1.64e-03 3.49e-15 4.14e-03 0s 15 2.47578125e+01 -1.13106716e+01 7.32e-04 2.77e-15 2.08e-03 0s 16 2.17721209e+01 4.78247690e+00 3.88e-04 2.27e-15 9.78e-04 0s 17 2.04143117e+01 1.14275441e+01 2.44e-04 2.43e-15 5.17e-04 0s 18 1.93358635e+01 1.48110816e+01 1.18e-04 2.65e-15 2.61e-04 0s 19 1.88402044e+01 1.63193843e+01 6.83e-05 2.74e-15 1.45e-04 0s 20 1.82334648e+01 1.77696268e+01 4.12e-06 1.97e-15 2.67e-05 0s 21 1.81828607e+01 1.81541453e+01 2.62e-08 3.05e-15 1.65e-06 0s 22 1.81818183e+01 1.81818170e+01 3.33e-11 2.22e-15 7.39e-11 0s 23 1.81818182e+01 1.81818182e+01 2.56e-12 1.77e-15 1.29e-16 0s Barrier solved model in 23 iterations and 0.47 seconds Optimal objective 1.81818182e+01 Root relaxation: objective 1.818182e+01, 4977 iterations, 0.59 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 18.18182 0 97 200.00000 18.18182 90.9% - 2s H 0 0 20.0000000 18.18182 9.09% - 2s H 0 0 19.0000000 18.18182 4.31% - 2s Explored 0 nodes (12451 simplex iterations) in 2.48 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.900000000000e+01, best bound 1.900000000000e+01, gap 0.0% Preprocessing time: 0.44 seconds Gurobi run time: 2.48 seconds Total run time: 2.92 seconds Objective: 19 Solution: 2 x [2, 2, 2, 3, 4, 15, 17, 17, 17, 17, 17] 1 x [2, 2, 4, 7, 9, 9, 9, 12, 13, 13, 14] 1 x [2, 4, 7, 9, 9, 9, 9, 9, 12, 13, 14] 1 x [2, 8, 11, 14, 14, 15, 18, 19] 1 x [6, 6, 7, 7, 7, 13, 13, 18, 18, 19, 19] 3 x [2, 5, 6, 7, 7, 11, 13, 13, 15, 19, 19] 1 x [7, 7, 9, 9, 9, 13, 13, 14, 15] 1 x [2, 3, 3, 8, 8, 8, 8, 10, 16, 19, 19] 1 x [1, 3, 8, 9, 11, 13, 13, 16, 16] 2 x [8, 13, 14, 16, 16, 16, 17, 17, 17, 17, 19] 1 x [1, 8, 8, 8, 9, 11, 11, 19, 19] 1 x [2, 3, 3, 3, 8, 10, 13, 17, 19, 19, 19] 1 x [7, 7, 7, 7, 7, 10, 10, 10, 12, 13, 13] 2 x [2, 2, 7, 12, 13, 13, 14, 14, 14, 14, 14]