Build (method = -2) #dp: 9945 Step-3' Graph: 544 vertices and 2263 arcs (0.06s) Step-4' Graph: 460 vertices and 2095 arcs (0.06s) #V4/#V3 = 0.85 #A4/#A3 = 0.93 Ready! (0.06s) Optimize a model with 470 rows, 2096 columns and 5381 nonzeros Presolve removed 104 rows and 190 columns Presolve time: 0.03s Presolved: 366 rows, 1906 columns, 5124 nonzeros Variable types: 0 continuous, 1906 integer (0 binary) Found heuristic solution: objective 1000.0000000 Optimize a model with 366 rows, 1906 columns and 5124 nonzeros Presolved: 366 rows, 1906 columns, 5124 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.834e+03 Factor NZ : 1.094e+04 (roughly 1 MByte of memory) Factor Ops : 4.101e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.72221531e+03 -3.35913908e+05 3.18e+05 1.11e-16 5.88e+02 0s 1 3.15617242e+03 -1.73167689e+05 6.30e+04 4.44e-16 1.30e+02 0s 2 1.88378728e+03 -7.02681102e+04 1.91e+04 6.11e-16 4.01e+01 0s 3 1.15839146e+03 -2.11475112e+04 3.55e+03 1.73e-14 9.19e+00 0s 4 9.99047064e+02 -4.26918387e+03 9.11e+01 1.11e-15 1.44e+00 0s 5 9.80272120e+02 -1.68141417e+03 6.61e-02 9.99e-16 6.96e-01 0s 6 7.52674313e+02 -1.75002868e+03 4.71e-02 1.11e-15 6.55e-01 0s 7 6.77322912e+02 -1.10041963e+03 1.62e-02 6.83e-16 4.65e-01 0s 8 4.11363599e+02 -6.80345530e+02 9.09e-03 5.55e-16 2.86e-01 0s 9 2.90886754e+02 -3.40436987e+02 6.10e-03 5.97e-16 1.65e-01 0s 10 1.67307202e+02 -2.00389436e+02 3.00e-03 6.15e-16 9.62e-02 0s 11 1.32215546e+02 -1.00483546e+02 1.67e-03 6.28e-16 6.09e-02 0s 12 1.30570787e+02 -4.60952545e+01 1.50e-03 6.59e-16 4.62e-02 0s 13 1.33940592e+02 1.43300378e+00 1.08e-03 7.05e-16 3.47e-02 0s 14 1.11559212e+02 6.43580349e+01 3.05e-04 4.21e-16 1.23e-02 0s 15 1.02710756e+02 8.86684525e+01 6.92e-05 4.75e-16 3.67e-03 0s 16 1.00271894e+02 9.63412294e+01 1.12e-05 5.26e-16 1.03e-03 0s 17 1.00022255e+02 9.98861886e+01 1.84e-07 4.25e-16 3.56e-05 0s 18 1.00000023e+02 9.99998864e+01 2.62e-11 4.18e-16 3.56e-08 0s 19 1.00000000e+02 9.99999999e+01 3.68e-11 4.51e-16 3.56e-11 0s Barrier solved model in 19 iterations and 0.03 seconds Optimal objective 1.00000000e+02 Root relaxation: objective 1.000000e+02, 1027 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 100.00000 0 39 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 (2283 simplex iterations) in 0.21 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.21 seconds Total run time: 0.28 seconds Objective: 100 Solution: 10 x [2, 4, 4, 5, 5, 6, 7, 7, 7, 8] 13 x [2, 4, 4, 5, 6, 6, 6, 8, 8, 10] 1 x [4, 4, 4, 4, 4, 4, 7, 8, 8, 8] 3 x [1, 2, 3, 4, 5, 7, 7, 7, 10, 10] 1 x [1, 1, 3, 4, 5, 7, 7, 7, 10, 10] 1 x [1, 1, 4, 5, 7, 7, 7, 10, 10, 10] 1 x [4, 4, 4, 5, 7, 7, 7, 7, 10, 10] 54 x [1, 3, 5, 5, 6, 7, 9, 9, 10, 10] 14 x [3, 4, 4, 4, 5, 5, 7, 7, 10, 10] 2 x [2, 4, 4, 5, 5, 6, 7, 7, 7, 7]