Build (method = -2) #dp: 1522 Step-3' Graph: 238 vertices and 974 arcs (0.01s) Step-4' Graph: 191 vertices and 880 arcs (0.01s) #V4/#V3 = 0.80 #A4/#A3 = 0.90 Ready! (0.01s) Optimize a model with 201 rows, 881 columns and 2266 nonzeros Presolve removed 47 rows and 86 columns Presolve time: 0.01s Presolved: 154 rows, 795 columns, 2172 nonzeros Variable types: 0 continuous, 795 integer (115 binary) Found heuristic solution: objective 90.0000000 Found heuristic solution: objective 60.0000000 Optimize a model with 154 rows, 795 columns and 2172 nonzeros Presolve removed 1 rows and 1 columns Presolved: 153 rows, 794 columns, 2176 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.225e+03 Factor NZ : 4.012e+03 Factor Ops : 1.380e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.17615817e+03 -1.69792792e+04 1.27e+04 1.16e-01 8.91e+01 0s 1 3.52348345e+02 -8.09579738e+03 2.00e+03 2.00e-15 1.57e+01 0s 2 1.64664428e+02 -2.02642099e+03 2.75e+02 4.44e-15 2.46e+00 0s 3 1.02589796e+02 -4.22882833e+02 2.92e+01 1.11e-15 4.13e-01 0s 4 9.22149108e+01 -1.65118233e+02 1.24e+01 1.19e-15 1.84e-01 0s 5 6.66764332e+01 -1.02904525e+02 7.28e+00 1.17e-15 1.18e-01 0s 6 5.44112098e+01 -8.59167962e+01 6.11e+00 1.40e-15 9.77e-02 0s 7 4.07208423e+01 -6.56331568e+01 3.64e+00 1.66e-15 7.19e-02 0s 8 3.07941397e+01 -2.74078618e+01 2.29e+00 1.37e-15 3.92e-02 0s 9 2.56135906e+01 -1.11658883e+01 1.60e+00 1.23e-15 2.46e-02 0s 10 2.09212504e+01 1.28706630e+00 9.55e-01 1.18e-15 1.31e-02 0s 11 1.80415177e+01 9.46559073e+00 4.14e-01 9.62e-16 5.62e-03 0s 12 1.73528657e+01 1.30391446e+01 2.78e-01 1.07e-15 2.82e-03 0s 13 1.65183567e+01 1.43354162e+01 1.30e-01 1.12e-15 1.41e-03 0s 14 1.61668173e+01 1.52461463e+01 6.33e-02 1.04e-15 5.96e-04 0s 15 1.60114657e+01 1.55032683e+01 3.64e-02 1.17e-15 3.29e-04 0s 16 1.58671746e+01 1.56510701e+01 1.06e-02 8.73e-16 1.38e-04 0s 17 1.58331473e+01 1.57089485e+01 6.57e-03 1.15e-15 7.96e-05 0s 18 1.58024675e+01 1.57269534e+01 3.32e-03 1.39e-15 4.82e-05 0s 19 1.57819179e+01 1.57495772e+01 1.48e-03 1.11e-15 2.07e-05 0s 20 1.57714941e+01 1.57593426e+01 5.59e-04 1.12e-15 7.77e-06 0s 21 1.57694714e+01 1.57607273e+01 4.05e-04 1.43e-15 5.59e-06 0s 22 1.57682738e+01 1.57623377e+01 3.17e-04 1.18e-15 3.81e-06 0s 23 1.57661676e+01 1.57633397e+01 1.21e-04 1.08e-15 1.80e-06 0s 24 1.57651896e+01 1.57639538e+01 4.74e-05 9.13e-16 7.87e-07 0s 25 1.57645522e+01 1.57643909e+01 3.17e-06 1.29e-15 1.02e-07 0s 26 1.57644739e+01 1.57644734e+01 2.02e-12 8.60e-16 2.96e-10 0s 27 1.57644737e+01 1.57644737e+01 1.16e-11 1.50e-15 3.80e-16 0s Barrier solved model in 27 iterations and 0.03 seconds Optimal objective 1.57644737e+01 Root relaxation: objective 1.576447e+01, 83 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 15.76447 0 33 60.00000 15.76447 73.7% - 0s H 0 0 25.0000000 15.76447 36.9% - 0s H 0 0 17.0000000 15.76447 7.27% - 0s 0 0 15.76447 0 45 17.00000 15.76447 7.27% - 0s 0 0 15.76744 0 47 17.00000 15.76744 7.25% - 0s H 0 0 16.0000000 15.76744 1.45% - 0s Cutting planes: Gomory: 1 MIR: 1 Explored 0 nodes (213 simplex iterations) in 0.15 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.600000000000e+01, best bound 1.600000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.15 seconds Total run time: 0.16 seconds Objective: 16 Solution: 1 x [1, 2, 3, 5, 9, 9] 1 x [1, 2, 9, 9, 9, 9, 9] 1 x [2, 7, 8, 8, 9, 9] 5 x [2, 3, 5, 8, 8, 8] 1 x [2, 5, 5, 5, 6, 6] 3 x [2, 2, 2, 2, 2] 2 x [5, 5, 5, 7, 8, 8, 9] 1 x [5, 5, 5, 6, 9, 9, 9, 10, 10] 1 x [4, 5, 5, 5, 5, 5, 5]