FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

Annealing Algorithm

R.H.J.M. Otten, L.P.P.P. van Ginneken
    Product form
      FORMAT: Hardback

      R 4,639.75 Price and availability exclusive to website

      YOU COULD EARN 4,639.75 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 773.29 per month!
      3x monthly payments of R 1,546.58 with
      4x fortnightly payments of R 1,159.93 with
      The goal of the research out of which this monograph grew, was to make annealing as much as possible a general purpose optimization routine. At first glance this may seem a straight-forward task, for the formulation of its concept suggests applicability to any combinatorial optimization problem. All that is needed to run annealing on such a problem is a unique representation for each configuration, a procedure for measuring its quality, and a neighbor relation. Much more is needed however for obtaining acceptable results consistently in a reasonably short time. It is even doubtful whether the problem can be formulated such that annealing becomes an adequate approach for all instances of an optimization problem. Questions such as what is the best formulation for a given instance, and how should the process be controlled, have to be answered. Although much progress has been made in the years after the introduction of the concept into the field of combinatorial optimization in 1981, some important questions still do not have a definitive answer. In this book the reader will find the foundations of annealing in a self-contained and consistent presentation. Although the physical analogue from which the con­ cept emanated is mentioned in the first chapter, all theory is developed within the framework of markov chains. To achieve a high degree of instance independence adaptive strategies are introduced.
      Format: CONTRIBUTORS: R.H.J.M. Otten, L.P.P.P. van Ginneken EAN: 9780792390220 COUNTRY: Netherlands PAGES: WEIGHT: 1060 g HEIGHT: 235 cm
      PUBLISHED BY: Springer DATE PUBLISHED: 1989-06-30 CITY: GENRE: COMPUTERS / Design, Graphics & Media / CAD-CAM, MATHEMATICS / Combinatorics, TECHNOLOGY & ENGINEERING / Electrical WIDTH: 155 cm SPINE:

      Book Themes:

      Discrete mathematics, Electrical engineering, Computer-aided design (CAD)

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      The goal of the research out of which this monograph grew, was to make annealing as much as possible a general purpose optimization routine. At first glance this may seem a straight-forward task, for the formulation of its concept suggests applicability to any combinatorial optimization problem. All that is needed to run annealing on such a problem is a unique representation for each configuration, a procedure for measuring its quality, and a neighbor relation. Much more is needed however for obtaining acceptable results consistently in a reasonably short time. It is even doubtful whether the problem can be formulated such that annealing becomes an adequate approach for all instances of an optimization problem. Questions such as what is the best formulation for a given instance, and how should the process be controlled, have to be answered. Although much progress has been made in the years after the introduction of the concept into the field of combinatorial optimization in 1981, some important questions still do not have a definitive answer. In this book the reader will find the foundations of annealing in a self-contained and consistent presentation. Although the physical analogue from which the con­ cept emanated is mentioned in the first chapter, all theory is developed within the framework of markov chains. To achieve a high degree of instance independence adaptive strategies are introduced.
      Format: CONTRIBUTORS: R.H.J.M. Otten, L.P.P.P. van Ginneken EAN: 9780792390220 COUNTRY: Netherlands PAGES: WEIGHT: 1060 g HEIGHT: 235 cm
      PUBLISHED BY: Springer DATE PUBLISHED: 1989-06-30 CITY: GENRE: COMPUTERS / Design, Graphics & Media / CAD-CAM, MATHEMATICS / Combinatorics, TECHNOLOGY & ENGINEERING / Electrical WIDTH: 155 cm SPINE:

      Book Themes:

      Discrete mathematics, Electrical engineering, Computer-aided design (CAD)

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account