logo
Product categories

EbookNice.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link.  https://ebooknice.com/page/post?id=faq


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookNice Team

(Ebook) Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall CRC Computer & Information Science Series) by Teofilo F. Gonzalez ISBN 1584885505

  • SKU: EBN-2205306
Zoomable Image
$ 32 $ 40 (-20%)

Status:

Available

4.7

11 reviews
Instant download (eBook) Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall CRC Computer & Information Science Series) after payment.
Authors:Teofilo F. Gonzalez
Pages:1351 pages.
Year:2007
Editon:1
Publisher:Chapman and Hall/CRC
Language:english
File Size:14.1 MB
Format:pdf
ISBNS:1584885505
Categories: Ebooks

Product desciption

(Ebook) Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall CRC Computer & Information Science Series) by Teofilo F. Gonzalez ISBN 1584885505

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.
*Free conversion of into popular formats such as PDF, DOCX, DOC, AZW, EPUB, and MOBI after payment.

Related Products