Probabilistic formulations of some facility location problems in discrete space
The first formulation to be examined is a probabilistic version of the set covering problem. The problem can be stated as follows: determine the locations of the minimum number of facilities among a discrete set of feasible location sites in order to assure that the probability each customer is cove...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
Virginia Tech
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10919/38608 http://scholar.lib.vt.edu/theses/available/etd-06122010-020752/ |