Constraint and integer programming: Basic concepts

Operations Research/ Computer Science Interfaces Series

Volumn 27, Issue , 2004, Pages 1-31

  Milano, Michela ^a   Trick, Michael ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Branch and bound; Constraint programming; Constraint ropagation; Cuttingplanes; Integer linear programming; Modeling; Relaxation; Search

Indexed keywords

EID: 84888799439     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4419-8917-8     Document Type: Article

References (40)

1. Aarts, E. and Lenstra, J.K. (eds.), (1997). Local Search in Combinatorial Optimization. Princeton University Press.
2. Associates, D. (2002). XPRESS-MP User's Manual.
3. Balas, E., Ceria, S., Comuejols, G., and Natraj, N. (1996). Gomory cuts revisited. OR Letters, 19:1-9.
4. 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 Artijicialintelligence, IJCAI'95.
5. Beck, J.C. and Perron, L. (2000). Discrepancy-Bounded Depth First Search, International Workshop on Integration of Al and OR Technologies for Combinatorial Optimization Problems, CP-AI-OR'oo.
6. Beldiceanu, N. and Contejean, E. (1994). Introducing global constraints in CHIP. Mathematical Computer Modelling, 20(12):97-123.
7. 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.
8. Bessiere, C., Freuder, E., and Regin, J. (1999a). Using constraint metaknowledge to reduce arc-consistency computation. Artificial Intelligence, 107:125148.
9. Bessiere, C., Meseguer, P., Freuder, E., and Larrosa, L. (1999b). On forward checking for non binary constraint satisfaction. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP'99.
10. Bessiere, C. and Regin, L. (1997). Arc consistency for general constraint networks: preliminary results. In Proceedings of Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'97.
11. Bessiere, C. and Regin, L. (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.
12. 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.
13. Kluwer Caseau, Y and Laburte, E (1997). Solving small TSPs with constraints. In Proceedings of the Fourteenth International Conference on Logic Programming -ICLP'97, pages 316-330.
14. Come, D., Dorigo, M., and (eds.), E G. (1999). New Ideas in Optimization Advanced Topics in Computer Science Series. McGraw-Hill.
15. Crowder, H., Johnson, E., and Padberg, M. (1983). Solving large-scale zero-one linear programming problems. Operations Research, pages 803-834.
16. Darbi-Dowman, K. and Little, L. (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.
17. Dincbas, M., Hentenryck, P.v., Simonis, M., Aggoun, A, Graf, T., and Berthier, E (1988). The constraint logic programming language CHIP. In Proceedings of the International Conference on Fifth Generation Computer System, pages 693-702.
18. Focacci, E, 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.
19. Focacci, E, Lodi, A, and Milano, M. (l999b). Solving tsp with time windows with constraints. In ICLP '99 International Conference on Logic Programming.
20. Gomory, R. (1958). Outline of an algorithm for integer solutions to linear programs. Bulletin of the Americal Mathematical Society, 64:275-278.
21. Hajian, M., EI-Sakkout, H., Wallace, M., Lever, J., and Richards, E. (1996). Towards a closer integration of finite domain propagation and simplex-based algorithms. In Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics 1996.
22. 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.
23. IC-Park (2003). ECLipse User Manual.
24. ILOG (2002). ILOG Cplex Users Manual 7.0.
25. 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.
26. Mackworth, A (1977). Consistency in networks of relations. Artificiallntelligence, 8:99-118.
27. Perron, L. (1999). Search procedures and parallelism in constraint programming. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP99.
28. Pesant, G., Gendreau, M., Potvin, L, and Rousseau, L. (1998). An exact constraint logic programming algorithm for the travelling salesman problem with time windows. Transportation Science, 32(1):12-29.
29. Puget, J. (1994). A C++ implementation of CLP. Technical Report 94-01, ILOG Headquarters.
30. 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.
31. 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.
32. Regin, L. (1994). A filtering algorithm for constraints of difference in CSPs. In Proceedings of the American Conference on Artificial Intelligence, AAAI94.
33. Regin, L. (1999a). Arc consistency for global cardinality constraints with costs. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP99.
34. Regin, J. (1999b). The symmetric Alldiff constraint. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'99.
35. 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.
36. Smith, B., Brailford, S., Hubbard, P., and Williams, H. (1996). The progres sive party problem: Integer linear programming and constraint programming compared. Constraints, 1:119-138.
37. Tsang, E. (1993). Foundation of Constraint Satisfaction. Academic Press.
38. Walsh, T. (1997). Depth-Bounded Discrepancy Search. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI97.
39. Williams, H. (1999). Model Building in Mathematical Programming. John Wiley and Sons, 4 edition.
40. Wolsey, L. (1998). Integer Programming. Wiley.