Librería: MyLibraryMarket, Waynesville, OH, Estados Unidos de America
EUR 44,38
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: As New. ***Please Read*** Cover shows very minor wear. Pristine pages. No marks on text - My shelf location - 54-D-14*.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 54,04
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 52,85
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 53,25
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 46,66
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 59,04
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 57,85
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 61,23
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Corner of a Foreign Field, Tokyo, TOKYO, Japon
EUR 53,25
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: New. No Jacket. 2005.Hardcover.New.Ships from Japan.Usually ships in 1-2 working days.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 61,19
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 304.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 65,68
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 65,68
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 64,19
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 58,54
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 58,54
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 60,88
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 76,38
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 71,97
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 302 pages. 9.26x6.10x0.69 inches. In Stock.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 66,40
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 68,06
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 68,42
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 87,43
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 287 pages. 9.50x6.25x1.00 inches. In Stock.
Idioma: Inglés
Publicado por Springer International Publishing, Springer International Publishing Okt 2023, 2023
ISBN 10: 3031137167 ISBN 13: 9783031137167
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 42,79
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware -This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the subject because it is very intuitive and its solutions can be graphically represented. The book features a wealth of illustrations that allow the concepts to be understood at a glance.The book approaches the main metaheuristics from a new angle, deconstructing them into a few key concepts presented in separate chapters: construction, improvement, decomposition, randomization and learning methods. Each metaheuristic can then be presented in simplified form as a combination of these concepts. This approach avoids giving the impression that metaheuristics is a non-formal discipline, a kind of cloud sculpture. Moreover, it provides concrete applications of the travelling salesman problem, whichillustrate in just a few lines of code how to design a new heuristic and remove all ambiguities left by a general framework. Two chapters reviewing the basics of combinatorial optimization and complexity theory make the book self-contained. As such, even readers with a very limited background in the field will be able to follow all the content.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 304 pp. Englisch.
Idioma: Inglés
Publicado por Springer International Publishing, Springer International Publishing, 2023
ISBN 10: 3031137167 ISBN 13: 9783031137167
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 42,79
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the subject because it is very intuitive and its solutions can be graphically represented. The book features a wealth of illustrations that allow the concepts to be understood at a glance. The book approaches the main metaheuristics from a new angle, deconstructing them into a few key concepts presented in separate chapters: construction, improvement, decomposition, randomization and learning methods. Each metaheuristic can then be presented in simplified form as a combination of these concepts. This approach avoids giving the impression that metaheuristics is a non-formal discipline, a kind of cloud sculpture. Moreover, it provides concrete applications of the travelling salesman problem, whichillustrate in just a few lines of code how to design a new heuristic and remove all ambiguities left by a general framework. Two chapters reviewing the basics of combinatorial optimization and complexity theory make the book self-contained. As such, even readers with a very limited background in the field will be able to follow all the content.
Idioma: Inglés
Publicado por Springer International Publishing, Springer International Publishing, 2022
ISBN 10: 3031137132 ISBN 13: 9783031137136
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the subject because it is very intuitive and its solutions can be graphically represented. The book features a wealth of illustrations that allow the concepts to be understood at a glance. The book approaches the main metaheuristics from a new angle, deconstructing them into a few key concepts presented in separate chapters: construction, improvement, decomposition, randomization and learning methods. Each metaheuristic can then be presented in simplified form as a combination of these concepts. This approach avoids giving the impression that metaheuristics is a non-formal discipline, a kind of cloud sculpture. Moreover, it provides concrete applications of the travelling salesman problem, whichillustrate in just a few lines of code how to design a new heuristic and remove all ambiguities left by a general framework. Two chapters reviewing the basics of combinatorial optimization and complexity theory make the book self-contained. As such, even readers with a very limited background in the field will be able to follow all the content.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 112,36
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 59,95
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 304.
Idioma: Inglés
Publicado por Springer International Publishing Okt 2023, 2023
ISBN 10: 3031137167 ISBN 13: 9783031137167
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 42,79
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the subject because it is very intuitive and its solutions can be graphically represented. The book features a wealth of illustrations that allow the concepts to be understood at a glance. The book approaches the main metaheuristics from a new angle, deconstructing them into a few key concepts presented in separate chapters: construction, improvement, decomposition, randomization and learning methods. Each metaheuristic can then be presented in simplified form as a combination of these concepts. This approach avoids giving the impression that metaheuristics is a non-formal discipline, a kind of cloud sculpture. Moreover, it provides concrete applications of the travelling salesman problem, which illustrate in just a few lines of code how to design a new heuristic and remove all ambiguities left by a general framework. Two chapters reviewing the basics of combinatorial optimization and complexity theory make the book self-contained. As such, even readers with a very limited background in the field will be able to follow all the content. 304 pp. Englisch.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 60,90
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 304.
Idioma: Inglés
Publicado por Springer International Publishing Okt 2022, 2022
ISBN 10: 3031137132 ISBN 13: 9783031137136
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 53,49
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the subject because it is very intuitive and its solutions can be graphically represented. The book features a wealth of illustrations that allow the concepts to be understood at a glance. The book approaches the main metaheuristics from a new angle, deconstructing them into a few key concepts presented in separate chapters: construction, improvement, decomposition, randomization and learning methods. Each metaheuristic can then be presented in simplified form as a combination of these concepts. This approach avoids giving the impression that metaheuristics is a non-formal discipline, a kind of cloud sculpture. Moreover, it provides concrete applications of the travelling salesman problem, which illustrate in just a few lines of code how to design a new heuristic and remove all ambiguities left by a general framework. Two chapters reviewing the basics of combinatorial optimization and complexity theory make the book self-contained. As such, even readers with a very limited background in the field will be able to follow all the content. 304 pp. Englisch.