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

Jack Brimberg and Robert F. Love
Additional contact information
Jack Brimberg: University of Prince Edward Island, Charlottetown, Prince Edward Island, Canada
Robert F. Love: McMaster University, Hamilton, Ontario, Canada

Operations Research, 1998, vol. 46, issue 5, 702-709

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.

Keywords: Facilities/equipment planning; location-continuous (search for similar items in EconPapers)
Date: 1998
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.46.5.702 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:46:y:1998:i:5:p:702-709

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().