Abstract
Logic-based modeling can result in decision models that are more natural and easier to debug. The addition of logical constraints to mixed integer programming need not sacrifice computational speed and can even enhance it if the constraints are processed correctly. They should be written or automatically reformulated so as to be as nearly consistent or hyperarc consistent as possible. They should also be provided with a tight continuous relaxation. This chapter shows how to accomplish these goals for a number of logic-based constraints: formulas of propositional logic, cardinality formulas, 0–1 linear inequalities (viewed as logical formulas), cardinality rules, and mixed logical/linear constraints. It does the same for three global constraints that are popular in constraint programming systems: the all-different, element and cumulative constraints.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aggoun, A., and N. Beldiceanu, Extending CHIP in order to solve complex scheduling and placement problems, Mathematical and Computer Modelling 17 (1993) 57–73.
Balas, E., Disjunctive programming: Cutting planes from logical conditions, in O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, eds., Nonlinear Programming 2, Academic Press (New York, 1975), 279–312.
Balas, E., Disjunctive programming, Annals Discrete Mathematics 5 (1979): 3–51.
E. Balas, A. Bockmayr, N. Pisaruk and L. Wolsey, On unions and dominants of polytopes, manuscript, http://www.loria.fr/~bockmayr/dp2002-8.pdf, 2002.
Baptiste, P.; C. Le Pape, Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling, Proceedings, UK Planning and Scheduling Special Interest Group 1996 (PLANSIG96), Liverpool, 1996.
Baptiste, P., and C. Le Pape, Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Principles and Practice of Constraint Programming (CP 97), Springer-Verlag (Berlin, 1997) 375–89.
Baptiste, P.; C. Le Pape, Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems, Constraints 5 (2000) 119–39.
Barth, P., Logic-Based 0–1 Constraint Solving in Constraint Logic Programming, Kluwer (Dordrecht, 1995).
Beaumont, N., An algorithm for disjunctive programs, European Journal of Operational Research 48 (1990): 362–371.
Berge, C, Graphes et hypergraphes, Dunod (Paris, 1970).
Bockmayr, A., and J. N. Hooker, Constraint programming, in K. Aardal, G. Nemhauser and R. Weismantel, eds., Handbook of Discrete Optimization, North-Holland, to appear.
Chandru, V. and J. N. Hooker, Optimization Methods for Logical Inference, Wiley (New York, 1999).
Chvátal, V., Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Mathematics 4 (1973): 305–337.
Chvátal, V., and E. Szemeredi, Many hard examples for resolution, Journal of the ACM 2,5 (1988) 759–768.
Caseau, Y., and F. Laburthe, Cumulative scheduling with task intervals, Proceedings of the Joint International Conference and Symposium on Logic Programming, 1996.
Cornuejols, G., and M. Dawande, A class of hard small 0–1 programs, INFORMS Journal on Computing 11 (1999) 205–210.
Haken, A., The intractability of resolution, Theoretical Computer Science 39 (1985): 297–308.
S. Heipcke, Combined Modelling and Problem Solving in Mathematical Programming and Constraint Programming, PhD thesis, University of Buckingham, 1999.
Hooker, J. N., Generalized resolution and cutting planes, Annals of Operations Research 12 (1988): 217–239.
Hooker, J. N., Generalized resolution for 0–1 linear inequalities, Annals of Mathematics and Artificial Intelligence 6 (1992): 271–286.
Hooker, J. N., Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction, Wiley (New York, 2000).
Hooker, J. N., Logic, optimization and constraint programming, INFORMS Journal on Computing 14 (2002) 295–321.
Hooker, J. N., Logic-based Benders decomposition for planning and scheduling, manuscript, 2003.
Hooker, J. N., and Hong Yan, A relaxation of the cumulative constraint, Principles and Practice of Constraint Programming (CP02), Lecture Notes in Computer Science 2470, Springer (Berlin, 2002) 686–690.
Jeroslow, R. E., Logic-Based Decision Support: Mixed Integer Model Formulation, Annals of Discrete Mathematics 40. North-Holland (Amsterdam, 1989).
McKinnon, K. I. M., and H. P. Williams, Constructing integer programming models by the predicate calculus, Annals of Operations Research 21 (1989) 227–245.
Milano, M., ed., Constraint and Integer Programming: Toward a Unified Methodology, Kluwer (2003).
Mitra, G., C. Lucas, S. Moody, and E. Hadjiconstantinou, Tools for reformulating logical forms into zero-one mixed integer programs, European Journal of Operational Research 72 (1994) 262–276.
Nemhauser, G. L., and L. A. Wolsey, Integer and Combinatorial Optimization, Wiley (1999).
Nuijten, W. P. M., Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach, PhD Thesis, Eindhoven University of Technology, 1994.
Quine, W. V., The problem of simplifying truth functions, American Mathematical Monthly 59 (1952): 521–531.
Quine, W. V., A way to simplify truth functions, American Mathematical Monthly 62 (1955): 627–631.
Régin, J.-C, A filtering algorithm for constraints of difference in CSPs, Proceedings, National Conference on Artificial Intelligence (1994): 362–367.
Tseitin, G. S., On the complexity of derivations in the propositional calculus, in A. O. Slisenko, ed., Structures in Constructive Mathematics and Mathematical Logic, Part II (translated from Russian, 1968), 115–125.
Williams, H. P. Model Building in Mathematical Programming, 4th ed., Wiley (Chichester, 1999).
Williams, H. P., and J. M. Wilson, Connections between integer linear programming and constraint logic programming-An overview and introduction to the cluster of articles, INFORMS Journal on Computing 10 (1998) 261–264.
Williams, H.P., and Hong Yan, Representations of the all different predicate of constraint satisfaction in integer programming, INFORMS Journal on Computing 13 (2001) 96–103.
Wilson, J. M., Compact normal forms in propositional logic and integer programming formulations, Computers and Operations Research 17 (1990): 309–314.
Wolsey, L. A., Integer Programming, Wiley (1998).
Yan, H., and J. N. Hooker, Tight representation of logical constraints as cardinality rules, Mathematical Programming 85 (1999): 363–377.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Hooker, J.N. (2006). Logic-Based Modeling. In: Appa, G., Pitsoulis, L., Williams, H.P. (eds) Handbook on Modelling for Discrete Optimization. International Series in Operations Research & Management Science, vol 88. Springer, Boston, MA. https://doi.org/10.1007/0-387-32942-0_3
Download citation
DOI: https://doi.org/10.1007/0-387-32942-0_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-32941-3
Online ISBN: 978-0-387-32942-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)