IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v182y2007i3p1479-1487.html
   My bibliography  Save this article

An approximation algorithm for the location of dairy enterprises under time constraints

Author

Listed:
  • Papathanasiou, Jason
  • Manos, Basil D.

Abstract

No abstract is available for this item.

Suggested Citation

  • Papathanasiou, Jason & Manos, Basil D., 2007. "An approximation algorithm for the location of dairy enterprises under time constraints," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1479-1487, November.
    • Handle: RePEc:eee:ejores:v:182:y:2007:i:3:p:1479-1487
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00986-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Drezner, Tammy & Drezner, Zvi & Salhi, Said, 2002. "Solving the multiple competitive facilities location problem," European Journal of Operational Research, Elsevier, vol. 142(1), pages 138-151, October.
    3. Bresnahan, Timothy F & Reiss, Peter C, 1991. "Entry and Competition in Concentrated Markets," Journal of Political Economy, University of Chicago Press, vol. 99(5), pages 977-1009, October.
    4. Daniel Serra & Charles Revelle & Ken Rosing, 1999. "Surviving in a competitive spatial market: The threshold capture model," Economics Working Papers 359, Department of Economics and Business, Universitat Pompeu Fabra.
    5. 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.
    6. P V Balakrishnan & J E Storbeck, 1991. "McThresh: Modeling Maximum Coverage with Threshold Constraints," Environment and Planning B, , vol. 18(4), pages 459-472, December.
    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. Blanquero, Rafael & Carrizosa, Emilio & G.-Tóth, Boglárka & Nogales-Gómez, Amaya, 2016. "p-facility Huff location problem on networks," European Journal of Operational Research, Elsevier, vol. 255(1), pages 34-42.
    2. Drezner, Zvi & Eiselt, H.A., 2024. "Competitive location models: A review," European Journal of Operational Research, Elsevier, vol. 316(1), pages 5-18.
    3. Paul Berglund & Changhyun Kwon, 2014. "Solving a Location Problem of a Stackelberg Firm Competing with Cournot-Nash Firms," Networks and Spatial Economics, Springer, vol. 14(1), pages 117-132, March.
    4. S Rezapour & R Zanjirani Farahani & T Drezner, 2011. "Strategic design of competing supply chain networks for inelastic demand," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(10), pages 1784-1795, October.
    5. Rafael Blanquero & Emilio Carrizosa & Amaya Nogales-Gómez & Frank Plastria, 2014. "Single-facility huff location problems on networks," Annals of Operations Research, Springer, vol. 222(1), pages 175-195, November.
    6. Martin Carree & Marcus Dejardin, 2007. "‘Entry Thresholds and Actual Entry and Exit in Local Markets’," Small Business Economics, Springer, vol. 29(1), pages 203-212, June.
    7. Francisco Silva & Daniel Serra, 2007. "Incorporating Waiting Time in Competitive Location Models," Networks and Spatial Economics, Springer, vol. 7(1), pages 63-76, March.
    8. 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.
    9. Martha-Selene Casas-Ramírez & José-Fernando Camacho-Vallejo & Juan A. Díaz & Dolores E. Luna, 2020. "A bi-level maximal covering location problem," Operational Research, Springer, vol. 20(2), pages 827-855, June.
    10. Buechel, Berno & Roehl, Nils, 2015. "Robust equilibria in location games," European Journal of Operational Research, Elsevier, vol. 240(2), pages 505-517.
    11. Fernandez, Jose & Pelegri'n, Blas & Plastria, Frank & Toth, Boglarka, 2007. "Solving a Huff-like competitive location and design model for profit maximization in the plane," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1274-1287, June.
    12. Díaz-Báñez, J.M. & Heredia, M. & Pelegrín, B. & Pérez-Lantero, P. & Ventura, I., 2011. "Finding all pure strategy Nash equilibria in a planar location game," European Journal of Operational Research, Elsevier, vol. 214(1), pages 91-98, October.
    13. Konur, Dinçer & Geunes, Joseph, 2012. "Competitive multi-facility location games with non-identical firms and convex traffic congestion costs," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 373-385.
    14. Sven Müller & Knut Haase & Sascha Kless, 2009. "A Multiperiod School Location Planning Approach with Free School Choice," Environment and Planning A, , vol. 41(12), pages 2929-2945, December.
    15. Redondo, Juana L. & Fernández, José & Arrondo, Aránzazu G. & García, Inmaculada & Ortigosa, Pilar M., 2012. "Fixed or variable demand? Does it matter when locating a facility?," Omega, Elsevier, vol. 40(1), pages 9-20, January.
    16. Gunhak Lee & Morton E. O'Kelly, 2009. "Exploring Locational Equilibria In A Competitive Broadband Access Market: Theoretical Modeling Approach," Journal of Regional Science, Wiley Blackwell, vol. 49(5), pages 953-975, December.
    17. 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.
    18. Casas-Ramírez, Martha-Selene & Camacho-Vallejo, José-Fernando & Martínez-Salazar, Iris-Abril, 2018. "Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences," Applied Mathematics and Computation, Elsevier, vol. 319(C), pages 369-386.
    19. J. Redondo & J. Fernández & I. García & P. Ortigosa, 2011. "Parallel algorithms for continuous multifacility competitive location problems," Journal of Global Optimization, Springer, vol. 50(4), pages 557-573, August.
    20. 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.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:182:y:2007:i:3:p:1479-1487. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.