Constraint-Based Local Search - The MIT Press (Paperback)
  • Constraint-Based Local Search - The MIT Press (Paperback)
zoom

Constraint-Based Local Search - The MIT Press (Paperback)

(author), (author)
£4.99
Paperback 448 Pages / Published: 21/08/2009
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
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.

Publisher: MIT Press Ltd
ISBN: 9780262513487
Number of pages: 448
Weight: 930 g
Dimensions: 229 x 203 x 22 mm

You may also be interested in...

Alan Turing: The Enigma Man
Added to basket
Networks: A Very Short Introduction
Added to basket
The Annotated Turing
Added to basket
Superintelligence
Added to basket
£18.99
Hardback
Rocket Surgery Made Easy
Added to basket
Dark Pools
Added to basket
£9.99
Paperback
Computing with Quantum Cats
Added to basket
The Elements of Statistical Learning
Added to basket
The Lego Architect
Added to basket
£20.99
Hardback
Fearless Genius
Added to basket
£25.00
Hardback
The Mythical Man-Month
Added to basket
Beginning Drupal 8
Added to basket
The Singularity Is Near
Added to basket
AQA A level Computer Science
Added to basket
Business Analysis Techniques
Added to basket
Programming Computer Vision with Python
Added to basket

Please sign in to write a review

Your review has been submitted successfully.