Für diesen Artikel ist leider kein Bild verfügbar.

Modern Heuristic Techniques For Combinatorial Problems

(Autor)

Buch | Softcover
320 Seiten
1995 | New edition
McGraw-Hill Publishing Co. (Verlag)
978-0-07-709239-9 (ISBN)
48,60 inkl. MwSt
  • Titel ist leider vergriffen;
    keine Neuauflage
  • Artikel merken
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.

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.

Erscheint lt. Verlag 10.11.1995
Zusatzinfo illustrations
Verlagsort London
Sprache englisch
Gewicht 482 g
Themenwelt Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-07-709239-2 / 0077092392
ISBN-13 978-0-07-709239-9 / 9780077092399
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices

von Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger …

Buch | Softcover (2023)
De Gruyter (Verlag)
64,95