Build (method = -2) #dp: 3386 Step-3' Graph: 241 vertices and 926 arcs (0.02s) Step-4' Graph: 193 vertices and 830 arcs (0.02s) #V4/#V3 = 0.80 #A4/#A3 = 0.90 Ready! (0.02s) Optimize a model with 203 rows, 831 columns and 2112 nonzeros Presolve removed 33 rows and 65 columns Presolve time: 0.01s Presolved: 170 rows, 766 columns, 2009 nonzeros Variable types: 0 continuous, 766 integer (0 binary) Found heuristic solution: objective 78.0000000 Optimize a model with 170 rows, 766 columns and 2009 nonzeros Presolved: 170 rows, 766 columns, 2009 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.232e+03 Factor NZ : 4.419e+03 Factor Ops : 1.402e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.18672155e+03 -2.23727450e+04 1.85e+04 2.22e-16 1.09e+02 0s 1 3.69404166e+02 -1.10622786e+04 3.01e+03 7.77e-16 2.04e+01 0s 2 2.01579013e+02 -4.25856717e+03 6.60e+02 2.22e-15 5.11e+00 0s 3 1.72952081e+02 -6.69740575e+02 4.01e+01 1.38e-14 6.34e-01 0s 4 1.56413871e+02 -3.26534633e+02 5.07e-02 6.88e-15 3.13e-01 0s 5 1.24744729e+02 -2.35211735e+02 2.91e-02 4.66e-15 2.33e-01 0s 6 8.81163226e+01 -1.49581399e+02 1.43e-02 3.00e-15 1.54e-01 0s 7 6.90690727e+01 -9.45276540e+01 6.50e-03 1.78e-15 1.06e-01 0s 8 3.26767498e+01 -1.96047464e+01 2.76e-03 1.05e-15 3.39e-02 0s 9 2.02533975e+01 -4.11382050e+00 1.44e-03 1.02e-15 1.58e-02 0s 10 1.74437821e+01 4.02503108e+00 8.45e-04 1.11e-15 8.70e-03 0s 11 1.55924005e+01 9.45436316e+00 3.23e-04 1.10e-15 3.98e-03 0s 12 1.40650848e+01 1.15787847e+01 9.47e-05 1.02e-15 1.61e-03 0s 13 1.35903137e+01 1.26141132e+01 3.39e-05 1.08e-15 6.33e-04 0s 14 1.33477869e+01 1.29540871e+01 1.05e-05 1.12e-15 2.55e-04 0s 15 1.32396080e+01 1.30967126e+01 1.98e-06 1.14e-15 9.27e-05 0s 16 1.32067425e+01 1.31624849e+01 2.97e-07 9.94e-16 2.87e-05 0s 17 1.31993482e+01 1.31819504e+01 9.14e-08 9.52e-16 1.13e-05 0s 18 1.31966859e+01 1.31914066e+01 3.13e-08 9.44e-16 3.42e-06 0s 19 1.31950912e+01 1.31939450e+01 1.32e-09 1.05e-15 7.43e-07 0s 20 1.31950003e+01 1.31949988e+01 1.51e-12 1.07e-15 9.52e-10 0s 21 1.31950000e+01 1.31950000e+01 4.02e-14 8.44e-16 9.52e-13 0s Barrier solved model in 21 iterations and 0.01 seconds Optimal objective 1.31950000e+01 Root relaxation: objective 1.319500e+01, 93 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 13.19500 0 31 78.00000 13.19500 83.1% - 0s H 0 0 15.0000000 13.19500 12.0% - 0s H 0 0 14.0000000 13.19500 5.75% - 0s Explored 0 nodes (181 simplex iterations) in 0.05 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.400000000000e+01, best bound 1.400000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.05 seconds Total run time: 0.08 seconds Objective: 14 Solution: 1 x [1, 2, 4, 8, 9, 9] 1 x [2, 2, 4, 4, 8, 9, 9] 2 x [1, 1, 6, 6, 6, 6, 10] 1 x [1, 1, 1, 3, 4, 6] 1 x [1, 1, 1, 3, 4, 6, 6] 1 x [1, 1, 1, 1, 10, 10] 1 x [4, 4, 5, 5, 7, 8] 3 x [4, 4, 5, 5, 5, 6, 9, 9] 3 x [7, 7, 7, 7, 7, 7, 8, 8]