Build (method = -2) #dp: 3324 Step-3' Graph: 417 vertices and 1892 arcs (0.02s) Step-4' Graph: 396 vertices and 1850 arcs (0.02s) #V4/#V3 = 0.95 #A4/#A3 = 0.98 Ready! (0.02s) Optimize a model with 406 rows, 1851 columns and 4770 nonzeros Presolve removed 69 rows and 127 columns Presolve time: 0.02s Presolved: 337 rows, 1724 columns, 4626 nonzeros Variable types: 0 continuous, 1724 integer (0 binary) Found heuristic solution: objective 68.0000000 Optimize a model with 337 rows, 1724 columns and 4626 nonzeros Presolved: 337 rows, 1724 columns, 4626 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.803e+03 Factor NZ : 1.428e+04 Factor Ops : 1.035e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.08398208e+03 -3.70848701e+04 3.65e+04 2.22e-16 1.23e+02 0s 1 2.49122621e+02 -2.39020968e+04 4.43e+03 1.11e-15 1.95e+01 0s 2 1.38031332e+02 -8.28179191e+03 1.00e+03 7.37e-14 4.74e+00 0s 3 1.01547478e+02 -2.26207756e+03 1.52e+02 2.40e-14 9.75e-01 0s 4 9.32369220e+01 -3.41948064e+02 1.06e+00 1.49e-14 1.27e-01 0s 5 8.87580467e+01 -1.78618319e+02 3.69e-13 9.10e-15 7.73e-02 0s 6 8.23656772e+01 -1.08365277e+02 3.04e-13 6.22e-15 5.52e-02 0s 7 7.42922235e+01 -9.91870532e+01 2.92e-13 5.66e-15 5.02e-02 0s 8 6.01396125e+01 -7.94424810e+01 2.23e-13 4.11e-15 4.04e-02 0s 9 3.68450643e+01 -4.85117198e+01 1.20e-13 2.33e-15 2.47e-02 0s 10 2.61068521e+01 -2.61153478e+01 7.41e-14 1.22e-15 1.51e-02 0s 11 2.46607787e+01 -1.60687645e+01 1.08e-13 7.77e-16 1.18e-02 0s 12 2.06931452e+01 -8.60007120e+00 7.13e-14 9.99e-16 8.47e-03 0s 13 1.92008428e+01 -2.81360309e+00 5.79e-14 4.44e-16 6.37e-03 0s 14 1.52468971e+01 5.01862882e+00 7.70e-13 4.11e-16 2.96e-03 0s 15 1.48664232e+01 8.85929490e+00 4.51e-13 3.33e-16 1.74e-03 0s 16 1.36697888e+01 1.17352729e+01 1.54e-12 2.38e-16 5.59e-04 0s 17 1.34824339e+01 1.23082869e+01 5.83e-13 3.01e-16 3.40e-04 0s 18 1.34419395e+01 1.27051231e+01 3.87e-13 2.88e-16 2.13e-04 0s 19 1.33952840e+01 1.30389306e+01 1.66e-13 2.65e-16 1.03e-04 0s 20 1.33629972e+01 1.32046625e+01 5.97e-14 2.63e-16 4.58e-05 0s 21 1.33381515e+01 1.32558502e+01 8.23e-13 2.79e-16 2.38e-05 0s 22 1.33295653e+01 1.33062824e+01 1.13e-13 2.41e-16 6.73e-06 0s 23 1.33263913e+01 1.33181148e+01 9.05e-14 2.61e-16 2.39e-06 0s 24 1.33256768e+01 1.33229580e+01 8.32e-14 3.33e-16 7.86e-07 0s 25 1.33250187e+01 1.33249120e+01 1.47e-13 2.26e-16 3.08e-08 0s 26 1.33250000e+01 1.33250000e+01 2.42e-13 3.62e-16 1.67e-12 0s Barrier solved model in 26 iterations and 0.06 seconds Optimal objective 1.33250000e+01 Root relaxation: objective 1.332500e+01, 425 iterations, 0.06 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 13.32500 0 47 68.00000 13.32500 80.4% - 0s H 0 0 15.0000000 13.32500 11.2% - 0s H 0 0 14.0000000 13.32500 4.82% - 0s Explored 0 nodes (789 simplex iterations) in 0.19 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.03 seconds Gurobi run time: 0.19 seconds Total run time: 0.22 seconds Objective: 14 Solution: 1 x [3, 6, 7, 10, 10] 3 x [3, 6, 7, 10, 10, 10] 1 x [1, 1, 4, 7, 9, 9, 9, 9, 9] 2 x [1, 3, 4, 7, 7, 8, 9, 9, 9] 1 x [1, 1, 1, 1, 7, 7] 1 x [2, 2, 2, 2, 3, 6, 9, 9] 1 x [1, 4, 6, 6, 6, 8, 9, 9, 9] 1 x [1, 1, 2, 3, 4, 8, 8] 2 x [3, 3, 3, 3, 3, 5] 1 x [1, 2, 4, 5, 8, 8, 9, 9]