Problems, Algorithms, and Computational Complexity

Détails

ID Serval
serval:BIB_6CC5EE60DDD6
Type
Partie de livre
Sous-type
Chapitre: chapitre ou section
Collection
Publications
Institution
Titre
Problems, Algorithms, and Computational Complexity
Titre du livre
An Introduction to Metaheuristics for Optimization
Auteur(s)
Chopard B., Tomassini M.
Editeur
Springer International Publishing
ISBN
9783319930725
9783319930732
ISSN
1619-7127
Statut éditorial
Publié
Date de publication
2018
Peer-reviewed
Oui
Pages
1-14
Langue
anglais
Résumé
Metaheuristics are a family of algorithmic techniques that are useful for solving difficult problems. Roughly speaking, the difficulty or hardness of a problem is the quantity of computational resources needed to find the solution. When this quantity increases at a high rate with increasing problem size, in a way that will be defined precisely later, we are facing a difficult problem. The theory of the computational complexity of algorithmic problems is well known [34, 66] and, in this first chapter, we shall look at the basics and the main conclusions since these ideas are needed to understand the place of metaheuristics in this context.
Création de la notice
20/02/2019 13:38
Dernière modification de la notice
21/08/2019 5:14
Données d'usage