Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
$190.00
Used and New from Other Sellers
Used and New from Other Sellers
from $72.00
Usually ships in 1-2 business days
(Save 64%)
Other sellers (Hardcover)
  • All (11) from $72.00   
  • New (4) from $164.08   
  • Used (7) from $72.00   

Overview

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

Read More Show Less

Editorial Reviews

From the Publisher
"This is a book that should be widely read by graduate students and researchers in both the computer science and optimization communities." (Choice, Vol. 38, No. 7, March 2001)

"Goal is to broaden the conceptual foundations of optimization to include logical and constraint based approaches to traditional optimization methods." (American Mathematical Monthly, November 2001)

"The author combines a low-key, often conversational presentation with enthusiasm for a synthesis with traditional optimization methods..." (SIAM Review, Vol. 43, No. 4)

"The book is for practitioners as well as theorists" (Zentralblatt Math, Vol.974, No.24, 2001)

Choice
This is a book that should be widely read by graduate students and researchers in both the computer science and optimization communities.
Choice
This is a book that should be widely read by graduate students and researchers in both the computer science and optimization communities.
Booknews
Well known for his work at the interface between operations research and computer science, Hooker (operations research and business ethics and social responsibility, Carnegie Mellon U.) here develops a 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 solutions techniques. He strives to be accessible to both industry professionals and academics, and provides examples techniques and modeling frameworks ready for implementation. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

Meet the Author

JOHN HOOKER, PhD, is Professor of Operations Research and T. Jerome Holleran Professor of Business Ethics and Social Responsibility at the Graduate School of Industrial Administration, Carnegie Mellon University. Well-known for his work in the operations research/computer science interface, Dr. Hooker has published over 80 articles and coauthored (with Vijay Chandru) Optimization Methods for Logical Inference, also available from Wiley.

Read More Show Less

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.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)