Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 102,34
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 111,50
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 112,79
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 107,17
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 107,16
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 112,93
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 122,11
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. New copy - Usually dispatched within 4 working days.
Da: Majestic Books, Hounslow, Regno Unito
EUR 138,55
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New.
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Prima edizione
EUR 136,36
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. 2024. 1st Edition. hardcover. . . . . .
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. 1st edition NO-PA16APR2015-KAP.
Da: Kennys Bookstore, Olney, MD, U.S.A.
EUR 174,54
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. 2024. 1st Edition. hardcover. . . . . . Books ship from the US and Ireland.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 146,39
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Neuware - Tackle the most challenging problems in science and engineering with these cutting-edge algorithms.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 128,16
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Lingua: Inglese
Editore: John Wiley & Sons Inc, New York, 2024
ISBN 10: 1394178417 ISBN 13: 9781394178414
Da: CitiRetail, Stevenage, Regno Unito
EUR 115,75
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: new. Hardcover. Tackle the most challenging problems in science and engineering with these cutting-edge algorithms Multi-objective optimization problems (MOPs) are those in which more than one objective needs to be optimized simultaneously. As a ubiquitous component of research and engineering projects, these problems are notoriously challenging. In recent years, evolutionary algorithms (EAs) have shown significant promise in their ability to solve MOPs, but challenges remain at the level of large-scale multi-objective optimization problems (LSMOPs), where the number of variables increases and the optimized solution is correspondingly harder to reach. Evolutionary Large-Scale Multi-Objective Optimization and Applications constitutes a systematic overview of EAs and their capacity to tackle LSMOPs. It offers an introduction to both the problem class and the algorithms before delving into some of the cutting-edge algorithms which have been specifically adapted to solving LSMOPs. Deeply engaged with specific applications and alert to the latest developments in the field, its a must-read for students and researchers facing these famously complex but crucial optimization problems. The books readers will also find: Analysis of multi-optimization problems in fields such as machine learning, network science, vehicle routing, and more Discussion of benchmark problems and performance indicators for LSMOPs Presentation of a new taxonomy of algorithms in the field Evolutionary Large-Scale Multi-Objective Optimization and Applications is ideal for advanced students, researchers, and scientists and engineers facing complex optimization problems. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.