Article ID: | iaor200971932 |
Country: | Belgium |
Volume: | 14 |
Issue: | 1 |
Start Page Number: | 47 |
End Page Number: | 66 |
Publication Date: | Jun 2000 |
Journal: | Studies in Locational Analysis |
Authors: | Boffey T Brian, Revelle Charles S |
Keywords: | networks |
Path and tree covering problems are discussed and relations between them explored. It is shown that a new problem, the anchored network covering problem, plays a central role effectively generalizing various existing model problems. Two formulations of the anchored network covering problem are put forward and it is shown that the tree-based formulation can lead to stronger linear programming bounds.