Build (method = -2) #dp: 16438 Step-3' Graph: 573 vertices and 2220 arcs (0.09s) Step-4' Graph: 504 vertices and 2082 arcs (0.09s) #V4/#V3 = 0.88 #A4/#A3 = 0.94 Ready! (0.09s) Optimize a model with 514 rows, 2083 columns and 5256 nonzeros Presolve removed 225 rows and 428 columns Presolve time: 0.03s Presolved: 289 rows, 1655 columns, 4652 nonzeros Variable types: 0 continuous, 1655 integer (0 binary) Found heuristic solution: objective 1000.0000000 Optimize a model with 289 rows, 1655 columns and 4652 nonzeros Presolved: 289 rows, 1655 columns, 4652 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.508e+03 Factor NZ : 1.085e+04 Factor Ops : 5.623e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.36658676e+03 -2.58055779e+05 1.93e+05 2.22e-16 4.99e+02 0s 1 2.55585471e+03 -1.35145075e+05 4.06e+04 6.66e-16 1.19e+02 0s 2 1.41406764e+03 -4.93070504e+04 1.12e+04 2.22e-15 3.33e+01 0s 3 1.06768838e+03 -1.81493141e+04 1.85e+03 3.33e-15 8.25e+00 0s 4 9.97279796e+02 -3.41301857e+03 2.92e+02 4.44e-15 1.59e+00 0s 5 8.66923175e+02 -2.08816661e+03 2.03e+01 2.89e-15 9.05e-01 0s 6 6.78265321e+02 -1.26712436e+03 1.32e+01 1.78e-15 5.94e-01 0s 7 4.67084908e+02 -6.20354290e+02 8.39e+00 1.11e-15 3.32e-01 0s 8 2.99761511e+02 -2.38727324e+02 4.91e+00 5.10e-16 1.64e-01 0s 9 1.59754902e+02 -4.04537043e+01 1.99e+00 4.86e-16 6.11e-02 0s 10 1.16880769e+02 2.13778875e+01 9.29e-01 5.04e-16 2.91e-02 0s 11 1.01833374e+02 4.68634608e+01 6.18e-01 4.87e-16 1.68e-02 0s 12 9.66580929e+01 5.80905110e+01 4.31e-01 5.87e-16 1.17e-02 0s 13 8.92038263e+01 7.33713613e+01 1.95e-01 5.84e-16 4.81e-03 0s 14 8.36628565e+01 8.15103088e+01 3.95e-03 5.24e-16 6.49e-04 0s 15 8.33478746e+01 8.32782435e+01 2.24e-12 4.38e-16 2.10e-05 0s 16 8.33333479e+01 8.33329661e+01 5.66e-13 4.44e-16 1.15e-07 0s 17 8.33333333e+01 8.33333333e+01 8.49e-13 4.06e-16 1.17e-13 0s Barrier solved model in 17 iterations and 0.03 seconds Optimal objective 8.33333333e+01 Root relaxation: objective 8.333333e+01, 914 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 83.33333 0 33 1000.00000 83.33333 91.7% - 0s H 0 0 84.0000000 83.33333 0.79% - 0s Explored 0 nodes (1636 simplex iterations) in 0.14 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.400000000000e+01, best bound 8.400000000000e+01, gap 0.0% Preprocessing time: 0.11 seconds Gurobi run time: 0.14 seconds Total run time: 0.25 seconds Objective: 84 Solution: 23 x [1, 3, 5, 6, 6, 7, 8, 9, 9, 10, 10, 10] 2 x [2, 3, 5, 6, 6, 6, 6, 6, 7, 9, 9, 9] 1 x [3, 5, 6, 6, 7, 8, 9, 9, 9, 10, 10] 2 x [3, 5, 6, 6, 7, 8, 9, 9, 9, 10, 10, 10] 39 x [2, 3, 4, 4, 6, 6, 7, 7, 8, 9, 9, 9] 7 x [2, 3, 6, 6, 6, 6, 6, 6, 9, 9, 10, 10] 1 x [3, 4, 4, 6, 8, 8, 9, 9, 9, 9, 9] 8 x [2, 3, 3, 5, 6, 6, 7, 8, 9, 9, 10, 10] 1 x [4, 5, 8, 8, 9, 9]