Integrated Methods for Optimization

This tutorial describes a logicbased approach to formulating and solving pure and mixed integer programming problems It develops logical counterparts for ideas associated with traditional branchandcut methods such as cutting planes facetde ning cuts re laxations 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 uni ed approach to solving the growing number of problems with both qualitative and quantitative elements The operations research community has traditionally regarded integer programming as linear programming with integrality constraints This view is so well established that it seems od