Name
Abstract | ||
|---|---|---|
In the assignment problem units of supply are assigned on a one-to-one basis to units of demand so as to minimize the sum
of the cost associated with each supply-to-demand matched pair. Defined on a network, the supplies and demands are located
at vertices and the cost of a supply-to-demand matched pair is the distance between them. This paper considers a two-stage
stochastic program for locating the units of supply based upon only a probabilistic characterization of demand. The objective
of the first-stage location problem is to minimize the expected cost of the second-stage assignment problem. Principal results
include showing that the problem is NP-hard on a general network, has a simple solution procedure on a line network, and is
solvable by a low order polynomial greedy procedure on a tree network. Potential applications are discussed. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s10479-005-2040-6 | Annals OR |
Keywords | Field | DocType |
stochastic location,assignment problem,tree networks | Mathematical optimization,Vertex (geometry),Polynomial,Generalized assignment problem,Assignment problem,Probabilistic logic,Multi-commodity flow problem,1-center problem,Mathematics,Tree network | Journal |
Volume | Issue | ISSN |
136 | 1 | 0254-5330 |
Citations | PageRank | References |
3 | 0.46 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ting Zeng | 1 | 3 | 0.46 |
| James E. Ward | 2 | 54 | 7.09 |