Seminar - Paola Festa: March 24, 2011, 11.00 a.m., classroom A4
Prof.ssa Paola Festa
Dipartimento di Matematica e Applicazioni "R. Caccioppoli"
Università degli Studi di Napoli FEDERICO II
An introduction to metaheuristics and approximation
algorithms for solving hard combinatorial optimization problems
This talk will present a tutorial on the implementation and use of metaheuristics and approximation algorithms for solving hard combinatorial optimization problems.
The basics of most studied algorithms for finding good suboptimal solutions will be introduced, covering genetic algorithms, simulated annealing, tabu search, variable neighborhood search, greedy randomized adaptive search procedures (GRASP), path relinking, and scatter search. Then, implementation issues will be discussed,
illustrating the ease in which sequential and parallel heuristics can be developed.
G. Di Pillo - tel. 06 77274077 - email: firstname.lastname@example.org