Problems, Algorithms, and Computational Complexity

Details

Serval ID
serval:BIB_6CC5EE60DDD6
Type
A part of a book
Publication sub-type
Chapter: chapter ou part
Collection
Publications
Institution
Title
Problems, Algorithms, and Computational Complexity
Title of the book
An Introduction to Metaheuristics for Optimization
Author(s)
Chopard B., Tomassini M.
Publisher
Springer International Publishing
ISBN
9783319930725
9783319930732
ISSN
1619-7127
Publication state
Published
Issued date
2018
Peer-reviewed
Oui
Pages
1-14
Language
english
Abstract
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.
Create date
20/02/2019 14:38
Last modification date
21/08/2019 6:14
Usage data