| Article ID: | iaor20052308 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 2 |
| Start Page Number: | 134 |
| End Page Number: | 142 |
| Publication Date: | Mar 2005 |
| Journal: | Operations Research Letters |
| Authors: | Bollapragada Ramesh, Rao Uday S., Camm Jeffrey, Wu Junying |
| Keywords: | location, heuristics |
We study a two-phase, budget-constrained, network-planning problem with multiple hub types and demand scenarios. In each phase, we install (or move) capacitated hubs on selected buildings. We allocate hubs to realized demands, under technological constraints. We present a greedy algorithm to maximize expected demand covered and computationally study its performance.