Overview
- Focuses on algorithmic applications of well known polynomially solvable special cases of computationally intractable problems
- Discusses design of practically efficient algorithms for solving wide classes of combinatorial optimization problems??
- Presents a new approach to study optimization problems both from theoretical and practical points of view
- Includes supplementary material: sn.pub/extras
- Includes supplementary material: sn.pub/extras
Part of the book series: SpringerBriefs in Optimization (BRIEFSOPTI)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (5 chapters)
Keywords
About this book
Reviews
“[The book] presents theoretical results on the structure of local and global maxima and indicates how these results can be used for adding horsepower to the DC approach…It should be mentioned that all central chapters of the book include experimental evaluations of the DC algorithms. The experimental results indicate that the DC approach is highly competitive to existing approaches, and often outperforms them. The book should be of great interest to theoreticians and to practitioners. On one hand, it presents strong structural results (in particular the ones about submodular functions in Chapter 2), on the other hand it does a great job in algorithm engineering. The DC approach seems to come very
close to a mature technology for (heuristically) solving a reasonably wide range of NP-hard combinatorial optimization problems."
—Hans-Ulrich Simon , Mathematical Reviews
Authors and Affiliations
Bibliographic Information
Book Title: Data Correcting Approaches in Combinatorial Optimization
Authors: Boris Goldengorin, Panos M. Pardalos
Series Title: SpringerBriefs in Optimization
DOI: https://doi.org/10.1007/978-1-4614-5286-7
Publisher: Springer New York, NY
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Boris Goldengorin, Panos M. Pardalos 2012
Softcover ISBN: 978-1-4614-5285-0Published: 11 October 2012
eBook ISBN: 978-1-4614-5286-7Published: 10 October 2012
Series ISSN: 2190-8354
Series E-ISSN: 2191-575X
Edition Number: 1
Number of Pages: X, 114
Number of Illustrations: 41 b/w illustrations
Topics: Graph Theory, Optimization, Data Structures, Algorithm Analysis and Problem Complexity, Algorithms