Parallel Combinatorial Optimization
Afbeeldingen
Sla de afbeeldingen overArtikel vergelijken
- Engels
- Hardcover
- 9780471721017
- 03 november 2006
- 352 pagina's
Samenvatting
Learn to solve complex problems with efficient parallel optimization algorithms
This text provides an excellent balance of theory and application that enables readers to deploy powerful algorithms, frameworks, and methodologies to solve complex optimization problems in a diverse range of industries. Each chapter is written by leading experts in the fields of parallel and distributed optimization. Collectively, the contributions serve as a complete reference to the field of combinatorial optimization, including details and findings of recent and ongoing investigations.
Readers learn to solve large-scale problems quickly and efficiently with the text's clear coverage of several parallel optimization algorithms:
- Exact algorithms, including branch and bound, dynamic programming, branch and cut, semidefinite programming, and constraint programming
- Metaheuristics, including local search, tabu search, simulated annealing, scatter search, GRASP, variable neighborhood search, ant colonies, genetic programming, evolution strategies, and genetic algorithms
- Hybrid approaches, combining exact algorithms and metaheuristics
- Multi-objective optimization algorithms
The text not only presents parallel algorithms and applications, but also software frameworks and libraries that integrate parallel algorithms for combinatorial optimization. Among the well-known parallel and distributed frameworks covered are COIN, ParadisEO, BOB++, MW, and SDPARA.
Numerous real-world examples of problems and solutions demonstrate how parallel combinatorial optimization is applied in such fields as telecommunications, logistics, genomics, networking, and transportation. Whether you are a practicing engineer, field researcher, or student, this text provides you with not only the theory of parallel combinatorial optimization, but the guidance and practical tools to solve complex problems using powerful algorithms.
This text provides an excellent balance of theory and application that enables you to deploy powerful algorithms, frameworks, and methodologies to solve complex optimization problems in a diverse range of industries. Each chapter is written by leading experts in the fields of parallel and distributed optimization. Collectively, the contributions serve as a complete reference to the field of combinatorial optimization, including details and findings of recent and ongoing investigations.
Productspecificaties
Inhoud
- Taal
- en
- Bindwijze
- Hardcover
- Oorspronkelijke releasedatum
- 03 november 2006
- Aantal pagina's
- 352
- Illustraties
- Nee
Betrokkenen
- Hoofdauteur
- E Talbi
- Hoofdredacteur
- El-Ghazali Talbi
- Hoofduitgeverij
- Wiley-Interscience
Vertaling
- Originele titel
- Parallel Combinatorial Optimization
Overige kenmerken
- Editie
- New title
- Extra groot lettertype
- Nee
- Product breedte
- 163 mm
- Product hoogte
- 23 mm
- Product lengte
- 244 mm
- Studieboek
- Nee
- Verpakking breedte
- 165 mm
- Verpakking hoogte
- 19 mm
- Verpakking lengte
- 241 mm
- Verpakkingsgewicht
- 612 g
EAN
- EAN
- 9780471721017
Je vindt dit artikel in
- Categorieën
- Taal
- Engels
- Beschikbaarheid
- Leverbaar
- Boek, ebook of luisterboek?
- Boek
- Studieboek of algemeen
- Algemene boeken
Kies gewenste uitvoering
Prijsinformatie en bestellen
De prijs van dit product is 138 euro en 99 cent.- Prijs inclusief verzendkosten, verstuurd door bol
- Ophalen bij een bol afhaalpunt mogelijk
- 30 dagen bedenktijd en gratis retourneren
- Dag en nacht klantenservice
Anderen bekeken ook
Rapporteer dit artikel
Je wilt melding doen van illegale inhoud over dit artikel:
- Ik wil melding doen als klant
- Ik wil melding doen als autoriteit of trusted flagger
- Ik wil melding doen als partner
- Ik wil melding doen als merkhouder
Geen klant, autoriteit, trusted flagger, merkhouder of partner? Gebruik dan onderstaande link om melding te doen.