par Paquete, Luis;Schiavinotto, Tommaso;Stützle, Thomas 
Référence Annals of operation research, 156, 1, page (83-97)
Publication Publié, 2007-12
Référence Annals of operation research, 156, 1, page (83-97)
Publication Publié, 2007-12
Article révisé par les pairs
| Résumé : | In this article, local optimality in multiobjective combinatorial optimization is used as a baseline for the design and analysis of two iterative improvement algorithms. Both algorithms search in a neighborhood that is defined on a collection of sets of feasible solutions and their acceptance criterion is based on outperformance relations. Proofs of the soundness and completeness of these algorithms are given. © 2007 Springer Science+Business Media, LLC. |
