Build (method = -2) #dp: 14586 Step-3' Graph: 713 vertices and 3086 arcs (0.09s) Step-4' Graph: 503 vertices and 2666 arcs (0.10s) #V4/#V3 = 0.71 #A4/#A3 = 0.86 Ready! (0.10s) Optimize a model with 516 rows, 2667 columns and 7007 nonzeros Presolve removed 67 rows and 126 columns Presolve time: 0.03s Presolved: 449 rows, 2541 columns, 6858 nonzeros Variable types: 0 continuous, 2541 integer (0 binary) Found heuristic solution: objective 385.0000000 Optimize a model with 449 rows, 2541 columns and 6858 nonzeros Presolved: 449 rows, 2541 columns, 6858 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.901e+03 Factor NZ : 1.614e+04 (roughly 1 MByte of memory) Factor Ops : 7.809e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.75235771e+03 -2.11014853e+05 2.44e+05 1.11e-16 4.33e+02 0s 1 1.57636867e+03 -1.38538215e+05 3.32e+04 7.77e-16 7.72e+01 0s 2 8.32977234e+02 -5.16389265e+04 9.80e+03 8.88e-16 2.31e+01 0s 3 5.34998270e+02 -1.89692664e+04 2.64e+03 1.78e-15 6.88e+00 0s 4 4.29101694e+02 -6.02931656e+03 2.79e+02 4.00e-15 1.52e+00 0s 5 4.15034580e+02 -1.19895974e+03 1.58e-01 1.55e-15 3.17e-01 0s 6 3.38289935e+02 -9.09108905e+02 5.90e-12 1.33e-15 2.45e-01 0s 7 2.23252050e+02 -5.02542478e+02 3.52e-12 9.99e-16 1.42e-01 0s 8 1.45008145e+02 -3.93546648e+02 2.06e-12 5.55e-16 1.06e-01 0s 9 1.07699648e+02 -1.40388812e+02 1.75e-12 3.33e-16 4.87e-02 0s 10 6.80488994e+01 -4.53706112e+01 1.16e-12 3.33e-16 2.23e-02 0s 11 6.55139007e+01 -8.79757402e+00 2.35e-12 1.93e-16 1.46e-02 0s 12 5.81589968e+01 1.28215194e+01 1.86e-12 2.22e-16 8.90e-03 0s 13 5.41786983e+01 2.14256894e+01 1.22e-12 2.85e-16 6.43e-03 0s 14 5.03670038e+01 3.28416197e+01 6.31e-13 2.10e-16 3.44e-03 0s 15 4.83240783e+01 3.89886623e+01 1.38e-12 2.04e-16 1.83e-03 0s 16 4.76307213e+01 4.33877671e+01 2.96e-12 2.36e-16 8.33e-04 0s 17 4.71722007e+01 4.48733963e+01 1.48e-12 2.24e-16 4.51e-04 0s 18 4.69656148e+01 4.57861398e+01 2.07e-12 2.22e-16 2.31e-04 0s 19 4.68754334e+01 4.60820093e+01 1.17e-12 1.69e-16 1.56e-04 0s 20 4.67602291e+01 4.63259965e+01 8.62e-13 1.59e-16 8.52e-05 0s 21 4.67182098e+01 4.64737612e+01 7.32e-13 1.96e-16 4.80e-05 0s 22 4.66778972e+01 4.65525801e+01 1.97e-12 2.56e-16 2.46e-05 0s 23 4.66471105e+01 4.65762873e+01 5.24e-10 1.91e-16 1.39e-05 0s 24 4.66376586e+01 4.65980006e+01 3.15e-10 2.05e-16 7.78e-06 0s 25 4.66303111e+01 4.66106301e+01 1.80e-10 2.22e-16 3.86e-06 0s 26 4.66270558e+01 4.66194421e+01 8.77e-11 3.33e-16 1.49e-06 0s 27 4.66250624e+01 4.66218517e+01 3.18e-11 1.44e-16 6.30e-07 0s 28 4.66242488e+01 4.66231038e+01 2.17e-11 2.47e-16 2.25e-07 0s 29 4.66238469e+01 4.66231496e+01 2.83e-12 2.22e-16 1.37e-07 0s 30 4.66238028e+01 4.66237814e+01 7.26e-12 2.72e-16 4.20e-09 0s 31 4.66237967e+01 4.66237967e+01 8.66e-12 2.51e-16 5.51e-12 0s Barrier solved model in 31 iterations and 0.07 seconds Optimal objective 4.66237967e+01 Root relaxation: objective 4.662380e+01, 313 iterations, 0.08 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 46.62380 0 71 385.00000 46.62380 87.9% - 0s H 0 0 48.0000000 46.62380 2.87% - 0s H 0 0 47.0000000 46.62380 0.80% - 0s Explored 0 nodes (391 simplex iterations) in 0.27 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.700000000000e+01, best bound 4.700000000000e+01, gap 0.0% Preprocessing time: 0.11 seconds Gurobi run time: 0.27 seconds Total run time: 0.38 seconds Objective: 47 Solution: 3 x [2, 2, 2, 6, 7, 7, 8, 10, 13] 1 x [1, 1, 1, 1, 1, 1, 4, 6, 13] 4 x [4, 4, 4, 4, 4, 5, 9, 10, 13] 1 x [2, 2, 2, 2, 4, 4, 9, 13, 13] 1 x [3, 3, 3, 4, 4, 4, 4, 5, 6] 10 x [6, 7, 10, 10, 10, 10, 10, 10, 11] 2 x [2, 2, 2, 4, 4, 6, 7, 9] 2 x [4, 4, 6, 7, 7, 9, 10, 10, 11] 1 x [4, 6, 6, 7, 7, 9, 9, 10, 10] 2 x [3, 3, 3, 4, 4, 4, 6, 6, 10] 15 x [4, 6, 6, 6, 10, 10, 10, 10, 12] 1 x [2, 3, 6, 6, 6, 6, 6, 10] 1 x [1, 1, 3, 6, 6, 6, 6, 6] 3 x [3, 6, 6, 6, 6, 6, 8, 8, 9]