IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v18y2010i1p97-121.html
   My bibliography  Save this article

An exact procedure and LP formulations for the leader—follower location problem

Author

Listed:
  • Clara Campos Rodríguez
  • Dolores Santos Peñate
  • José Moreno Pérez

Abstract

No abstract is available for this item.

Suggested Citation

  • Clara Campos Rodríguez & Dolores Santos Peñate & José Moreno Pérez, 2010. "An exact procedure and LP formulations for the leader—follower location problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 97-121, July.
    • Handle: RePEc:spr:topjnl:v:18:y:2010:i:1:p:97-121
    DOI: 10.1007/s11750-009-0117-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-009-0117-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11750-009-0117-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. H. A. Eiselt & Gilbert Laporte & Jacques-François Thisse, 1993. "Competitive Location Models: A Framework and Bibliography," Transportation Science, INFORMS, vol. 27(1), pages 44-54, February.
    2. Eiselt, H. A. & Laporte, G., 1989. "Competitive spatial models," European Journal of Operational Research, Elsevier, vol. 39(3), pages 231-242, April.
    3. Daniel Serra & Charles Revelle, 1994. "Competitive location in discrete space," Economics Working Papers 96, Department of Economics and Business, Universitat Pompeu Fabra.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Haase, Knut & Hoppe, Mirko, 2008. "Standortplanung unter Wettbewerb - Teil 1: Grundlagen," Discussion Papers 2/2008, Technische Universität Dresden, "Friedrich List" Faculty of Transport and Traffic Sciences, Institute of Transport and Economics.
    2. Kress, Dominik & Pesch, Erwin, 2012. "Sequential competitive location on networks," European Journal of Operational Research, Elsevier, vol. 217(3), pages 483-499.
    3. Plastria, Frank, 2001. "Static competitive facility location: An overview of optimisation approaches," European Journal of Operational Research, Elsevier, vol. 129(3), pages 461-470, March.
    4. Gentile, José & Alves Pessoa, Artur & Poss, Michael & Costa Roboredo, Marcos, 2018. "Integer programming formulations for three sequential discrete competitive location problems with foresight," European Journal of Operational Research, Elsevier, vol. 265(3), pages 872-881.
    5. Daniel Serra & Charles Revelle, 1997. "Competitive location and pricing on networks," Economics Working Papers 219, Department of Economics and Business, Universitat Pompeu Fabra.
    6. Fernandez, Pascual & Pelegrin, Blas & Garcia Perez, Maria Dolores & Peeters, Peter H., 2007. "A discrete long-term location-price problem under the assumption of discriminatory pricing: Formulations and parametric analysis," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1050-1062, June.
    7. Roboredo, Marcos Costa & Pessoa, Artur Alves, 2013. "A branch-and-cut algorithm for the discrete (r∣p)-centroid problem," European Journal of Operational Research, Elsevier, vol. 224(1), pages 101-109.
    8. Shiode, Shogo & Drezner, Zvi, 2003. "A competitive facility location problem on a tree network with stochastic weights," European Journal of Operational Research, Elsevier, vol. 149(1), pages 47-52, August.
    9. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    10. ReVelle, C. S. & Eiselt, H. A., 2005. "Location analysis: A synthesis and survey," European Journal of Operational Research, Elsevier, vol. 165(1), pages 1-19, August.
    11. Rhim, Hosun & Ho, Teck H. & Karmarkar, Uday S., 2003. "Competitive location, production, and market selection," European Journal of Operational Research, Elsevier, vol. 149(1), pages 211-228, August.
    12. Aritra Banik & Bhaswar B. Bhattacharya & Sandip Das, 2013. "Optimal strategies for the one-round discrete Voronoi game on a line," Journal of Combinatorial Optimization, Springer, vol. 26(4), pages 655-669, November.
    13. Zhang, Ying & Snyder, Lawrence V. & Ralphs, Ted K. & Xue, Zhaojie, 2016. "The competitive facility location problem under disruption risks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 453-473.
    14. Hai Yang & S. C. Wong, 2000. "A Continuous Equilibrium Model for Estimating Market Areas of Competitive Facilities with Elastic Demand and Market Externality," Transportation Science, INFORMS, vol. 34(2), pages 216-227, May.
    15. Daniel Serra & Charles Revelle, 1994. "Competitive location in discrete space," Economics Working Papers 96, Department of Economics and Business, Universitat Pompeu Fabra.
    16. Wenxuan Shan & Qianqian Yan & Chao Chen & Mengjie Zhang & Baozhen Yao & Xuemei Fu, 2019. "Optimization of competitive facility location for chain stores," Annals of Operations Research, Springer, vol. 273(1), pages 187-205, February.
    17. Marianov, Vladimir & Rí­os, Miguel & Icaza, Manuel José, 2008. "Facility location for market capture when users rank facilities by shorter travel and waiting times," European Journal of Operational Research, Elsevier, vol. 191(1), pages 32-44, November.
    18. Rafael Suárez‐Vega & Dolores R. Santos‐Peñate & Pablo Dorta‐González, 2004. "Competitive Multifacility Location on Networks: the (r∣Xp)‐Medianoid Problem," Journal of Regional Science, Wiley Blackwell, vol. 44(3), pages 569-588, August.
    19. Blas Pelegrín & Rafael Suárez-Vega & Saúl Cano, 2012. "Isodistant points in competitive network facility location," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(3), pages 639-660, October.
    20. Eiselt, H. A. & Laporte, Gilbert, 1997. "Sequential location problems," European Journal of Operational Research, Elsevier, vol. 96(2), pages 217-231, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:18:y:2010:i:1:p:97-121. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.