IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v43y1995i4p661-669.html
   My bibliography  Save this article

Specially Structured Uncapacitated Facility Location Problems

Author

Listed:
  • Philip C. Jones

    (University of Iowa, Iowa City, Iowa)

  • Timothy J. Lowe

    (University of Iowa, Iowa City, Iowa)

  • Georg Muller

    (University of Chicago, Chicago, Illinois)

  • Ning Xu

    (George Mason University, Fairfax, Virginia)

  • Yinyu Ye

    (University of Iowa, Iowa City, Iowa)

  • James L. Zydiak

    (Loyola University, Chicago, Illinois)

Abstract

This paper considers a specially structured uncapacitated facility location problem. We show that several problems, including certain tool selection problems, substitutable inventory problems, supplier sourcing problems, discrete lot sizing problems, and capacity expansion problems, can be formulated as instances of the problem. We also show that the problem with m facilities and n customers can be solved in O ( mn ), as a shortest path problem on a directed graph.

Suggested Citation

  • Philip C. Jones & Timothy J. Lowe & Georg Muller & Ning Xu & Yinyu Ye & James L. Zydiak, 1995. "Specially Structured Uncapacitated Facility Location Problems," Operations Research, INFORMS, vol. 43(4), pages 661-669, August.
    • Handle: RePEc:inm:oropre:v:43:y:1995:i:4:p:661-669
    DOI: 10.1287/opre.43.4.661
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.43.4.661
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.43.4.661?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. C. Arbib & F. Marinelli, 2009. "Exact and Asymptotically Exact Solutions for a Class of Assortment Problems," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 13-25, February.
    2. Itir Karaesmen & Garrett van Ryzin, 2004. "Overbooking with Substitutable Inventory Classes," Operations Research, INFORMS, vol. 52(1), pages 83-104, February.
    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. Barros, Lilian & Riley, Michael, 2001. "A combinatorial approach to level of repair analysis," European Journal of Operational Research, Elsevier, vol. 129(2), pages 242-251, March.
    5. Goldengorin, Boris & Ghosh, Diptesh & Sierksma, Gerard, 2001. "Branch and peg algorithms for the simple plant location problem," Research Report 01A14, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    6. Milind Dawande & Srinagesh Gavirneni & Yinping Mu & Suresh Sethi & Chelliah Sriskandarajah, 2010. "On the Interaction Between Demand Substitution and Production Changeovers," Manufacturing & Service Operations Management, INFORMS, vol. 12(4), pages 682-691, September.
    7. Vernon Ning Hsu, 2002. "Dynamic Capacity Expansion Problem with Deferred Expansion and Age-Dependent Shortage Cost," Manufacturing & Service Operations Management, INFORMS, vol. 4(1), pages 44-54, June.

    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:oropre:v:43:y:1995:i:4:p:661-669. 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.