Computers & Internet Books:

Constraint-Based Local Search

Sorry, this product is not currently available to order

Here are some other products you might consider...

Constraint-Based Local Search

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Format:

Paperback / softback
Unavailable
Sorry, this product is not currently available to order

Description

Introducing a method for solving combinatorial optimization problems that combines the techniques of constraint programming and local search. The ubiquity of combinatorial optimization problems in our society is illustrated by the novel application areas for optimization technology, which range from supply chain management to sports tournament scheduling. Over the last two decades, constraint programming has emerged as a fundamental methodology to solve a variety of combinatorial problems, and rich constraint programming languages have been developed for expressing and combining constraints and specifying search procedures at a high level of abstraction. Local search approaches to combinatorial optimization are able to isolate optimal or near-optimal solutions within reasonable time constraints. This book introduces a method for solving combinatorial optimization problems that combines constraint programming and local search, using constraints to describe and control local search, and a programming language, COMET, that supports both modeling and search abstractions in the spirit of constraint programming. After an overview of local search including neighborhoods, heuristics, and metaheuristics, the book presents the architecture and modeling and search components of constraint-based local search and describes how constraint-based local search is supported in COMET. The book describes a variety of applications, arranged by meta-heuristics. It presents scheduling applications, along with the background necessary to understand these challenging problems. The book also includes a number of satisfiability problems, illustrating the ability of constraint-based local search approaches to cope with both satisfiability and optimization problems in a uniform fashion.

Author Biography

Pascal Van Hentenryck is Professor in the Department of Computer Science at Brown University. He is the author or editor of several MIT Press books. Laurent Michel is Assistant Professor in the Department of Computer Science and Engineering at the University of Connecticut.
Release date Australia
August 21st, 2009
Audience
  • Professional & Vocational
Country of Publication
United States
Illustrations
102 illus.; 102 Illustrations, unspecified
Imprint
MIT Press
Pages
448
Publisher
MIT Press Ltd
Dimensions
203x229x22
ISBN-13
9780262513487
Product ID
3224244

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

Filed under...