Join Books.org — it's free

Constraint-Based Local Search by Pascal Van Hentenryck β€” book cover
Computer Programming, Engineering - General & Miscellaneous, Robotics & Artificial Intelligence, Applications & Software, Artificial Intelligence (AI), Mathematics, Mathematics, Robotics & Artificial Intelligence, Engineering - General & Miscellaneous

Constraint-Based Local Search

by Pascal Van Hentenryck, Laurent Michel
Write a review
Log in to track your reading progress.

Overview

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.

Synopsis

Introducing a method for solving combinatorial optimization problems that combines the techniques of constraint programming and local search.

About the Author, Pascal Van Hentenryck

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.

Reviews

There are no reviews yet. Log in to write one.

Book Details

Published
September 1, 2009
Publisher
MIT Press
Pages
448
Format
Paperback
ISBN
9780262513487

More by Pascal Van Hentenryck

Similar books