Build (method = -2) #dp: 10194 Step-3' Graph: 361 vertices and 1383 arcs (0.05s) Step-4' Graph: 278 vertices and 1217 arcs (0.05s) #V4/#V3 = 0.77 #A4/#A3 = 0.88 Ready! (0.05s) Optimize a model with 288 rows, 1218 columns and 3111 nonzeros Presolve removed 95 rows and 186 columns Presolve time: 0.02s Presolved: 193 rows, 1032 columns, 2819 nonzeros Variable types: 0 continuous, 1032 integer (0 binary) Found heuristic solution: objective 846.0000000 Found heuristic solution: objective 584.0000000 Optimize a model with 193 rows, 1032 columns and 2819 nonzeros Presolved: 193 rows, 1032 columns, 2819 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.609e+03 Factor NZ : 5.564e+03 Factor Ops : 1.935e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.21184733e+03 -1.66361748e+05 1.44e+05 2.22e-16 5.93e+02 0s 1 2.30825474e+03 -8.99070694e+04 2.19e+04 1.33e-15 1.13e+02 0s 2 1.36008354e+03 -2.93379944e+04 5.86e+03 1.78e-15 3.00e+01 0s 3 1.02596438e+03 -5.59881341e+03 5.11e+02 6.22e-15 4.19e+00 0s 4 9.63268065e+02 -1.92669085e+03 2.99e+01 1.44e-15 1.43e+00 0s 5 6.73698156e+02 -1.27834846e+03 1.46e+01 1.15e-15 9.57e-01 0s 6 5.75473978e+02 -6.42886615e+02 1.07e+01 1.18e-15 5.96e-01 0s 7 4.24805550e+02 -3.30760424e+02 7.43e+00 9.68e-16 3.70e-01 0s 8 2.95774855e+02 -1.39784917e+02 5.16e+00 1.04e-15 2.13e-01 0s 9 1.83404074e+02 -5.63060489e+01 2.87e+00 1.00e-15 1.17e-01 0s 10 1.71170797e+02 -2.28723448e+01 2.43e+00 1.27e-15 9.50e-02 0s 11 1.41337659e+02 2.41385335e+00 1.68e+00 1.71e-15 6.79e-02 0s 12 1.29371414e+02 1.98260199e+01 1.37e+00 1.35e-15 5.35e-02 0s 13 1.17366655e+02 4.26981496e+01 1.03e+00 1.23e-15 3.65e-02 0s 14 1.09339774e+02 6.49418867e+01 6.13e-01 1.01e-15 2.17e-02 0s 15 1.11580039e+02 9.19135287e+01 5.18e-01 7.66e-16 9.61e-03 0s 16 1.00216129e+02 9.89387370e+01 1.12e-03 9.66e-16 6.16e-04 0s 17 1.00000650e+02 9.99986071e+01 1.65e-12 7.17e-16 9.85e-07 0s 18 1.00000000e+02 1.00000000e+02 4.34e-12 9.08e-16 1.43e-12 0s Barrier solved model in 18 iterations and 0.02 seconds Optimal objective 1.00000000e+02 Root relaxation: objective 1.000000e+02, 644 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 100.00000 0 34 584.00000 100.00000 82.9% - 0s H 0 0 101.0000000 100.00000 0.99% - 0s H 0 0 100.0000000 100.00000 0.0% - 0s Explored 0 nodes (1169 simplex iterations) in 0.10 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.000000000000e+02, best bound 1.000000000000e+02, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.10 seconds Total run time: 0.17 seconds Objective: 100 Solution: 1 x [1, 2, 2, 2, 3, 4, 5, 8, 8, 10] 13 x [1, 3, 5, 5, 5, 5, 5, 8, 8, 10] 7 x [3, 5, 5, 8, 8, 8, 8, 9, 10, 10] 9 x [3, 3, 4, 5, 5, 6, 8, 8, 8, 10] 2 x [1, 1, 2, 4, 5, 5, 5, 8, 8, 10] 3 x [1, 1, 1, 2, 4, 5, 5, 8, 8, 10] 41 x [1, 2, 5, 8, 8, 9, 9, 9, 9, 10] 13 x [1, 2, 5, 7, 8, 9, 10, 10, 10, 10] 5 x [1, 1, 5, 9, 9, 9, 10, 10, 10, 10] 1 x [1, 1, 5, 5, 5, 8, 10, 10, 10, 10] 5 x [4, 4, 4, 4, 4, 4, 4, 4, 4, 4]