Handbook of Approximation Algorithms and Metaheuristics: Contemporary and Emerging Applications, Volume 2
- ISBN-10
- 1351235419
- ISBN-13
- 9781351235419
- Series
- Handbook of Approximation Algorithms and Metaheuristics
- Category
- Computers
- Pages
- 780
- Language
- English
- Published
- 2018-05-15
- Publisher
- CRC Press
- Author
- Teofilo F. Gonzalez
Description
Handbook of Approximation Algorithms and Metaheuristics, Second Edition reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics. Volume 1 of this two-volume set deals primarily with methodologies and traditional applications. It includes restriction, relaxation, local ratio, approximation schemes, randomization, tabu search, evolutionary computation, local search, neural networks, and other metaheuristics. It also explores multi-objective optimization, reoptimization, sensitivity analysis, and stability. Traditional applications covered include: bin packing, multi-dimensional packing, Steiner trees, traveling salesperson, scheduling, and related problems. Volume 2 focuses on the contemporary and emerging applications of methodologies to problems in combinatorial optimization, computational geometry and graphs problems, as well as in large-scale and emerging application areas. It includes approximation algorithms and heuristics for clustering, networks (sensor and wireless), communication, bioinformatics search, streams, virtual communities, and more. About the Editor Teofilo F. Gonzalez is a professor emeritus of computer science at the University of California, Santa Barbara. He completed his Ph.D. in 1975 from the University of Minnesota. He taught at the University of Oklahoma, the Pennsylvania State University, and the University of Texas at Dallas, before joining the UCSB computer science faculty in 1984. He spent sabbatical leaves at the Monterrey Institute of Technology and Higher Education and Utrecht University. He is known for his highly cited pioneering research in the hardness of approximation; for his sublinear and best possible approximation algorithm for k-tMM clustering; for introducing the open-shop scheduling problem as well as algorithms for its solution that have found applications in numerous research areas; as well as for his research on problems in the areas of job scheduling, graph algorithms, computational geometry, message communication, wire routing, etc.
Get the book
Other editions
-
- 2018-05-15
- 798 pages
- Paperback
- CRC Press
-
- 2018-05-15
- 726 pages
- Paperback
- CRC Press
-
- 2018-05-15
- 798 pages
- Ebook
- CRC Press
Similar books
-
Handbook of Approximation Algorithms and Metaheuristics, Second Edition: Two-Volume Set
By Teofilo F. GonzalezThrough contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics.
-
Handbook of Approximation Algorithms and Metaheuristics, Second Edition: Two-Volume Set
By Teofilo F. GonzalezThis handbook reflects the tremendous growth in the field, over the past two decades.
-
Handbook of Metaheuristic Algorithms: From Fundamental Theories to Advanced Applications
By Chun-Wei Tsai, Ming-Chao ChiangThis book can also help students and researchers construct an integrated perspective of metaheuristic and unsupervised algorithms for artificial intelligence research in computer science and applied engineering domains.
-
Combinatorial Optimization: Theory and Algorithms
By Bernhard Korte, Jens VygenThus this book represents the state of the art of combinatorial optimization. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years.
-
The Design of Approximation Algorithms
By David P. Williamson, David B. ShmoysYet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions.
-
Handbook of AI-based Metaheuristics
By Anand J. Kulkarni, Patrick Siarry... suit is excluded by the proposers due to its unstable behavior . We optimized these functions of four dimensions D ( 10D , 30D , 50D , and 100D ) . The initial populations are generated uniformly random in the search space . All ...
-
Handbook of Combinatorial Optimization: Supplement Volume B
By Panos M. Pardalos, Ding-Zhu DuThis is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set. It can also be regarded as a stand-alone volume presenting chapters dealing with various aspects of the subject in a self-contained way.
-
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
By Juraj HromkovičThis is the first book to systematically explain and compare all the main possibilities of attacking hard computing problems.
-
Approximation Algorithms for Combinatorial Optimization: Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings
By Klaus Jansen, Samir KhullerThis book constitutes the refereed proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2000, held in Saarbrcken, Germany in September 2000.
-
Design and Analysis of Approximation Algorithms
By Ding-Zhu Du, Ker-I Ko, Xiaodong HuThis book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms.