Complexity of local search for the p-median problem

For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding local search problems are PLS-complete. In the average case we note that standard local descent algorithm is polynomial. A relationship between local optima and 0

• Type: Journal
• Year: 2008
• Where: EOR
• Authors: Ekaterina Alekseeva, Yury Kochetov, Alexander Plyasunov
• Keywords: Average Case, Corresponding Local Search, EOR 2008, Local Descent Algorithm