Logic‐Based Methods for Optimization
John Hooker · Wiley eBooks · 2000
This tutorial describes a logic-based approach to formulating and solving pure and mixed integer programming problems. It develops logical counterparts for ideas associated with traditional branch-and-cut methods, such as cutting planes, facet-defining cuts, relaxations, etc. The motivations for doing this are a) to exploit the structure of a wide range of problems that are too complex for polyhedral analysis, b) to take advantage of logic processing techniques developed for constraint programming and logic programming, and c) to provide a unified approach to solving the growing number of problems with both qualitative and quantitative elements
Cited by 292 works. doi:10.1002/9781118033036
Authors
References
- Integer and Combinatorial Optimization
- Foundations of Logic Programming
- Integer and Combinatorial Optimization
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- Constraint satisfaction in logic programming
- Boolean Methods in Operations Research and Related Areas
- INTEGER AND COMBINATORIAL OPTIMIZATION
- Edmonds polytopes and a hierarchy of combinatorial problems
- Partial constraint satisfaction
- Programming with Constraints