Complexity of local search for the p-median problem

European Journal of Operational Research

Volumn 191, Issue 3, 2008, Pages 736-752

  Alekseeva, Ekaterina ^a   Kochetov, Yuri ^a   Plyasunov, Alexander ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

0 1 local saddle points; Karush Kuhn Tucker conditions; Local search; Pivoting rules; PLS completeness; Pseudo Boolean functions

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; ITERATIVE METHODS; ONLINE SEARCHING; POLYNOMIALS;

KARUSH-KUHN-TUCKER CONDITIONS; LOCAL SADDLE POINTS; PIVOTING RULES; PSEUDO BOOLEAN FUNCTIONS;

PROBLEM SOLVING;

EID: 44649175644     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.12.063     Document Type: Article

References (16)

1. Arya V., Garg N., Khandekar R., Meyerson A., Munagala K., and Pandit V. Local search heuristics for k-median and facility location problems. SIAM Journal on Computing 33 (2004) 544-562
2. Ausiello G., Gambosi P., Crescenzi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties (1999), Springer, Berlin
3. Beresnev V.L., Gimadi E.Kh., and Dementèv V.T. Extremal Standardization Problems (1978), Nauka, Novosibirsk (in Russian)
4. Fiduccia C.M., and Mattheyses R.M. A linear time heuristic for improving network partitions. ACM IEEE Nineteenth Design Automation Conference: Proceedings (1982), IEEE Computer Society Press 175-181
5. Johnson D.C., Papadimitriou C.H., and Yannakakis M. How easy is local search?. Journal of Computer and system Sciences 37 1 (1988) 56-87
6. Kernighan B.W., and Lin S. An effective heuristic procedure for partitioning graphs. The Bell System Technical Journal 49 (1970) 291-307
7. Korte B., and Vygen J. Combinatorial Optimization. Theory and Algorithms. third ed. (2005), Springer
8. Mladenović N., Brimberg J., Hansen P., and Moreno-Pérez J. The p-median problem: A survey of metaheuristic approaches. European Journal of Operational Research 179 3 (2007) 927-939
9. Nemhauser G.L., and Wolsey L.A. Integer and Combinatorial Optimization (1988), John Wiley & Sons
10. Orlin, J., Punnen, A., Schulz, A., 2004. Approximate local search in combinatorial optimization. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana.
11. Papadimitriou C., and Steiglitz K. Combinatorial Optimization: Algorithms and Complexity (1982), Prentice-Hall
12. Resender M., and Werneck R.F. On the implementation of a swap-based local search procedure for the p-median problem. In: Ladner R.E. (Ed). Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (2003), SIAM pp. 119-127
13. Schäffer A.A., and Yannakakis M. Simple local search problems that are hard to solve. SIAM Journal on Computing 20 1 (1991) 56-87
14. Tovey C.A. Local improvement on discrete structures. In: Aarts E., and Lenstra J.K. (Eds). Local Search in Combinatorial Optimization (1997), John Wiley & Sons, Chichester 57-89
15. Vredeveld T., and Lenstra J.K. On local search for the generalized graph coloring problem. Operations Research Letters 31 4 (2003) 28-34
16. Yannakakis M. Computational complexity. In: Aarts E., and Lenstra J.K. (Eds). Local Search in Combinatorial Optimization (1997), John Wiley & Sons, Chichester 9-55