Build (method = -2) #dp: 10822 Step-3' Graph: 431 vertices and 1610 arcs (0.05s) Step-4' Graph: 337 vertices and 1422 arcs (0.06s) #V4/#V3 = 0.78 #A4/#A3 = 0.88 Ready! (0.06s) Optimize a model with 347 rows, 1423 columns and 3608 nonzeros Presolve removed 94 rows and 182 columns Presolve time: 0.02s Presolved: 253 rows, 1241 columns, 3348 nonzeros Variable types: 0 continuous, 1241 integer (0 binary) Found heuristic solution: objective 1000.0000000 Optimize a model with 253 rows, 1241 columns and 3348 nonzeros Presolved: 253 rows, 1241 columns, 3348 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.880e+03 Factor NZ : 6.766e+03 Factor Ops : 2.146e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.70168775e+03 -1.53484691e+05 1.29e+05 2.22e-16 3.66e+02 0s 1 1.82713996e+03 -8.37350763e+04 2.34e+04 5.55e-16 8.25e+01 0s 2 1.22669335e+03 -2.57660470e+04 6.33e+03 5.25e-15 2.15e+01 0s 3 1.03397312e+03 -6.81937416e+03 6.98e+02 2.36e-15 4.01e+00 0s 4 9.69753535e+02 -2.22655138e+03 1.86e+00 2.44e-15 1.28e+00 0s 5 6.20512685e+02 -1.81223314e+03 7.03e-01 2.44e-15 9.77e-01 0s 6 5.30621430e+02 -5.43473846e+02 5.48e-01 1.84e-15 4.31e-01 0s 7 3.67922861e+02 -4.02786507e+02 3.87e-01 2.57e-15 3.09e-01 0s 8 2.92766158e+02 -2.30552032e+02 3.03e-01 2.69e-15 2.10e-01 0s 9 2.11314921e+02 -1.05892019e+02 1.35e-01 2.52e-15 1.27e-01 0s 10 1.53521394e+02 1.22338272e+00 7.22e-02 2.14e-15 6.11e-02 0s 11 1.19624452e+02 3.56187428e+01 3.30e-02 2.49e-15 3.37e-02 0s 12 1.11641185e+02 6.49017478e+01 2.36e-02 2.42e-15 1.88e-02 0s 13 1.06915983e+02 8.56121067e+01 1.68e-02 2.15e-15 8.55e-03 0s 14 1.01761128e+02 9.58891053e+01 3.96e-03 1.98e-15 2.36e-03 0s 15 1.00008757e+02 9.99508879e+01 4.89e-12 1.66e-15 2.32e-05 0s 16 1.00000009e+02 9.99999509e+01 6.51e-12 1.69e-15 2.32e-08 0s 17 1.00000000e+02 1.00000000e+02 3.50e-12 1.65e-15 2.32e-11 0s Barrier solved model in 17 iterations and 0.02 seconds Optimal objective 1.00000000e+02 Root relaxation: objective 1.000000e+02, 675 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 100.00000 0 6 1000.00000 100.00000 90.0% - 0s H 0 0 101.0000000 100.00000 0.99% - 0s H 0 0 100.0000000 100.00000 0.0% - 0s Explored 0 nodes (1277 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.07 seconds Gurobi run time: 0.10 seconds Total run time: 0.17 seconds Objective: 100 Solution: 4 x [1, 1, 1, 1, 2, 3, 4, 6, 6, 10] 2 x [2, 4, 6, 6, 6, 6, 6, 6, 8, 10] 3 x [1, 1, 2, 3, 3, 3, 4, 6, 6, 6] 18 x [1, 1, 3, 3, 3, 4, 4, 6, 6, 6] 4 x [1, 1, 1, 1, 2, 3, 4, 4, 4, 10] 27 x [3, 3, 3, 4, 4, 4, 4, 8, 9, 10] 4 x [2, 5, 5, 5, 5, 5, 5, 5, 5, 8] 36 x [1, 1, 2, 2, 2, 2, 6, 6, 7, 10] 1 x [2, 2, 2, 2, 3, 3, 3, 3, 8, 10] 1 x [2, 2, 2, 2, 6, 6, 6, 8, 10, 10]