Build (method = -2) #dp: 9621 Step-3' Graph: 385 vertices and 1504 arcs (0.05s) Step-4' Graph: 316 vertices and 1366 arcs (0.05s) #V4/#V3 = 0.82 #A4/#A3 = 0.91 Ready! (0.05s) Optimize a model with 326 rows, 1367 columns and 3477 nonzeros Presolve removed 117 rows and 228 columns Presolve time: 0.02s Presolved: 209 rows, 1139 columns, 3128 nonzeros Variable types: 0 continuous, 1139 integer (0 binary) Found heuristic solution: objective 86.0000000 Optimize a model with 209 rows, 1139 columns and 3128 nonzeros Presolved: 209 rows, 1139 columns, 3128 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.736e+03 Factor NZ : 6.248e+03 Factor Ops : 2.334e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.05189607e+03 -3.29799529e+04 1.85e+04 2.22e-16 8.69e+01 0s 1 3.26026460e+02 -1.56852189e+04 3.28e+03 8.88e-16 1.82e+01 0s 2 1.59818576e+02 -5.85082040e+03 7.68e+02 4.44e-15 4.79e+00 0s 3 1.21502653e+02 -1.79859059e+03 1.49e+02 4.00e-15 1.18e+00 0s 4 9.43148170e+01 -3.73103583e+02 1.72e+01 4.22e-15 2.27e-01 0s 5 9.10147906e+01 -1.97242006e+02 1.24e+01 2.78e-15 1.37e-01 0s 6 8.84823386e+01 -1.67989968e+02 8.63e+00 2.22e-15 1.19e-01 0s 7 8.41800822e+01 -1.26721388e+02 5.04e+00 1.89e-15 9.56e-02 0s 8 6.28381522e+01 -1.26093782e+02 3.13e+00 1.67e-15 8.51e-02 0s 9 4.04493384e+01 -2.33186067e+01 1.21e+00 1.67e-15 2.86e-02 0s 10 2.84851102e+01 -2.01991325e+01 8.39e-01 1.33e-15 2.18e-02 0s 11 2.59405877e+01 -1.79871103e+01 7.50e-01 1.11e-15 1.97e-02 0s 12 2.44337500e+01 -1.26523035e+01 6.97e-01 9.99e-16 1.66e-02 0s 13 1.64070411e+01 -3.72323743e+00 4.23e-01 4.44e-16 9.03e-03 0s 14 1.31092962e+01 -9.14145193e-01 2.84e-01 2.22e-16 6.28e-03 0s 15 1.31695132e+01 3.71194541e+00 2.72e-01 2.22e-16 4.25e-03 0s 16 1.14437784e+01 8.13274802e+00 1.09e-01 2.40e-16 1.47e-03 0s 17 1.05099405e+01 9.47809050e+00 3.97e-02 2.22e-16 4.58e-04 0s 18 1.00593998e+01 9.89421988e+00 5.13e-03 2.51e-16 7.31e-05 0s 19 1.00001806e+01 9.99949118e+00 9.49e-06 2.07e-16 3.03e-07 0s 20 1.00000000e+01 1.00000000e+01 1.11e-11 1.88e-16 3.68e-13 0s Barrier solved model in 20 iterations and 0.02 seconds Optimal objective 1.00000000e+01 Root relaxation: objective 1.000000e+01, 622 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 10.00000 0 21 86.00000 10.00000 88.4% - 0s H 0 0 11.0000000 10.00000 9.09% - 0s 0 0 10.00000 0 5 11.00000 10.00000 9.09% - 0s 0 0 10.00000 0 40 11.00000 10.00000 9.09% - 0s 0 0 10.00000 0 50 11.00000 10.00000 9.09% - 0s 0 0 10.00000 0 33 11.00000 10.00000 9.09% - 0s H 0 0 10.0000000 10.00000 0.0% - 0s Cutting planes: Gomory: 2 Explored 0 nodes (3208 simplex iterations) in 0.31 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.000000000000e+01, best bound 1.000000000000e+01, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.31 seconds Total run time: 0.37 seconds Objective: 10 Solution: 2 x [2, 2, 2, 4, 5, 7, 9, 10, 10, 10] 2 x [1, 2, 2, 2, 4, 4, 5, 5, 9, 10] 1 x [1, 2, 3, 3, 3, 4, 4, 5, 5, 9] 1 x [1, 5, 5, 5, 6, 6, 6, 8, 9, 10] 1 x [3, 3, 3, 3, 3, 3, 3, 5, 7, 9] 1 x [1, 1, 3, 4, 5, 5, 6, 7, 10, 10] 1 x [1, 2, 3, 4, 5, 8, 8, 8, 8, 8] 1 x [1, 1, 2, 3, 4, 4, 5, 7, 10, 10]