Build (method = -2) #dp: 5878 Step-3' Graph: 674 vertices and 2916 arcs (0.03s) Step-4' Graph: 596 vertices and 2760 arcs (0.03s) #V4/#V3 = 0.88 #A4/#A3 = 0.95 Ready! (0.03s) Optimize a model with 606 rows, 2761 columns and 7105 nonzeros Presolve removed 80 rows and 155 columns Presolve time: 0.03s Presolved: 526 rows, 2606 columns, 6924 nonzeros Variable types: 0 continuous, 2606 integer (0 binary) Found heuristic solution: objective 1000.0000000 Optimize a model with 526 rows, 2606 columns and 6924 nonzeros Presolved: 526 rows, 2606 columns, 6924 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.940e+03 Factor NZ : 1.648e+04 (roughly 1 MByte of memory) Factor Ops : 6.773e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.93886751e+03 -4.11783932e+05 4.90e+05 1.11e-16 8.51e+02 0s 1 2.47911584e+03 -2.60374369e+05 6.22e+04 6.66e-16 1.39e+02 0s 2 1.56859355e+03 -1.11437626e+05 1.87e+04 2.78e-14 4.43e+01 0s 3 1.12151477e+03 -3.34150811e+04 4.28e+03 4.44e-15 1.11e+01 0s 4 9.99954809e+02 -6.90203655e+03 1.76e+02 1.69e-14 1.65e+00 0s 5 9.87406891e+02 -1.82183099e+03 5.34e-12 3.77e-15 5.38e-01 0s 6 7.72298598e+02 -1.91017982e+03 3.21e-12 4.33e-15 5.14e-01 0s 7 7.78137239e+02 -1.15485312e+03 3.69e-12 3.11e-15 3.70e-01 0s 8 6.65701211e+02 -8.68620897e+02 2.30e-12 2.22e-15 2.94e-01 0s 9 6.38809136e+02 -8.15305301e+02 2.36e-12 2.22e-15 2.78e-01 0s 10 5.86706113e+02 -6.41315311e+02 2.44e-12 1.63e-15 2.35e-01 0s 11 5.22146324e+02 -6.16421935e+02 1.27e-12 2.01e-15 2.18e-01 0s 12 4.41614613e+02 -4.84769404e+02 1.59e-12 1.92e-15 1.77e-01 0s 13 3.13053313e+02 -4.41682084e+02 1.25e-12 2.15e-15 1.45e-01 0s 14 2.37884900e+02 -2.88490006e+02 7.71e-13 1.69e-15 1.01e-01 0s 15 1.98505910e+02 -1.25119653e+02 8.43e-13 1.39e-15 6.20e-02 0s 16 1.57257429e+02 -7.88825802e+01 1.04e-12 1.54e-15 4.52e-02 0s 17 1.42621305e+02 -1.18701604e+01 1.23e-12 1.28e-15 2.96e-02 0s 18 1.29493850e+02 2.75824764e+01 1.24e-12 1.44e-15 1.95e-02 0s 19 1.12555161e+02 6.12354365e+01 1.09e-12 1.08e-15 9.83e-03 0s 20 1.10926006e+02 7.17802799e+01 9.18e-13 1.47e-15 7.50e-03 0s 21 1.00351072e+02 8.91465213e+01 4.96e-13 1.09e-15 2.15e-03 0s 22 9.71366804e+01 9.37042505e+01 5.50e-12 1.00e-15 6.57e-04 0s 23 9.67709080e+01 9.54273424e+01 2.45e-12 1.23e-15 2.57e-04 0s 24 9.66640433e+01 9.62224898e+01 1.86e-11 9.77e-16 8.46e-05 0s 25 9.66100242e+01 9.64082522e+01 8.26e-12 1.24e-15 3.86e-05 0s 26 9.65731291e+01 9.65020532e+01 3.08e-12 1.05e-15 1.36e-05 0s 27 9.65615912e+01 9.65487298e+01 3.13e-11 9.02e-16 2.46e-06 0s 28 9.65600110e+01 9.65599069e+01 1.17e-11 1.03e-15 1.99e-08 0s 29 9.65600000e+01 9.65599999e+01 2.00e-12 8.80e-16 1.99e-11 0s Barrier solved model in 29 iterations and 0.07 seconds Optimal objective 9.65600000e+01 Root relaxation: objective 9.656000e+01, 531 iterations, 0.08 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 96.56000 0 50 1000.00000 96.56000 90.3% - 0s H 0 0 97.0000000 96.56000 0.45% - 0s Explored 0 nodes (937 simplex iterations) in 0.19 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.700000000000e+01, best bound 9.700000000000e+01, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.19 seconds Total run time: 0.25 seconds Objective: 97 Solution: 1 x [3, 3, 4, 6, 10] 5 x [1, 4, 6, 6, 6, 6, 8, 9, 9, 9, 10] 2 x [2, 3, 3, 3, 4, 6, 10, 10] 1 x [3, 3, 3, 4, 6, 10, 10] 16 x [3, 3, 3, 4, 6, 6, 6, 6, 6, 10, 10] 4 x [2, 2, 2, 2, 2, 2, 3, 4, 4, 7] 6 x [1, 4, 4, 6, 6, 6, 6, 7, 7, 9, 9] 22 x [1, 1, 2, 2, 2, 2, 2, 9, 9, 10] 15 x [1, 3, 5, 5, 5, 6, 6, 6, 9, 10, 10] 9 x [1, 3, 6, 6, 6, 8, 9, 9, 10, 10] 5 x [2, 2, 2, 2, 2, 3, 3, 3, 3, 9] 11 x [5, 5, 5, 5, 8, 8, 8, 8, 9, 9]