| Article ID: | iaor20031317 |
| Country: | Netherlands |
| Volume: | 111 |
| Issue: | 1 |
| Start Page Number: | 75 |
| End Page Number: | 88 |
| Publication Date: | Mar 2002 |
| Journal: | Annals of Operations Research |
| Authors: | Carrizosa E., Puerto J., Muoz-Mrquez M. |
In this paper we address the problem of locating a mobile response unit when demand is distributed according to a random variable on a line. Properties are proven which reduce the problem to locating a non-mobile facility, transforming the original optimization problem into an one-dimensional convex program. In the special case of a discrete demand (a simple probability measure), an algorithm which runs in expected linear time is proposed.