Abstract
The purpose of this introductory chapter is to provide the basic concepts behind Constraint Programming (CP) and Integer Programming (IP). These two fields cover a variety of aspects and have been widely studied. Therefore, here we do not intend to give a deep insight of the fields, but to provide the definitions and concepts for understanding the rest of this book. We explain CP and IP modelling aspects and solving strategies. We ground our discussion on an example: the car sequencing problem. The chapter provides references to relevant biography which can be referred to for a deeper understanding.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aarts, E. and Lenstra, J.K. (eds.), (1997). Local Search in Combinatorial Optimization. Princeton University Press.
Associates, D. (2002). XPRESS-MP User’s Manual.
Balas, E., Ceria, S., Cornuejols, G., and Natraj, N. (1996). Gomory cuts revisited. OR Letters, 19:1–9.
Baptiste, P., Pape, C. L., and Nuijten, W. (1995). Efficient operations research algorithms in constraint-based scheduling. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI’95.
Beck, J.C. and Perron, L. (2000). Discrepancy-Bounded Depth First Search, International Workshop on Integration of AI and OR Technologies for Combinatorial Optimization Problems, CP-AI-OR’00.
Beldiceanu, N. and Contejean, E. (1994). Introducing global constraints in CHIP. Mathematical Computer Modelling, 20(12):97–123.
Beringer, H. and Backer, B. D. (1995). Combinatorial problem solving in constraint logic programming with cooperating solvers. In Beierle, C. and L. Plumer, editors, Logic Programming: formal Methods and Practical Applications. North Holland.
Bèssiere, C, Freuder, E., and Régin, J. (1999a). Using constraint metaknowledge to reduce arcconsistency computation. Artificial Intelligence, 107:125–148.
Bèssiere, C., Meseguer, P., Freuder, E., and Larrosa, J. (1999b). On forward checking for non binary constraint satisfaction. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP’99.
Bèssiere, C. and Régin, J. (1997). Arc consistency for general constraint networks: preliminary results. In Proceedings of Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI’97.
Bèssiere, C. and Régin, J. (1999). Enforcing arc consistency for global constraints by solving subproblems on the fly. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP99.
Bixby, R., Fenelon, M., Gu, Z., Rothberg, E., and Wunderling, R. (2000). MIP: Theory and practice - closing the gap. In Powell, M. and Scholtes, S., editors, System Modelling and Optimization: Methods, Theory and Applications. Kluwer.
Caseau, Y. and Laburte, F. (1997). Solving small TSPs with constraints. In Proceedings of the Fourteenth International Conference on Logic Programming -ICLP’97, pages 316–330.
Corne, D., Dorigo, M., and (eds.), F. G. (1999). New Ideas in Optimization -Advanced Topics in Computer Science Series. McGraw-Hill.
Crowder, H., Johnson, E., and Padberg, M. (1983). Solving large-scale zero-one linear programming problems. Operations Research, pages 803–834.
Darbi-Dowman, K. and Little, J. (1998). Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming. INFORMS Journal of Computing, 10(3):276–286.
Dincbas, M., Hentenryck, P. V., Simonis, M., Aggoun, A., Graf, T., and Berthier, F. (1988). The constraint logic programming language CHIP. In Proceedings of the International Conference on Fifth Generation Computer System, pages 693–702.
Focacci, F., Lodi, A., and Milano, M. (1999a). Cost-based domain filtering. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP99, pages 189–203.
Focacci, F., Lodi, A., and Milano, M. (1999b). Solving tsp with time windows with constraints. In ICLP’99 International Conference on Logic Programming.
Gomory, R. (1958). Outline of an algorithm for integer solutions to linear programs. Bulletin of the Americal Mathematical Society, 64:275–278.
Hajian, M., El-Sakkout, H., Wallace, M., Lever, J., and Richards, E. (1996). To-wards a closer integration of finite domain propagation and simplex-based algorithms. In Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics 1996.
Harvey, W. D. and Ginsberg, M. L. (1995). Limited Discrepancy Search. In Mellish, C. S., editor, Proceedings of the International Joint Conference on Artificial Intelligence IJCAI95.
IC-Park (2003). ECL l PS e User Manual.
ILOG (2002). ILOG Cplex Users Manual 7.0.
Johnson, E., Nemhauser, G., and Savelsbergh, M. (2000). Progress in linear programming based branch-and-bound algorithms: An exposition. INFORMS Journal on Computing, 12:1–48.
Mackworth, A. (1977). Consistency in networks of relations. Artificial Intelligence, 8:99–118.
Perron, L. (1999). Search procedures and parallelism in constraint programming. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP99.
Pesant, G., Gendreau, M., Potvin, J., and Rousseau, J. (1998). An exact constraint logic programming algorithm for the travelling salesman problem with time windows. Transportation Science, 32(1): 12–29.
Puget, J. (1994). A C++ implementation of CLP. Technical Report 94–01, ILOG Headquarters.
Refalo, P. (1999). Tight cooperation and its application in piecewise linear optimization. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP99.
Refalo, P. (2000). Linear formulation of constraint programming models and hybrid solvers. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP2000.
Régin, J. (1994). A filtering algorithm for constraints of difference in CSPs. In Proceedings of the American Conference on Artificial Intelligence, AAAI94.
Régin, J. (1999a). Arc consistency for global cardinality constraints with costs. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP99.
Régin, J. (1999b). The symmetric Alldiff constraint. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI’99.
Rodosek, R., Wallace, M., and M.T. Hajian (1997). A new approach to integrating mixed integer programming and constraint logic programming. Annals of Operational Research. Recent Advances in Combinatorial Optimization.
Smith, B., Bradford, S., Hubbard, P., and Williams, H. (1996). The progressive party problem: Integer linear programming and constraint programming compared. Constraints, 1:119–138.
Tsang, E. (1993). Foundation of Constraint Satisfaction. Academic Press.
Walsh, T. (1997). Depth-Bounded Discrepancy Search. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI97.
Williams, H. (1999). Model Building in Mathematical Programming. John Wiley and Sons, 4 edition.
Wolsey, L. (1998). Integer Programming. Wiley.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science+Business Media New York
About this chapter
Cite this chapter
Milano, M., Trick, M. (2004). Constraint and Integer Programming. In: Milano, M. (eds) Constraint and Integer Programming. Operations Research/Computer Science Interfaces Series, vol 27. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8917-8_1
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8917-8_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4719-4
Online ISBN: 978-1-4419-8917-8
eBook Packages: Springer Book Archive