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

Algorithms for the Simple Plant-Location Problem with Some Side Conditions

Author

Listed:
  • Kurt Spielberg

    (IBM Corporation, New York, New York)

Abstract

The algorithms of this paper belong to the direct-search or implicit-enumeration type. They compare to the recently proposed algorithm of Efroymson and Ray, as does the mixed integer algorithm proposed by C. E. Lemke and the author to that of Land and Doig. The general plan of procedure is expected to be equally valid for the capacitated plant-location problem and for transshipment problems with fixed charges; with some of the proposed devices more important for these difficult problems than for the simple plant location problem. Considerable computational experience has been accumulated and is discussed at some length. It suggests that additional work on the construction of “adaptive” programs, matching algorithm to data structure, is desirable.

Suggested Citation

  • Kurt Spielberg, 1969. "Algorithms for the Simple Plant-Location Problem with Some Side Conditions," Operations Research, INFORMS, vol. 17(1), pages 85-111, February.
    • Handle: RePEc:inm:oropre:v:17:y:1969:i:1:p:85-111
    DOI: 10.1287/opre.17.1.85
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.17.1.85
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.17.1.85?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. Kurt Spielberg, 2007. "IP over 40+ Years at IBM Scientific Centers and Marketing," Annals of Operations Research, Springer, vol. 149(1), pages 195-208, February.
    2. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    3. Monique Guignard & Ellis Johnson & Kurt Spielberg, 2005. "Logical Processing for Integer Programming," Annals of Operations Research, Springer, vol. 140(1), pages 263-304, November.
    4. 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.
    5. Jesica Armas & Angel A. Juan & Joan M. Marquès & João Pedro Pedroso, 2017. "Solving the deterministic and stochastic uncapacitated facility location problem: from a heuristic to a simheuristic," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1161-1176, October.
    6. Balakrishnan, Anantaram., 1989. "Models for planning the evolution of local telecommunication networks," Working papers 3025-89., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    7. Jakob Krarup, 2007. "Dual ascent: variations of a theme," Annals of Operations Research, Springer, vol. 149(1), pages 137-145, February.
    8. Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.

    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:oropre:v:17:y:1969:i:1:p:85-111. 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.