Optimization and computational logic
Author(s)
Bibliographic Information
Optimization and computational logic
(Wiley-Interscience series in discrete mathematics and optimization)
Wiley, c1996
Available at 24 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
"A Wiley-Interscience publication"
Includes bibliographical references and index
Description and Table of Contents
Description
Part of the Wiley-interscience series in discrete mathematics and optimization, this title is suitable for undergraduates and graduates in AI, modelling languages, logic and linear programming, management science and decision support software development.
Table of Contents
- Constraints and Optimization
- Loop Constructs
- Structured Linear Programming
- Conjunction and Implication
- Conditional Disjunction
- Negation
- Sensitivity Analysis
- Backtracking
- Classical Disjunction and Combinatorially Hard Problems
- Soundness and Completeness
- Depth-First Branch-and-Bound Search
- The Injury Method
- Tightening the Linear Relaxation
- Further Search Methods
- Mathematical Underpinnings
- Getting Started
- References
- List of Models
- Indexes.
by "Nielsen BookData"