| Document Type
|
:
|
BL
|
| Record Number
|
:
|
844858
|
| Main Entry
|
:
|
Gonzalez, Teofilo F.
|
| Title & Author
|
:
|
Handbook of Approximation Algorithms and Metaheuristics, Second Edition : : Methologies and Traditional Applications, Volume 1.
|
| Edition Statement
|
:
|
2nd ed.
|
| Publication Statement
|
:
|
Milton :: Chapman and Hall/CRC,, 2018.
|
| Series Statement
|
:
|
Chapman and Hall/CRC Computer and Information Science Ser.
|
| Page. NO
|
:
|
1 online resource (817 pages)
|
| ISBN
|
:
|
1351236407
|
|
|
:
|
: 1351236415
|
|
|
:
|
: 9781351236409
|
|
|
:
|
: 9781351236416
|
|
|
:
|
1498770118
|
|
|
:
|
9781498770118
|
| Contents
|
:
|
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.
|
|
|
:
|
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.
|
|
|
:
|
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.
|
|
|
:
|
41: Linear Ordering Problem42: Submodular Functions Maximization Problems; Index.
|
|
|
:
|
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.
|
| Abstract
|
:
|
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. --
|
| Subject
|
:
|
Computer algorithms, Handbooks, manuals, etc.
|
| Subject
|
:
|
Heuristic algorithms-- Data processing, Handbooks, manuals, etc.
|
| Subject
|
:
|
Mathematical optimization, Handbooks, manuals, etc.
|
| Subject
|
:
|
Metaheuristics.
|
| Subject
|
:
|
Computer algorithms.
|
| Subject
|
:
|
Mathematical optimization.
|
| Subject
|
:
|
Metaheuristics.
|
| Dewey Classification
|
:
|
005.1
|
| LC Classification
|
:
|
QA76.9.A43.H36 2017
|