Local search in combinatorial optimization

Local search in combinatorial optimization

by Aarts, E. H. L., (Emile Hubertus Leonardus) Lenstra, J. K.

Type Book
Rate 0.0 /5

In the past three decades local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in a reasonable time. This area of discrete mathematics is of great practical use and is attracting ever increasing attention. The contributions to this book cover local search and its variant…

Read More ↓
Details
Files
Reviews
Download

Title Statements

  • Full title :Local search in combinatorial optimization / edited by Emile Aarts and Jan Karel Lenstra.

Summary

In the past three decades local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in a reasonable time. This area of discrete mathematics is of great practical use and is attracting ever increasing attention. The contributions to this book cover local search and its variants from both a theoretical and practical point of view, each with a chapter written by leading authorities on that particular aspect.

This book is an important reference volume and an invaluable source of inspiration for advanced students and researchers in discrete mathematics, computer science, operations research, industrial engineering and management science.

Read More ↓

Edition Statements

  • Publication Date:©1997.

Publication Statements

  • Publisher(s):Wiley
  • Place of Publication:Chichester [England]
  • Language:eng
  • Publication Date:©1997.

Notes

"A Wiley-Interscience publication."

The Physical Object

  • Description:x, 512 pages : : illustrations ; : 25 cm

Edition Identifiers

  • ISBN:0471948225, 9780471948223
  • oclc:ocm35249568
  • LC Classification:T57.88
  • Dewey Decimal:519.7

Table of Contents

Computional complexity / Mihalis Yannakakis -- Local improvement on discrete structures / Craig A. Tovey -- Simulated annealing / Emile H.L. Aarts [and others] -- Tabu search / Alain Hertz, Eric Taillard, Dominique de Werra -- Genetic algorithms / Heinz Mühlenbein -- Artificial neural networks / Carsten Peterson, Bo Söderberg -- The traveling salesman problem : a case study / David S. Johnson, Lyle A. McGeoch -- Vehicle routing : modern heuristics / Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin -- Vehicle routing : handling edge exchanges / Gerard A.P. Kindervater, Martin W.P. Savelsberg -- Machine scheduling / Edward J. Anderson, Celia A. Glass, Chris N. Potts -- VLSI layout synthesis / Emile H.L. Aarts, Peter J.M. van Laarhoven, C.L. Liu, Peichen Pan -- Code design / Iiro S. Honkala, Patric R.J. Östergård.

Read More ↓

Subjects

Algorithmes ALGORITHMS Aufsatzsammlung Combinatieleer Combinatorial optimization Heuristic programming Heuristische Programmierung Inteligencia artificial Kombinatorische Optimierung Optimaliseren Optimisation combinatoire Programação matemática Programmation heuristique Zoekstrategieën

Writers

Aarts, E. H. L., (Emile Hubertus Leonar… Lenstra, J. K.

More from this Series

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

  • Local Search in Combinatorial Optimization -- (.r…

    RAR · 14.4 MB · updated
    Login →

  • Local Search in Combinatorial Optimization -- (.d…

    DJVU · 14.4 MB · updated
    Login →