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

Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem

Author

Listed:
  • P. M. Dearing

    (Clemson University, Clemson, South Carolina 29631)

  • P. L. Hammer

    (Rutgers University, New Brunswick, New Jersey 08903)

  • B. Simeone

    (Universitá di Roma “La Sapienza,” Rome, Italy 00185)

Abstract

A formulation of the simple plant location problem as the minimization of a pseudo-Boolean function is transformed into a set covering problem and into a weighted vertex packing problem on a graph, called the “plant location graph.” For the special case of a simple plant location problem derived from a tree network, the plant location graph is shown to be weakly triangulated, so that a maximum weighted vertex packing can be found in polynomial-time by existing algorithms.

Suggested Citation

  • P. M. Dearing & P. L. Hammer & B. Simeone, 1992. "Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem," Transportation Science, INFORMS, vol. 26(2), pages 138-148, May.
    • Handle: RePEc:inm:ortrsc:v:26:y:1992:i:2:p:138-148
    DOI: 10.1287/trsc.26.2.138
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.26.2.138
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.26.2.138?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. Sergio García & Martine Labbé & Alfredo Marín, 2011. "Solving Large p -Median Problems with a Radius Formulation," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 546-556, November.
    2. Buchheim, Christoph & Crama, Yves & Rodríguez-Heck, Elisabeth, 2019. "Berge-acyclic multilinear 0–1 optimization problems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 102-107.
    3. repec:dgr:rugsom:00a54 is not listed on IDEAS
    4. Ghosh, Diptesh & Sierksma, Gerard & Goldengorin, Boris & AlMohammad, Bader F., 2000. "Equivalent instances of the simple plant location problem," Research Report 00A54, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    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).

    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:26:y:1992:i:2:p:138-148. 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.