Handbook of Approximation Algorithms and Metaheuristics, Second Edition :
General Material Designation
[Book]
Other Title Information
Methologies and Traditional Applications, Volume 1.
EDITION STATEMENT
Edition Statement
2nd ed.
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
Milton :
Name of Publisher, Distributor, etc.
Chapman and Hall/CRC,
Date of Publication, Distribution, etc.
2018.
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
1 online resource (817 pages)
SERIES
Series Title
Chapman and Hall/CRC Computer and Information Science Ser.
CONTENTS NOTE
Text of Note
Cover; Half Title; Title Page; Copyright Page; Dedication; Table of Contents; Preface; Contributors; 1: Introduction, Overview, and Notation; SECTION I: Basic Methodologies; 2: Basic Methodologies and Applications; 3: Restriction Methods; 4: Greedy Methods; 5: Recursive Greedy Methods; 6: Local Ratio; 7: LP Rounding and Extensions; 8: Polynomial Time Approximation Schemes; 9: Rounding, Interval Partitioning and Separation; 10: Asymptotic Polynomial Time Approximation Schemes; 11: Randomized Approximation Techniques; 12: Distributed Approximation Algorithms via LP-Duality and Randomization.
Text of Note
13: Empirical Analysis of Randomised Algorithms14: Reductions That Preserve Approximability; 15: Differential Ratio Approximation; SECTION II: Local Search, Neural Networks, and Metaheuristics; 16: Local Search; 17: Stochastic Local Search; 18: Very Large-Scale Neighborhood Search: Theory, Algorithms, and Applications; 19: Reactive Search: Machine Learning for Memory-Based Heuristics; 20: Neural Networks; 21: Principles and Strategies of Tabu Search; 22: Evolutionary Computation; 23: An Introduction to Ant Colony Optimization.
Text of Note
32: Practical Algorithms for Two-Dimensional Packing of Rectangles33: Practical Algorithms for Two-Dimensional Packing of General Shapes; 34: Prize Collecting Traveling Salesman and Related Problem; 35: A Development and Deployment Framework for Distributed Branch-and-Bound; 36: Approximations for Steiner Minimum Trees; 37: Practical Approximations of Steiner Trees in Uniform Orientation Metrics; 38: Algorithms for Chromatic Sums, Multicoloring, and Scheduling Dependent Jobs; 39: Approximation Algorithms and Heuristics for Classical Planning; 40: Generalized Assignment Problem.
Text of Note
41: Linear Ordering Problem42: Submodular Functions Maximization Problems; Index.
Text of Note
SECTION III: Multiobjective Optimization, Sensitivity Analysis, and Stability24: Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: A Review; 25: Reoptimization of Hard Optimization Problems; 26: Sensitivity Analysis in Combinatorial Optimization; 27: Stability of Approximation; SECTION IV: Traditional Applications; 28: Performance Guarantees for One Dimensional Bin Packing; 29: Variants of Classical One Dimensional Bin Packing; 30: Variable Sized Bin Packing and Bin Covering; 31: Multidimensional Packing Problems.
0
8
8
8
8
SUMMARY OR ABSTRACT
Text of Note
Through contributions from leading experts, this book provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics. --
ACQUISITION INFORMATION NOTE
Source for Acquisition/Subscription Address
Ingram Content Group
Stock Number
9781351236409
OTHER EDITION IN ANOTHER MEDIUM
Title
Handbook of Approximation Algorithms and Metaheuristics, Second Edition : Methologies and Traditional Applications, Volume 1.
International Standard Book Number
9781498770118
TOPICAL NAME USED AS SUBJECT
Computer algorithms, Handbooks, manuals, etc.
Heuristic algorithms-- Data processing, Handbooks, manuals, etc.
Mathematical optimization, Handbooks, manuals, etc.