Build (method = -2) #dp: 14053 Step-3' Graph: 520 vertices and 2126 arcs (0.07s) Step-4' Graph: 441 vertices and 1968 arcs (0.08s) #V4/#V3 = 0.85 #A4/#A3 = 0.93 Ready! (0.08s) Optimize a model with 451 rows, 1969 columns and 5039 nonzeros Presolve removed 136 rows and 260 columns Presolve time: 0.02s Presolved: 315 rows, 1709 columns, 4685 nonzeros Variable types: 0 continuous, 1709 integer (0 binary) Found heuristic solution: objective 583.0000000 Found heuristic solution: objective 560.0000000 Optimize a model with 315 rows, 1709 columns and 4685 nonzeros Presolved: 315 rows, 1709 columns, 4685 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.678e+03 Factor NZ : 1.044e+04 Factor Ops : 4.313e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.13665956e+03 -2.63231471e+05 2.69e+05 2.22e-16 5.95e+02 0s 1 2.58846771e+03 -1.60765929e+05 4.43e+04 6.66e-16 1.24e+02 0s 2 1.50896225e+03 -5.94265016e+04 1.19e+04 5.50e-15 3.53e+01 0s 3 1.04490007e+03 -1.72063163e+04 9.80e+02 6.66e-15 6.56e+00 0s 4 9.96680181e+02 -4.54555038e+03 9.50e+01 6.88e-15 1.68e+00 0s 5 7.57843962e+02 -3.36383286e+03 8.02e-03 4.66e-15 1.20e+00 0s 6 4.50147238e+02 -1.12788855e+03 3.69e-03 2.50e-15 4.60e-01 0s 7 2.22175727e+02 -4.70765949e+02 1.52e-03 2.28e-15 2.02e-01 0s 8 1.63169647e+02 -2.32702501e+02 1.01e-03 2.53e-15 1.15e-01 0s 9 1.26002304e+02 -4.31748679e+01 4.49e-04 1.96e-15 4.94e-02 0s 10 1.05316207e+02 2.32657030e+01 2.40e-04 2.03e-15 2.39e-02 0s 11 1.00774736e+02 5.92716896e+01 1.68e-04 2.20e-15 1.21e-02 0s 12 9.52259431e+01 8.07730578e+01 8.09e-05 2.15e-15 4.22e-03 0s 13 9.10825181e+01 8.97173778e+01 1.35e-06 1.85e-15 3.98e-04 0s 14 9.09093196e+01 9.09078978e+01 3.65e-12 1.73e-15 4.15e-07 0s 15 9.09090909e+01 9.09090909e+01 5.23e-12 1.71e-15 4.53e-13 0s Barrier solved model in 15 iterations and 0.03 seconds Optimal objective 9.09090909e+01 Root relaxation: objective 9.090909e+01, 1055 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 40 560.00000 90.90909 83.8% - 0s H 0 0 92.0000000 90.90909 1.19% - 0s H 0 0 91.0000000 90.90909 0.10% - 0s Explored 0 nodes (2269 simplex iterations) in 0.21 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.09 seconds Gurobi run time: 0.21 seconds Total run time: 0.30 seconds Objective: 91 Solution: 16 x [1, 1, 3, 5, 8, 9, 9, 9, 9, 9, 10] 1 x [2, 3, 5, 5, 7, 8, 8, 8, 10, 10] 8 x [1, 1, 2, 3, 5, 5, 8, 8, 8, 10, 10] 7 x [2, 2, 2, 3, 3, 5, 6, 8, 8, 8, 10] 11 x [1, 1, 4, 4, 5, 8, 9, 9, 9, 9, 10] 9 x [1, 4, 4, 4, 4, 5, 8, 9, 9, 9, 10] 10 x [2, 5, 5, 5, 5, 5, 5, 7, 8, 10, 10] 2 x [2, 5, 5, 6, 7, 8, 8, 8, 8, 10, 10] 7 x [1, 1, 4, 5, 8, 9, 9, 9, 9, 10, 10] 20 x [2, 5, 5, 8, 8, 8, 8, 9, 10, 10, 10]