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

Solving a Class of Two-Dimensional Uncapacitated Location-Allocation Problems by Dynamic Programming

Author

Listed:
  • Jack Brimberg

    (University of Prince Edward Island, Charlottetown, Prince Edward Island, Canada)

  • Robert F. Love

    (McMaster University, Hamilton, Ontario, Canada)

Abstract

In this paper we define and analyze a class of two-dimensional location-allocation problems that can be solved with a one-dimensional dynamic programming algorithm. We define a criterion that must be satisfied in order that a problem can be classified as having a one-dimensional intrinsic property. An algorithm is developed to test any given problem to see if it possesses this property. We then show that any problem possessing the intrinsic property can be solved by means of an efficient dynamic programming algorithm developed earlier by one of the authors.

Suggested Citation

  • Jack Brimberg & Robert F. Love, 1998. "Solving a Class of Two-Dimensional Uncapacitated Location-Allocation Problems by Dynamic Programming," Operations Research, INFORMS, vol. 46(5), pages 702-709, October.
    • Handle: RePEc:inm:oropre:v:46:y:1998:i:5:p:702-709
    DOI: 10.1287/opre.46.5.702
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.46.5.702
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.46.5.702?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. Venkateshan, Prahalad & Ballou, Ronald H. & Mathur, Kamlesh & Maruthasalam, Arulanantha P.P., 2017. "A Two-echelon joint continuous-discrete location model," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1028-1039.

    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:46:y:1998:i:5:p:702-709. 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.