Competitive facility location models

Computational Mathematics and Mathematical Physics

Volumn 49, Issue 6, 2009, Pages 994-1009

  Kononov, A V ^a   Kochetov, Yu A ^a   Plyasunov, A V ^a  

^a NOVOSIBIRSK STATE UNIVERSITY   (Russian Federation)

Author keywords

Local optima; Location problems; Nash equilibriums; PLS complete problems

Indexed keywords

EID: 67650647236     PISSN: 09655425     EISSN: 15556662     Source Type: Journal    
DOI: 10.1134/S0965542509060086     Document Type: Article

References (25)

1. Z. Drezner, K. Klamroth, A. Schobel, and G. Wesolowsky, "The Weber Problem," in Facility Location: Applications and Theory (Springer, Berlin, 2004), pp. 1-36.
2. V. L. Beresnev, Discrete Location Problems and Polynomials of Boolean Variables (Institut matematiki, SO RAN, Novosibirsk, 2005) [in Russian].
3. Y. Chan, Location, Transport and Land-Use. Modelling Spatial-Temporal Information (Springer, Berlin, 2005).
4. V. R. Khachaturov, V. E. Veselovskii, A. V. Zlotov, et al., Combinatorial Methods and Algorithms for Solving Large-Scale Discrete Optimization Problems (Nauka, Moscow, 2000) [in Russian].
5. H. A. Eiselt and C.-L. Sandblom, Decision Analysis, Location Models, and Scheduling Problems (Springer, Berlin, 2004).
6. Discrete Location Theory, Ed. By P. B. Mirchandani, and R. L. Francis (Wiley, Chichester, 1990).
7. V. Beresnev, E. Kh. Gimadi, and V. T. Dement'ev, Extremal Standardization Problems (Nauka, Novosibirsk, 1978) [in Russian].
8. B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms, 3rd ed. (Springer, Berlin, 2005).
9. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency (Springer, Berlin, 2003).
10. J. Krarup P. M. Pruzan 1983 The Simple Plant Location Problem: Survey and Synthesis European J. Operat. Res. 12 36 81
11. E. V. Alekseeva Yu. A. Kochetov 2007 Genetic Local Search for the p-Median Problem with Client's Preferences Diskretnyi Analiz Issl. Operatsii, Ser. 2 14 1 3 31
12. L. E. Gorbachevskaya, Polynomially Solvable and NP-Hard Standardization Problems, Candidate's Dissertation in Mathematics and Physics (IM SO RAN, Novosibirsk, 1998).
13. C. M. C. Rodriquez J. A. M. Perez 2008 Multiple Voting Location Problems European J. Operat. Res. 191 437 453
14. F. Plastria L. Vanhaverbeke 2008 Discrete Models for Competitive Location with Foresight Comput. Operat. Res. 35 683 700 (Pubitemid 47376774)
15. T. Drezner and H. A. Eiselt, "Consumers in Competitive Location Models," in Facility Location: Applications and Theory (Springer, Berlin, 2004), pp. 151-178.
16. E. V. Alekseeva and N. A. Kochetova, "Upper and Lower Bounds for the Competitive p-Median Problem," in Trudy XIV Baikal'skoi mezhdunarodnoi shkoly-seminara "Metody optimizatsii i ikh prilozheniya, Severobaikal'sk, 2008, Vol. 1, pp. 563-569 [in Russian].
17. E. V. Alekseeva and A. V. Orlov, "A Genetic Algorithm for the Competitive p-Median Problem," in Trudy XIV Baikal'skoi mezhdunarodnoi shkoly-seminara "Metody optimizatsii i ikh prilozheniya, Severobaikal'sk," 2008, Vol. 1, pp. 570-576 [in Russian].
18. E. Koutsoupias and C. Papadimitriou, "Worst-Case Equilibria," in Proc. XVI Ann. Symposium on the Theory and Aspects of Computer Science, Trier, Germany, 1999 pp. 404-413.
19. A. Vetta, "Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing, and Auctions," in Proc. XLIII Ann. IEEE Symposium on the Foundations of Computer Science, Vancouver, Canada, 2002 pp. 416-425.
20. Yu. A. Kochetov M. G. Pashchenko A. V. Plyasunov 2005 On the Complexity of Local Search in the p-Median Problem Diskretnyi Analiz Issl. Operatsii, Ser. 2 12 2 44 71
21. Yu. A. Kochetov, "Nash Equilibria in Game Location Models," in Trudy XIV Baikal'skoi mezhdunarodnoi shkolyseminara "Metody optimizatsii i ikh prilozheniya, Severobaikal'sk, 2008, Vol. 1, pp. 119-127 [in Russian].
22. E. Tardos and T. Wexler, "Network Formation Games and the Potential Function Method" in Algorithmic Game Theory (Univ. Press, Cambridge, 2007), pp. 487-516.
23. Yu. A. Kochetov 2008 Computational Bounds for Local Search in Combinatorial Optimization Zh. Vychisl. Mat. Mat. Fiz. 48 5 747 764 [Comput. Math. Math. Phys. 747-763 48, (2008)]
24. M. Yannakakis, "Computational Complexity," in Local Search in Combinatorial Optimization (Wiley, Chichester, 1997), pp. 19-55.
25. T. Vredeveld J. K. Lenstra 2003 On Local Search for the Generalized Graph Coloring Problem Operat. Res. Letts 31 4 28 34 (Pubitemid 35432902)