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

Solving the plant location problem on a line by linear programming

Author

Listed:
  • Jack Brimberg
  • Charles ReVelle

Abstract

No abstract is available for this item.

Suggested Citation

  • Jack Brimberg & Charles ReVelle, 1998. "Solving the plant location problem on a line by linear programming," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 6(2), pages 277-286, December.
  • Handle: RePEc:spr:topjnl:v:6:y:1998:i:2:p:277-286
    DOI: 10.1007/BF02564792
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02564792
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/BF02564792?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. M. L. Balinski, 1965. "Integer Programming: Methods, Uses, Computations," Management Science, INFORMS, vol. 12(3), pages 253-313, November.
    2. Korkel, Manfred, 1989. "On the exact solution of large-scale simple plant location problems," European Journal of Operational Research, Elsevier, vol. 39(2), pages 157-173, March.
    3. ReVelle, Charles, 1993. "Facility siting and integer-friendly programming," European Journal of Operational Research, Elsevier, vol. 65(2), pages 147-158, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Plastria, F., 2012. "A note towards improved homeland defense," Omega, Elsevier, vol. 40(2), pages 244-248, April.
    2. Hüseyin Güden & Haldun Süral, 2017. "A polynomial algorithm for the earthwork allocation problem with borrow and waste site selection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 1085-1093, September.
    3. Jack Brimberg & Abraham Mehrez, 2001. "Location and sizing of facilities on a line," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 271-280, December.
    4. Güden, Hüseyin & Süral, Haldun, 2014. "Locating mobile facilities in railway construction management," Omega, Elsevier, vol. 45(C), pages 71-79.
    5. Laxminarayan Sahoo & Asoke Kumar Bhunia, 2021. "Optimization of plant location problem in interval domain via particle swarm optimization," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(6), pages 1094-1105, December.

    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. Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.
    2. Abareshi, Maryam & Zaferanieh, Mehdi, 2019. "A bi-level capacitated P-median facility location problem with the most likely allocation solution," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 1-20.
    3. Pierre Hansen & Jack Brimberg & Dragan Urošević & Nenad Mladenović, 2007. "Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 552-564, November.
    4. 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.
    5. Ting L. Lei & Richard L. Church, 2011. "Constructs for Multilevel Closest Assignment in Location Modeling," International Regional Science Review, , vol. 34(3), pages 339-367, July.
    6. F. Antonio Medrano, 2020. "The complete vertex p-center problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 327-343, October.
    7. Rosing, K. E. & ReVelle, C. S., 1997. "Heuristic concentration: Two stage solution construction," European Journal of Operational Research, Elsevier, vol. 97(1), pages 75-86, February.
    8. Letchford, Adam N. & Miller, Sebastian J., 2014. "An aggressive reduction scheme for the simple plant location problem," European Journal of Operational Research, Elsevier, vol. 234(3), pages 674-682.
    9. Mladenovic, N. & Brimberg, J. & Hansen, P., 2006. "A note on duality gap in the simple plant location problem," European Journal of Operational Research, Elsevier, vol. 174(1), pages 11-22, October.
    10. Galli, Laura & Letchford, Adam N. & Miller, Sebastian J., 2018. "New valid inequalities and facets for the Simple Plant Location Problem," European Journal of Operational Research, Elsevier, vol. 269(3), pages 824-833.
    11. U. Seppaelae, 1997. "An Evolutionary Model for Spatial Location of Economic Facilities," Working Papers ir97003, International Institute for Applied Systems Analysis.
    12. Haimanko, Ori & Le Breton, Michel & Weber, Shlomo, 2004. "Voluntary formation of communities for the provision of public projects," Journal of Economic Theory, Elsevier, vol. 115(1), pages 1-34, March.
    13. Plastria, F., 2012. "A note towards improved homeland defense," Omega, Elsevier, vol. 40(2), pages 244-248, April.
    14. Tianhang Lu & Han Xian & Qizhi Fang, 2023. "Approximate Core Allocations for Edge Cover Games," Papers 2308.11222, arXiv.org.
    15. Zhu, Stuart X. & Ursavas, Evrim, 2018. "Design and analysis of a satellite network with direct delivery in the pharmaceutical industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 190-207.
    16. Marianov, Vladimir & Serra, Daniel, 2001. "Hierarchical location-allocation models for congested systems," European Journal of Operational Research, Elsevier, vol. 135(1), pages 195-208, November.
    17. Stephanie A. Snyder & Robert G. Haight, 2016. "Application of the Maximal Covering Location Problem to Habitat Reserve Site Selection," International Regional Science Review, , vol. 39(1), pages 28-47, January.
    18. Carreras, Miquel & Serra, Daniel, 1999. "On optimal location with threshold requirements," Socio-Economic Planning Sciences, Elsevier, vol. 33(2), pages 91-103, June.
    19. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    20. Michel Le Breton & Juan Moreno-Ternero & Alexei Savvateev & Shlomo Weber, 2013. "Stability and fairness in models with a multiple membership," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 673-694, August.

    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:6:y:1998:i:2:p:277-286. 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.