2 options
Handbook of approximation algorithms and metaheurististics / edited by Teofilo F. Gonzalez.
Table of contents only Available online
View onlineLIBRA QA76.9.A43 H36 2007
Available from offsite location
- Format:
- Book
- Series:
- Chapman & Hall/CRC computer and information science series
- Language:
- English
- Subjects (All):
- Computer algorithms.
- Mathematical optimization.
- Physical Description:
- 1 volume (various pagings) : illustrations ; 27 cm.
- Place of Publication:
- Boca Raton : Chapman & Hall/CRC, [2007]
- Summary:
- The first book to comprehensively study both approximation algorithms and metaheuristics, this resource 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 handbook 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.
- Notes:
- Includes bibliographical references and index.
- Local Notes:
- Acquired for the Penn Libraries with assistance from the Alumni and Friends Memorial Book Fund.
- ISBN:
- 9781584885504
- 1584885505
- OCLC:
- 80020082
- Online:
- Publisher description
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.