Abstract
Throughout this thesis we have considered that the facilities have unlimited capacity, i.e. each facility can serve the necessary demand without any kind of limitation. This property has been very useful to develop cutting planes for every linearisation, see Section 3.2. Furthermore, this property provides an easy computation of a lower bound for the specific branch-and-bound method presented in Chapter 4. Finally, the heuristic procedures proposed in Section 5 are closely related to the absence of capacity constraints.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Domínguez-Marín, P. (2003). Extension to the Capacitated Case. In: The Discrete Ordered Median Problem. Combinatorial Optimization, vol 15. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8511-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8511-8_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4634-0
Online ISBN: 978-1-4419-8511-8
eBook Packages: Springer Book Archive