IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v30y1996i1p75-80.html
   My bibliography  Save this article

Capacitated Location Problems on a Line

Author

Listed:
  • Prakash Mirchandani

    (Joseph M. Katz Graduate School of Business, University of Pittsburgh, Pittsburgh, Pennsylvania 15260)

  • Rajeev Kohli

    (Graduate School of Business, Columbia University, New York 10027)

  • Arie Tamir

    (Stern School of Business, New York University, and School of Mathematical Sciences, Tel Aviv University, Israel)

Abstract

This paper examines capacitated facility location problems on a straight line. To serve a customer, a facility must be located within a corresponding customer neighborhood. The fixed costs of locating facilities and the unit production costs of serving a customer from a facility can depend upon their locations on the line. We discuss the computational complexity of several capacitated location models. For capacitated problems on a line with non-nested customer intervals, and for general capacitated problems that satisfy a certain “monotonicity” property, we develop polynomial-time dynamic programming algorithms for (i) locating minimum cost facilities to serve all customers, and (ii) maximizing the profit by locating up to q facilities that serve some or all customers with idiosyncratic returns, penalties and demands.

Suggested Citation

  • Prakash Mirchandani & Rajeev Kohli & Arie Tamir, 1996. "Capacitated Location Problems on a Line," Transportation Science, INFORMS, vol. 30(1), pages 75-80, February.
    • Handle: RePEc:inm:ortrsc:v:30:y:1996:i:1:p:75-80
    DOI: 10.1287/trsc.30.1.75
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.30.1.75
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.30.1.75?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
    ---><---

    Citations

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


    Cited by:

    1. Huang, Rongbing & Menezes, Mozart B.C. & Kim, Seokjin, 2012. "The impact of cost uncertainty on the location of a distribution center," European Journal of Operational Research, Elsevier, vol. 218(2), pages 401-407.
    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. Güden, Hüseyin & Süral, Haldun, 2014. "Locating mobile facilities in railway construction management," Omega, Elsevier, vol. 45(C), pages 71-79.

    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:inm:ortrsc:v:30:y:1996:i:1:p:75-80. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.