Abstract
Since location problems with barriers are generally difficult global optimization problems, problem relaxations allowing for the determination of good bounds are essential for their solution. Some of the bounds for location problems with barriers developed in this chapter are also discussed in Dearing et al. (2002) and Hamacher and Klamroth (2000).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Klamroth, K. (2002). Bounds for Location Problems with Barriers. In: Single-Facility Location Problems with Barriers. Springer Series in Operations Research. Springer, New York, NY. https://doi.org/10.1007/0-387-22707-5_4
Download citation
DOI: https://doi.org/10.1007/0-387-22707-5_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-3027-9
Online ISBN: 978-0-387-22707-8
eBook Packages: Springer Book Archive