Handbook of Approximation Algorithms and Metaheuristics. Dieser Artikel ist nicht verfügbar.
Sprache: Englisch
Verlag: CRC Press LLC, 2007
- Erstausgabe
- Hardcover
- Gebraucht
Anbieter: Better World Books, Mishawaka, IN, USABetter World Books
Verkäufer/-in mit 5 Sternen
Verkäufer:in bei AbeBooks seit 3. August 2006
Nicht verfügbar
Hardcover
Zustand: Gebraucht - Gut
EUR 33,23
Artikelbeschreibung des Verkäufers
Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
Bestandsnummer des Verkäufers 15302804-6
- Titel
- Handbook of Approximation Algorithms and Metaheuristics
- Verlag
- CRC Press LLC
- Erscheinungsjahr
- 2007
- Zustand
- Very Good
- Einband
- Hardcover
- Sprache
- Englisch
- ISBN-10
- 1584885505
- ISBN-13
- 9781584885504
- Auflage
- 1st Edition.
- Artikelgewicht
- 5,046 Pfund
- Abmessungen
- N/A
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical applications. It is the first book to comprehensively study both approximation algorithms and metaheuristics.
Starting with basic approaches, the handbook presents the methodologies to design and analyze efficient approximation algorithms for a large class of problems, and to establish inapproximability results for another class of problems. It also discusses local search, neural networks, and metaheuristics, as well as multiobjective problems, sensitivity analysis, and stability. After laying this foundation, the book applies the methodologies to classical problems in combinatorial optimization, computational geometry, and graph problems. In addition, it explores large-scale and emerging applications in networks, bioinformatics, VLSI, game theory, and data analysis.
Undoubtedly sparking further developments in the field, this handbook provides the essential techniques to apply approximation algorithms and metaheuristics to a wide range of problems in computer science, operations research, computer engineering, and economics. Armed with this information, researchers can design and analyze efficient algorithms to generate near-optimal solutions for a wide range of computational intractable problems.
Starting with basic approaches, the handbook presents the methodologies to design and analyze efficient approximation algorithms for a large class of problems, and to establish inapproximability results for another class of problems. It also discusses local search, neural networks, and metaheuristics, as well as multiobjective problems, sensitivity analysis, and stability. After laying this foundation, the book applies the methodologies to classical problems in combinatorial optimization, computational geometry, and graph problems. In addition, it explores large-scale and emerging applications in networks, bioinformatics, VLSI, game theory, and data analysis.
Undoubtedly sparking further developments in the field, this handbook provides the essential techniques to apply approximation algorithms and metaheuristics to a wide range of problems in computer science, operations research, computer engineering, and economics. Armed with this information, researchers can design and analyze efficient algorithms to generate near-optimal solutions for a wide range of computational intractable problems.
„Inhaltsangabe“ gehört möglicherweise zu einer anderen Auflage dieses Titels.
Über die Autorin bzw. den Autor
University of California, Santa Barbara, USA
„Über diesen Titel“ gehört möglicherweise zu einer anderen Auflage dieses Titels.