Metaheuristics for Multicast Routing

Carlos A. S. Oliveira () and Panos M. Pardalos ()
Additional contact information
Carlos A. S. Oliveira: Bloomberg LP
Panos M. Pardalos: University of Florida

Chapter Chapter 7 in Mathematical Aspects of Network Routing Optimization, 2011, pp 77-94 from Springer

Abstract: 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.

Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-0311-1_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461403111

DOI: 10.1007/978-1-4614-0311-1_7

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().