Build (method = -2) #dp: 12362 Step-3' Graph: 550 vertices and 2155 arcs (0.07s) Step-4' Graph: 459 vertices and 1973 arcs (0.07s) #V4/#V3 = 0.83 #A4/#A3 = 0.92 Ready! (0.07s) Optimize a model with 469 rows, 1974 columns and 5018 nonzeros Presolve removed 174 rows and 338 columns Presolve time: 0.02s Presolved: 295 rows, 1636 columns, 4485 nonzeros Variable types: 0 continuous, 1636 integer (0 binary) Found heuristic solution: objective 779.0000000 Optimize a model with 295 rows, 1636 columns and 4485 nonzeros Presolved: 295 rows, 1636 columns, 4485 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.505e+03 Factor NZ : 1.137e+04 Factor Ops : 6.278e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.38624451e+03 -2.08852432e+05 1.63e+05 1.11e-16 4.56e+02 0s 1 1.98463850e+03 -1.17618872e+05 2.74e+04 9.99e-16 9.55e+01 0s 2 1.32815547e+03 -4.24366964e+04 7.53e+03 1.11e-15 2.70e+01 0s 3 1.03536640e+03 -1.13238370e+04 8.47e+02 7.11e-15 5.00e+00 0s 4 9.85016535e+02 -1.97678560e+03 6.78e+01 1.05e-15 9.51e-01 0s 5 7.84461753e+02 -1.91817741e+03 4.46e+01 1.14e-15 8.58e-01 0s 6 8.24010365e+02 -1.55167178e+03 4.35e+01 1.24e-15 7.54e-01 0s 7 5.93464228e+02 -8.74910470e+02 2.18e+01 9.44e-16 4.60e-01 0s 8 4.72446733e+02 -4.50098632e+02 1.66e+01 5.84e-16 2.90e-01 0s 9 2.51044021e+02 -2.24846380e+02 7.79e+00 6.07e-16 1.49e-01 0s 10 1.75980744e+02 -6.18183198e+01 4.83e+00 7.29e-16 7.44e-02 0s 11 1.55611576e+02 -2.35506834e+01 3.68e+00 7.46e-16 5.59e-02 0s 12 1.25258341e+02 1.17769167e+01 2.06e+00 6.95e-16 3.53e-02 0s 13 1.06622711e+02 3.66123750e+01 1.27e+00 7.07e-16 2.17e-02 0s 14 1.02838442e+02 6.06076388e+01 8.47e-01 5.97e-16 1.31e-02 0s 15 9.55488456e+01 8.23681923e+01 3.05e-01 4.83e-16 4.07e-03 0s 16 9.24069705e+01 8.75317765e+01 8.85e-02 5.55e-16 1.50e-03 0s 17 9.10920734e+01 9.03137725e+01 7.93e-03 4.76e-16 2.38e-04 0s 18 9.09101463e+01 9.09044444e+01 5.61e-07 4.92e-16 1.74e-06 0s 19 9.09090909e+01 9.09090909e+01 8.80e-12 5.55e-16 5.05e-12 0s Barrier solved model in 19 iterations and 0.03 seconds Optimal objective 9.09090909e+01 Root relaxation: objective 9.090909e+01, 940 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 90.90909 0 34 779.00000 90.90909 88.3% - 0s H 0 0 92.0000000 90.90909 1.19% - 0s H 0 0 91.0000000 90.90909 0.10% - 0s Explored 0 nodes (2030 simplex iterations) in 0.19 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.100000000000e+01, best bound 9.100000000000e+01, gap 0.0% Preprocessing time: 0.08 seconds Gurobi run time: 0.19 seconds Total run time: 0.27 seconds Objective: 91 Solution: 1 x [1, 1, 1, 5, 7, 8, 8, 8, 8, 8, 9] 30 x [1, 3, 3, 3, 4, 4, 7, 8, 9, 9, 10] 5 x [1, 1, 2, 2, 2, 6, 6, 6, 7, 9, 9] 16 x [2, 2, 2, 6, 6, 6, 7, 7, 9, 9, 9] 8 x [2, 2, 2, 6, 6, 6, 7, 9, 9, 9, 9] 1 x [1, 1, 4, 5, 7, 8, 8, 8, 8, 8] 1 x [1, 1, 1, 2, 3, 4, 4, 4, 6, 8, 8] 3 x [1, 1, 1, 1, 1, 1, 3, 3, 3, 8, 10] 8 x [1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 3] 17 x [1, 1, 1, 1, 1, 1, 2, 3, 3, 3, 3] 1 x [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]