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.
"synopsis" may belong to another edition of this title.
`I highly recommend this book for colleagues versed in simulated annealing, particularly those who lean toward theory.'
D. Greening, Computer Reviews, June 1990
"About this title" may belong to another edition of this title.
£ 6.84 shipping from France to United Kingdom
Destination, rates & speedsSeller: Ammareal, Morangis, France
Hardcover. Condition: Très bon. Ancien livre de bibliothèque avec équipements. Edition 1989. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1989. Ammareal gives back up to 15% of this item's net price to charity organizations. Seller Inventory # G-128-613
Quantity: 1 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9780792390220_new
Quantity: Over 20 available
Seller: moluna, Greven, Germany
Gebunden. Condition: New. 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 . Seller Inventory # 458443256
Quantity: Over 20 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Feb2416190185583
Quantity: Over 20 available
Seller: Mispah books, Redhill, SURRE, United Kingdom
Hardcover. Condition: Like New. Like New. book. Seller Inventory # ERICA77307923902296
Quantity: 1 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 216. Seller Inventory # 263093894
Quantity: 4 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 216 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Seller Inventory # 5802585
Quantity: 4 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 216. Seller Inventory # 183093900
Quantity: 4 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Buch. Condition: Neu. Neuware - 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. Seller Inventory # 9780792390220
Quantity: 2 available