Build (method = -2) #dp: 5549 Step-3' Graph: 533 vertices and 2857 arcs (0.03s) Step-4' Graph: 501 vertices and 2788 arcs (0.03s) #V4/#V3 = 0.94 #A4/#A3 = 0.98 Ready! (0.03s) Optimize a model with 511 rows, 2789 columns and 7387 nonzeros Presolve removed 15 rows and 35 columns Presolve time: 0.02s Presolved: 496 rows, 2754 columns, 7335 nonzeros Variable types: 0 continuous, 2754 integer (0 binary) Found heuristic solution: objective 71.0000000 Found heuristic solution: objective 69.0000000 Optimize a model with 496 rows, 2754 columns and 7335 nonzeros Presolved: 496 rows, 2754 columns, 7335 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.447e+03 Factor NZ : 2.453e+04 (roughly 2 MBytes of memory) Factor Ops : 2.200e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.01740183e+02 -5.29749154e+04 3.73e+04 2.22e-16 8.57e+01 0s 1 1.96575697e+02 -3.99456227e+04 4.98e+03 1.11e-15 1.68e+01 0s 2 1.49009123e+02 -1.88374516e+04 1.61e+03 8.88e-16 5.99e+00 0s 3 1.63267751e+02 -6.67585911e+03 5.77e+02 1.91e-14 2.02e+00 0s 4 1.50135724e+02 -1.73607614e+03 7.80e+01 8.97e-14 4.24e-01 0s 5 1.46637530e+02 -4.28465304e+02 3.52e-13 1.42e-14 1.04e-01 0s 6 1.23075601e+02 -3.01546923e+02 5.30e-13 9.77e-15 7.71e-02 0s 7 8.01061909e+01 -1.15686772e+02 4.76e-13 3.55e-15 3.55e-02 0s 8 7.40735744e+01 -9.18140171e+01 9.69e-13 3.11e-15 3.01e-02 0s 9 6.20816490e+01 -6.08325289e+01 5.90e-13 2.44e-15 2.23e-02 0s 10 4.92502498e+01 -4.17615182e+01 4.58e-13 1.67e-15 1.65e-02 0s 11 3.91273852e+01 -2.86030660e+01 3.17e-13 1.11e-15 1.23e-02 0s 12 2.92124661e+01 -1.52485450e+01 2.42e-13 8.88e-16 8.06e-03 0s 13 2.24022977e+01 -9.84715938e+00 1.70e-13 3.35e-16 5.85e-03 0s 14 1.50114183e+01 -7.92261078e-01 9.50e-13 3.33e-16 2.86e-03 0s 15 1.25387763e+01 4.32297706e+00 4.26e-13 3.33e-16 1.49e-03 0s 16 1.25856834e+01 4.69083489e+00 4.21e-13 3.51e-16 1.43e-03 0s 17 1.19961813e+01 7.25817405e+00 2.71e-13 3.33e-16 8.59e-04 0s 18 1.16003392e+01 8.52975626e+00 1.80e-13 3.11e-16 5.56e-04 0s 19 1.16908259e+01 9.33746887e+00 1.25e-13 3.37e-16 4.26e-04 0s 20 1.11592641e+01 1.02299303e+01 1.12e-13 2.45e-16 1.68e-04 0s 21 1.10734647e+01 1.06816326e+01 5.96e-13 3.33e-16 7.10e-05 0s 22 1.10446242e+01 1.08772675e+01 3.24e-13 2.43e-16 3.03e-05 0s 23 1.10225932e+01 1.09185119e+01 1.81e-13 3.33e-16 1.89e-05 0s 24 1.10090327e+01 1.09662073e+01 3.19e-13 2.75e-16 7.76e-06 0s 25 1.10044460e+01 1.09863157e+01 1.16e-13 2.26e-16 3.29e-06 0s 26 1.10003800e+01 1.09968857e+01 1.06e-12 2.95e-16 6.33e-07 0s 27 1.10000040e+01 1.09999886e+01 1.62e-13 3.41e-16 2.80e-09 0s 28 1.10000000e+01 1.10000000e+01 4.68e-12 2.34e-16 2.80e-12 0s Barrier solved model in 28 iterations and 0.11 seconds Optimal objective 1.10000000e+01 Root relaxation: objective 1.100000e+01, 883 iterations, 0.12 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.00000 0 50 69.00000 11.00000 84.1% - 0s H 0 0 13.0000000 11.00000 15.4% - 0s H 0 0 12.0000000 11.00000 8.33% - 0s * 0 0 0 11.0000000 11.00000 0.0% - 0s Cutting planes: Gomory: 1 Zero half: 1 Explored 0 nodes (2371 simplex iterations) in 0.44 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.100000000000e+01, best bound 1.100000000000e+01, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.44 seconds Total run time: 0.49 seconds Objective: 11 Solution: 1 x [1, 2, 3, 4, 4, 6, 6, 6, 10] 3 x [1, 3, 5, 6, 6, 6, 8, 8, 8, 8, 10] 1 x [1, 4, 4, 4, 4, 5, 8, 8, 8, 8, 9, 10, 10] 1 x [1, 1, 1, 1, 2, 4, 8] 1 x [2, 2, 2, 4, 4, 4, 7, 8, 8, 10] 4 x [4, 7, 7, 7, 9, 10, 10]