• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Logic-Based 0-1 Constraint Programming

Logic-Based 0-1 Constraint Programming

Hardcover

Series: Operations Research/Computer Science Interfaces, Book 5

Business GeneralGeneral ComputersGeneral Mathematics

ISBN10: 0792396634
ISBN13: 9780792396635
Publisher: Springer Nature
Published: Nov 30 1995
Pages: 254
Weight: 1.23
Height: 0.63 Width: 6.14 Depth: 9.21
Language: English
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.

1 different editions

Also available

Also in

General Mathematics