Modern Heuristic Techniques For Combinatorial Problems
Published on 10. November 1995
Book
Paperback/Softback
320 pages
978-0-07-709239-9 (ISBN)
Description
This introductory text describes types of heuristic procedures for solving large combinatorial problems. Some of the techniques covered include simulated annealing and tabu search, Lagrangian relaxation, genetic algorithms and artificial neural networks.
More details
Edition
New edition
Language
English
Place of publication
London
United Kingdom
Publishing group
McGraw-Hill Education - Europe
Target group
College/higher education
Edition type
New edition
Illustrations
illustrations
Dimensions
Height: 0 mm
Width: 0 mm
Thickness: 0 mm
Weight
482 gr
ISBN-13
978-0-07-709239-9 (9780077092399)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Content
Introduction: Combinatorial Problems. Local and Global Optima. Heuristics. Simulated Annealing: Basic Method. Enhancements and Modifications. Applications. Tabu Search: Framework. Broader Aspects of Intensification and Diversification. Tabu Search Applications. Connections. Genetic Algorithms: Basic Concepts; Simple Example. Extensions and Modifications. Applications. Artificial Neural Networks: Neural Networks. Combinatorial Optimisation Problems. Graph Bisection Problem. Graph Partition Problem. The Travelling Salesman Problem. Scheduling Problems. Deformable Templates. Inequality Constraints. Lagrangian Relaxation: Basic Methodology. Lagrangian Heuristics and Problem Reduction. Determination of Legrange Multipliers. Dual Ascent. Tree Search. Application. Evaluation Of Heuristic Performance: Analytical Methods. Empirical Testing. Statistical Inference.