Metaheuristics for Combinatorial Optimization / edited by Salvatore Greco, Mario F. Pavone, El-Ghazali Talbi, Daniele Vigo
Contributor(s): Greco, Salvatore, editor literario | Pavone, Mario F, editor literario | Talbi, El-Ghazali, editor literario | Vigo, Daniele, editor literario
Material type:
E-bookSeries: (Advances in Intelligent Systems and Computing, 2194-5357; 1336); (Intelligent Technologies and Robotics (SpringerNature-42732)); (Intelligent Technologies and Robotics (R0) (SpringerNature-43728)).Publisher: Cham : Springer International Pulishing, 2021Edition: First edition 2021.Description: 1 recurso en línea (XI, 57 páginas) : 21 ilustraciones, 16 ilustraciones a color.ISBN: 9783030685201.Subject: Programación metaheurística
Online resources: Acceso a este recurso digital (usuarios Universidad Europea de Madrid)
Abstract: This book presents novel and original metaheuristics developed to solve the cost-balanced traveling salesman problem. This problem was taken into account for the Metaheuristics Competition proposed in MESS 2018, Metaheuristics Summer School, and the top 4 methodologies ranked are included in the book, together with a brief introduction to the traveling salesman problem and all its variants. The book is aimed particularly at all researchers in metaheuristics and combinatorial optimization areas. Key uses are metaheuristics; complex problem solving; combinatorial optimization; traveling salesman problem.
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
LIBRO-E NO PRÉSTAMO
|
Madrid Digital Acceso Electrónico (UEM) | Ciencias e Ingeniería | T57.84 2021 EB (Browse shelf(Opens below)) | Acceso electrónico | eBook.14032083 |
This book presents novel and original metaheuristics developed to solve the cost-balanced traveling salesman problem. This problem was taken into account for the Metaheuristics Competition proposed in MESS 2018, Metaheuristics Summer School, and the top 4 methodologies ranked are included in the book, together with a brief introduction to the traveling salesman problem and all its variants. The book is aimed particularly at all researchers in metaheuristics and combinatorial optimization areas. Key uses are metaheuristics; complex problem solving; combinatorial optimization; traveling salesman problem.
There are no comments on this title.