Logic-based methods for optimization : combining optimization and constraint satisfaction
Author(s)
Bibliographic Information
Logic-based methods for optimization : combining optimization and constraint satisfaction
(Wiley-Interscience series in discrete mathematics and optimization)
John Wiley & Sons, c2000
Available at 28 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. 463-481) and index
Description and Table of Contents
Description
A pioneering look at the fundamental role of logic in optimization and constraint satisfaction
While recent efforts to combine optimization and constraint satisfaction have received considerable attention, little has been said about using logic in optimization as the key to unifying the two fields. Logic-Based Methods for Optimization develops for the first time a comprehensive conceptual framework for integrating optimization and constraint satisfaction, then goes a step further and shows how extending logical inference to optimization allows for more powerful as well as flexible modeling and solution techniques. Designed to be easily accessible to industry professionals and academics in both operations research and artificial intelligence, the book provides a wealth of examples as well as elegant techniques and modeling frameworks ready for implementation. Timely, original, and thought-provoking, Logic-Based Methods for Optimization:
* Demonstrates the advantages of combining the techniques in problem solving
* Offers tutorials in constraint satisfaction/constraint programming and logical inference
* Clearly explains such concepts as relaxation, cutting planes, nonserial dynamic programming, and Bender's decomposition
* Reviews the necessary technologies for software developers seeking to combine the two techniques
* Features extensive references to important computational studies
* And much more
Table of Contents
Some Examples.
The Logic of Propositions.
The Logic of Discrete Variables.
The Logic of 0-1 Inequalities.
Cardinality Clauses.
Classical Boolean Methods.
Logic-Based Modeling.
Logic-Based Branch and Bound.
Constraint Generation.
Domain Reduction.
Constraint Programming.
Continuous Relaxations.
Decomposition Methods.
Branching Rules.
Relaxation Duality.
Inference Duality.
Search Strategies.
Logic-Based Benders Decomposition.
Nonserial Dynamic Programming.
Discrete Relaxations.
References.
Index.
by "Nielsen BookData"