Solving a Class of Two-Dimensional Uncapacitated Location-Allocation Problems by Dynamic Programming
Copyright policy )Solving a Class of Two-Dimensional Uncapacitated Location-Allocation Problems by Dynamic Programming
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.
- McMaster University Canada
- Government of Prince Edward Island Canada
- University of Prince Edward Island Canada
Discrete location and assignment, two-dimensional location-allocation problems, one-dimensional dynamic programming, Dynamic programming
Discrete location and assignment, two-dimensional location-allocation problems, one-dimensional dynamic programming, Dynamic programming
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).14 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!