Build (method = -2) #dp: 13368 Step-3' Graph: 755 vertices and 3910 arcs (0.08s) Step-4' Graph: 751 vertices and 3902 arcs (0.08s) #V4/#V3 = 0.99 #A4/#A3 = 1.00 Ready! (0.08s) Optimize a model with 761 rows, 3903 columns and 10248 nonzeros Presolve removed 70 rows and 132 columns Presolve time: 0.06s Presolved: 691 rows, 3771 columns, 10046 nonzeros Variable types: 0 continuous, 3771 integer (0 binary) Found heuristic solution: objective 828.0000000 Found heuristic solution: objective 655.0000000 Optimize a model with 691 rows, 3771 columns and 10046 nonzeros Presolved: 691 rows, 3771 columns, 10046 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 6.126e+03 Factor NZ : 4.502e+04 (roughly 2 MBytes of memory) Factor Ops : 5.163e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.69823370e+03 -7.39032428e+05 4.40e+05 2.22e-16 6.58e+02 0s 1 1.89616028e+03 -5.57461283e+05 6.70e+04 6.88e-15 1.53e+02 0s 2 1.53086637e+03 -3.10615320e+05 2.70e+04 7.55e-15 6.74e+01 0s 3 1.19155265e+03 -1.07631548e+05 7.93e+03 1.73e-14 2.06e+01 0s 4 1.04741071e+03 -4.06212910e+04 1.96e+03 7.11e-15 6.94e+00 0s 5 9.96865728e+02 -1.09914758e+04 2.81e+00 1.95e-14 1.59e+00 0s 6 9.88090940e+02 -2.78312043e+03 1.37e-02 4.22e-15 5.00e-01 0s 7 8.85002072e+02 -2.71673642e+03 3.85e-04 6.59e-15 4.77e-01 0s 8 7.37719056e+02 -2.19480573e+03 3.17e-04 5.94e-15 3.89e-01 0s 9 6.41596992e+02 -8.52728644e+02 2.46e-04 4.40e-15 1.98e-01 0s 10 4.12808393e+02 -5.38242668e+02 1.30e-04 4.36e-15 1.26e-01 0s 11 3.69059906e+02 -4.33723746e+02 1.13e-04 5.93e-15 1.06e-01 0s 12 2.31148459e+02 -2.00220821e+02 5.55e-05 5.59e-15 5.71e-02 0s 13 1.31744179e+02 -5.61642017e+01 1.39e-05 3.47e-15 2.49e-02 0s 14 1.07698422e+02 3.77488386e+01 5.97e-06 3.52e-15 9.26e-03 0s 15 1.05501160e+02 6.06709613e+01 4.78e-06 3.32e-15 5.94e-03 0s 16 1.05423872e+02 7.13865362e+01 3.80e-06 3.58e-15 4.51e-03 0s 17 1.01948531e+02 7.95681995e+01 1.85e-06 4.94e-15 2.96e-03 0s 18 1.00231914e+02 8.91491389e+01 5.05e-07 4.31e-15 1.47e-03 0s 19 9.97422017e+01 9.53874435e+01 2.27e-07 3.93e-15 5.77e-04 0s 20 9.95171180e+01 9.66285850e+01 1.34e-07 4.17e-15 3.82e-04 0s 21 9.94520786e+01 9.72944183e+01 1.11e-07 4.93e-15 2.86e-04 0s 22 9.93121182e+01 9.82059201e+01 6.55e-08 3.44e-15 1.46e-04 0s 23 9.91400105e+01 9.85930485e+01 1.79e-08 3.60e-15 7.24e-05 0s 24 9.91245071e+01 9.87152908e+01 1.40e-08 3.90e-15 5.42e-05 0s 25 9.91016526e+01 9.87845459e+01 8.88e-09 5.85e-15 4.20e-05 0s 26 9.90643474e+01 9.90398587e+01 2.64e-10 2.50e-15 3.24e-06 0s 27 9.90600060e+01 9.90599775e+01 2.46e-12 2.48e-15 3.77e-09 0s 28 9.90600000e+01 9.90600000e+01 2.46e-12 2.94e-15 3.81e-15 0s Barrier solved model in 28 iterations and 0.18 seconds Optimal objective 9.90600000e+01 Root relaxation: objective 9.906000e+01, 1544 iterations, 0.21 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 99.06000 0 53 655.00000 99.06000 84.9% - 0s H 0 0 100.0000000 99.06000 0.94% - 0s Explored 0 nodes (4833 simplex iterations) in 0.67 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.10 seconds Gurobi run time: 0.67 seconds Total run time: 0.78 seconds Objective: 100 Solution: 7 x [2, 2, 2, 3, 6, 7, 7, 9, 9, 9, 9, 9, 10, 10, 10] 13 x [2, 5, 6, 8, 8, 8, 8, 8, 10] 10 x [1, 4, 4, 6, 6, 6, 7, 9, 9, 9] 1 x [2, 2, 2, 3, 7, 7, 9, 9, 9, 9, 9, 10, 10, 10] 3 x [1, 1, 2, 3, 3, 7, 8, 8, 10, 10, 10] 26 x [3, 3, 5, 5, 7, 7, 10, 10] 1 x [3, 3, 3, 3, 7] 1 x [3, 3, 3, 3, 7, 9, 9, 9] 35 x [1, 2, 2, 4, 5, 5, 5, 7, 8, 10, 10] 1 x [4, 4, 4, 4, 5, 7, 7, 7, 9, 10] 1 x [4, 4, 4, 4, 5, 7, 7, 7, 9, 10, 10] 1 x [5, 8, 8, 8]