Logic-Based 0–1 Constraint Programming (1996) (Operations Research/Computer Science Interfaces Series #5)

By:

Sign Up Now! Already a Member? Log In
You must be logged into UK education collection to access this title. Learn about membership options, or view our freely available titles.

Synopsis
A logic view of 0-1 integer programming problems, providing new insights into the structure of problems that can lead the researcher to more effective solution techniques depending on the problem class. Operations research techniques are integrated into a logic programming environment. The first monographic treatment that begins to unify these two methodological approaches. Logic-based methods for modelling and solving combinatorial problems have recently started to play a significant role in both theory and practice. The application of logic to combinatorial problems has a dual aspect. On one hand, constraint logic programming allows one to declaratively model combinatorial problems over an appropriate constraint domain, the problems then being solved by a corresponding constraint solver. Besides being a high-level declarative interface to the constraint solver, the logic programming language allows one also to implement those subproblems that cannot be naturally expressed with constraints. On the other hand, logic-based methods can be used as a constraint solving technique within a constraint solver for combinatorial problems modelled as 0-1 integer programs.
Copyright:
1996

Book Details

Book Quality:
Publisher Quality
ISBN-13:
9781461313151
Related ISBNs:
9780792396635
Publisher:
Springer US
Date of Addition:
Copyrighted By:
N/A
Adult content:
No
Language:
English
Has Image Descriptions:
No
Categories:
Nonfiction, Computers and Internet, Business and Finance, Mathematics and Statistics
Submitted By:
Bookshare Staff
Usage Restrictions:
This is a copyrighted book.

Reviews

No Rating Yet