Abstract
In Chapters 3 and 4 different exact approaches were proposed for solving the DOMP; From the results presented in Section 4.3 we can conclude that the specific branch-and-bound (B&B) algorithm needs much less computing time than the linearisations derived in Chapter 3, see also Appendices B.2 and C.2. Moreover, this B&B method can solve problems that are almost twice as large as the ones solved by the best linearisation (see footnote 1 on page 73). Nevertheless, although we are able to solve exactly problems up to M = 35 existing facilities, these are still far from real problem sizes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Heuristic Procedures. In: The Discrete Ordered Median Problem. Combinatorial Optimization, vol 15. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8511-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8511-8_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4634-0
Online ISBN: 978-1-4419-8511-8
eBook Packages: Springer Book Archive