In this paper the algorithms for solving the p-median problem based on the Benders decomposition are investigated. A family of problems hard for solving with such algorithms is constructed and then generalized to a special NP-hard case of the p-median problem. It is shown that the effectiveness of the considered algorithms depends on the choice of the optimal values of the dual variables used in Benders cuts. In particular, the depth of the cuts can be equal to one.
['Alexander A. Kolokolov', 'N. S. Kosarev']
Analysis of Decomposition Algorithms with Benders Cuts for p-Median Problem