Build (method = -2) #dp: 10217 Step-3' Graph: 712 vertices and 3674 arcs (0.06s) Step-4' Graph: 705 vertices and 3656 arcs (0.06s) #V4/#V3 = 0.99 #A4/#A3 = 1.00 Ready! (0.06s) Optimize a model with 715 rows, 3657 columns and 9575 nonzeros Presolve removed 148 rows and 393 columns Presolve time: 0.06s Presolved: 567 rows, 3264 columns, 8746 nonzeros Variable types: 0 continuous, 3264 integer (158 binary) Found heuristic solution: objective 74.0000000 Optimize a model with 567 rows, 3264 columns and 8746 nonzeros Presolved: 567 rows, 3264 columns, 8746 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.188e+03 Factor NZ : 2.806e+04 (roughly 2 MBytes of memory) Factor Ops : 2.022e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.00978636e+03 -8.35417281e+04 7.10e+04 3.89e-02 1.33e+02 0s 1 2.44828025e+02 -6.28142226e+04 9.95e+03 6.66e-16 2.53e+01 0s 2 1.75082145e+02 -3.74916899e+04 2.63e+03 7.77e-16 9.29e+00 0s 3 1.92239008e+02 -1.63221379e+04 1.46e+03 4.30e-02 4.03e+00 0s 4 1.62957902e+02 -5.73052563e+03 2.05e+02 7.52e-03 1.11e+00 0s 5 1.57152932e+02 -1.72601580e+03 6.05e+01 3.64e-14 3.28e-01 0s 6 1.53237634e+02 -6.94805982e+02 3.09e+01 1.33e-14 1.42e-01 0s 7 1.48745096e+02 -5.01977016e+02 1.43e+01 9.77e-15 1.04e-01 0s 8 1.41208925e+02 -4.90253159e+02 9.98e+00 8.99e-15 9.97e-02 0s 9 1.26861768e+02 -3.33617302e+02 6.88e+00 6.11e-15 7.23e-02 0s 10 1.14447760e+02 -1.88295768e+02 6.32e+00 3.55e-15 4.78e-02 0s 11 8.66216779e+01 -8.80201127e+01 4.10e+00 1.78e-15 2.76e-02 0s 12 8.30902806e+01 -7.61537791e+01 3.79e+00 1.67e-15 2.51e-02 0s 13 7.27216473e+01 -3.34070856e+01 3.26e+00 9.99e-16 1.68e-02 0s 14 6.12891570e+01 -3.11361156e+01 2.63e+00 1.33e-15 1.46e-02 0s 15 5.59290364e+01 -2.42773107e+01 2.38e+00 1.25e-15 1.27e-02 0s 16 3.56209974e+01 -1.86335096e+01 1.49e+00 1.11e-15 8.55e-03 0s 17 2.50851933e+01 -8.21800312e+00 1.02e+00 9.11e-16 5.25e-03 0s 18 2.12383810e+01 -5.58317851e+00 8.16e-01 8.51e-16 4.22e-03 0s 19 1.82442857e+01 -4.34295834e+00 6.66e-01 1.23e-15 3.55e-03 0s 20 1.55227566e+01 -1.37551801e+00 4.74e-01 1.47e-15 2.65e-03 0s 21 1.33717109e+01 1.50595984e+00 3.40e-01 1.46e-15 1.85e-03 0s 22 1.21023056e+01 3.68491395e+00 2.59e-01 1.41e-15 1.31e-03 0s 23 9.32270435e+00 5.64176020e+00 8.38e-02 1.23e-15 5.70e-04 0s 24 8.79501659e+00 7.03358059e+00 5.38e-02 9.86e-16 2.73e-04 0s 25 8.57047530e+00 7.55590717e+00 3.25e-02 1.19e-15 1.57e-04 0s 26 8.51346137e+00 7.92149597e+00 1.93e-02 1.21e-15 9.17e-05 0s 27 8.38681251e+00 8.05687501e+00 8.87e-03 1.23e-15 5.10e-05 0s 28 8.30193503e+00 8.15533351e+00 2.14e-03 9.84e-16 2.25e-05 0s 29 8.27177069e+00 8.23298053e+00 2.66e-04 9.61e-16 5.95e-06 0s 30 8.26540440e+00 8.25424140e+00 3.50e-05 1.04e-15 1.71e-06 0s 31 8.26412581e+00 8.26344885e+00 2.10e-06 8.74e-16 1.04e-07 0s 32 8.26400003e+00 8.26399987e+00 4.41e-10 8.67e-16 2.42e-11 0s 33 8.26400000e+00 8.26400000e+00 1.74e-13 9.02e-16 3.93e-17 0s Barrier solved model in 33 iterations and 0.14 seconds Optimal objective 8.26400000e+00 Root relaxation: objective 8.264000e+00, 1279 iterations, 0.16 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 8.26400 0 50 74.00000 8.26400 88.8% - 0s H 0 0 9.0000000 8.26400 8.18% - 0s Explored 0 nodes (2534 simplex iterations) in 0.43 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.000000000000e+00, best bound 9.000000000000e+00, gap 0.0% Preprocessing time: 0.08 seconds Gurobi run time: 0.43 seconds Total run time: 0.51 seconds Objective: 9 Solution: 1 x [1, 2, 2, 2, 5, 5, 6, 6, 6, 8, 9, 10] 2 x [1, 1, 1, 1, 3, 5, 6, 9, 9, 9, 9] 1 x [2, 2, 2, 5, 5, 6, 6, 6, 8, 9, 10] 1 x [5, 6, 6, 8, 10, 10] 1 x [3, 3, 5, 5, 7, 7, 7, 8, 8, 8, 10, 10, 10] 1 x [2, 2, 3, 4, 5, 5, 5, 5, 5, 6, 9, 9, 9, 9, 9, 9] 2 x [2, 2, 2, 3, 3, 3, 5, 7, 7, 7]