Abstract
Approximation algorithms or simple heuristics are the normal way to go when we need fast results for a combinatorial optimization problem. However, when higher accuracy is needed and there is sufficient time to run a more detailed search algorithm, metaheuristics allow us to consistently find better solutions Martins and Ribeiro [2006]. Such metaheuristics provide a framework for intensification of global search that includes randomization as a basic strategy to explore the set of feasible solutions in an efficient way.
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Oliveira, C.A.S., Pardalos, P.M. (2011). Metaheuristics for Multicast Routing. In: Mathematical Aspects of Network Routing Optimization. Springer Optimization and Its Applications(), vol 53. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-0311-1_7
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0311-1_7
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-0310-4
Online ISBN: 978-1-4614-0311-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)