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

Solving Structured Multifacility Location Problems Efficiently

Author

Listed:
  • Dilip Chhajed

    (Department of Business Administration, University of Illinois at Urbana-Champaign, Champaign, Illinois 61820)

  • Timothy J. Lowe

    (Department of Management Sciences, University of Iowa, Iowa City, Iowa 52242)

Abstract

A generic multifacility location problem is considered which subsumes, as special cases, several NP-hard location problems that have appeared in literature. A unified algorithm is presented which solves the generic problem in polynomial time when problem structure, as defined by interactions between pairs of facilities, satisfies certain properties.

Suggested Citation

  • Dilip Chhajed & Timothy J. Lowe, 1994. "Solving Structured Multifacility Location Problems Efficiently," Transportation Science, INFORMS, vol. 28(2), pages 104-115, May.
    • Handle: RePEc:inm:ortrsc:v:28:y:1994:i:2:p:104-115
    DOI: 10.1287/trsc.28.2.104
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.28.2.104
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.28.2.104?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. Dilip Chhajed & Timothy J. Lowe, 1998. "Solving a selected class of location problems by exploiting problem structure: A decomposition approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(8), pages 791-815, December.
    2. John N. Hooker, 2002. "Logic, Optimization, and Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 295-321, November.

    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:28:y:1994:i:2:p:104-115. 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.