Article ID: | iaor200392 |
Country: | United States |
Volume: | 38 |
Issue: | 2 |
Start Page Number: | 102 |
End Page Number: | 113 |
Publication Date: | Sep 2001 |
Journal: | Networks |
Authors: | Burkard Rainer E., Dollani Helidon |
Keywords: | obnoxious facilities |
In this paper, we consider different aspects of robust 1-median problems on a tree network with uncertain or dynamically changing edge lengths and vertex weights which can also take negative values. The dynamic nature of a parameter is modeled by a linear function of time. A linear algorithm is designed for the absolute dynamic robust 1-median problem on a tree. The dynamic robust deviation 1-median problem on a tree with