Cmparing constraint programming and mathematical programming approaches to discrete optimisation— the change problem

Journal of the Operational Research Society

Volumn 50, Issue 6, 1999, Pages 581-595

  Heipcke, S ^a  

^a UNIVERSITY OF BUCKINGHAM   (United Kingdom)

Author keywords

Constraint programming; Integer programming

Indexed keywords

CONSTRAINT THEORY; INTEGER PROGRAMMING; LOGIC PROGRAMMING; PROBLEM SOLVING;

CONSTRAINT PROGRAMMING;

OPERATIONS RESEARCH;

EID: 0032623707     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600730     Document Type: Article

References (101)

1. Tsang EPK (1993). Foundations of Constraint Satisfaction. Academic Press, San Diego, CA, USA.
2. Van Hentenryck P (1989). Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, MA, USA.
3. Kanellakis P, Kuper G and Revesz P (1990). Constraint query languages. In: Proceedings 9th ACM Symposium on Principles of Database Systems. ACM Press, USA, pp 299-313.
4. Lauriere JL (1978). A language and a program for stating and solving combinatorial problems. Artificial Intell. 10: 29-127.
5. Sussman GJ and Steele GL (1980). CONSTRAINTS —a language for expressing almost-hierarchical descriptions. Artificial Intell. 14: 1-39.
6. Van Hentenryck P, Saraswat V and Deville Y (1993). Design, Implementation, and Evaluation of the Constraint Langage cc (fD). Technical Report CS-93-02, Brown University.
7. Colmerauer A (1990). An Introduction to Prolog III. CACM 28: 412-418.
8. Jaffar J and Maher MJ (1994). Constraint Logic Programming: a Survey. J Logic Program 19-20: 503-581.
9. Jaffar J, Michaylov S, Stuckey PJ and Yap RH (1992). The CLP(fö) language and system. Trans Program Languages and Systems 14: 337-395.
10. Bockmayr A (1993). Logic programming with pseudo-boolean constraints. In: Benhamou F and Colmerauer A (eds). Constraint Logic Programming: Selected Research. MIT Press, Cambridge, MA, USA pp 327-350.
11. Benhamou F and Older WJ (1997). Applying interval arithmetic to integer and boolean constraints. J Logic Program 32: 1-24.
12. Diaz D and Codoggnet P (1993). A minimal extension of the WAM for clp(FD). In: Proceedings of the 10th International Conference on Logic Programming, MIT Press: Cambridge, MA, pp 774-790
13. Dincbas M et al (1988). The constraint logic programming language CHIP. In: Institute for New Generation Computer Technology, ICOT (ed) Proceedings International Conference on Fifth Generation Computer Systems (FGCS-88) Tokyo, Springer Verlag, Germany, pp 693-702.
14. Wallace M, Novello S and Schimpf J (1997). ECLiPSe: a platform for constraint logic programming. ICL Sys J: 12(1): 159-200.
15. BULL Corporation (1990). CHARME VI Users Guide and Reference Manual, BULL S.A., France.
16. Puget JF (1994). A C++ implementation of CLP. I log solver collected papers, Technical Report, ILog, France (www.ILog. com).
17. Henz M, Smolka G, Würtz J (1993). Oz — A Programming language for Multi-Agent Systems. In: Bajesy R (ed): Proceedings of the 13th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, San Francisco, CA. pp 404-409.
18. Little J and Darby-Dowman K (1995). The significance of constraint logic programming to operational research. In: Lawrence M and Wilsdon C (eds). Opl Res, pp. 20-45. Tutorial Papers, 1995.
19. Jordan C and Drexl A (1993). A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups. Working Paper, Universität Kiel, Kiel.
20. Heipcke S (1996). Resource constrained scheduling with COME. In: Proceedings of the Second International Conference on the Practical Application of Constraint Technology, PACT 96, The Practical Application Company. Blackpool, UK.
21. Smith SC, Brailsford BM, Hubbard PM and Williams HP (1995). The progressive party problem: integer linear programming and constraint programming compared. In: Montanari U and Rossi F (eds). Principles and Practice of Constraint Programming—CP95, LNCS 976. Springer: Berlin, pp. 36-52.
22. Tsang EPK (1995). Scheduling techniques — comparative study. BT Technol J13: 16-28.
23. Mayer J, Mitterreiter I and Radermacher FJ (1995). Running time experiments on some algorithms for solving propositional satisfiability problems. Annals of Opns Res 55: 139-178.
24. Garey MR and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman & Company: San Francisco.
25. Van Hentenryck P (1995). Constraint solving for combinatorial search problems: a tutorial. In: Montanari U and Rossi F (eds). Principles and Practice of Constraint Programming — CP95, Springer: Berlin, pp. 564-587.
26. Hooker JN (1998). Constraint satisfaction methods for generating valid cuts. In: Woodruff DL (ed). Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search. Kluwer: Boston, pp. 1-30.
27. From A (1994). Programmation par Contraintes. Addison- Wesley: Paris.
28. Wallace M (1996). Practical applications of constraint programming. Constraints 1: 139-168.
29. Marriott K and Stuckey PJ (1998). Programming with Constraints. MIT Press: Cambridge MA.
30. Dechter R and van Beek P (1995). Local and global relational consistency. In: Montanari U and Rossi F (eds). Principles and Practice of Constraint Programming — CP95. Springer: Berlin, pp. 240-257.
31. Nemhauser GL and Wolsey LA (1989). Integer and Combinatorial Optimization. John Wiley: New York.
32. Meier M (1996). Finite domain constraint programming. Tutorial held at Principles and Practice of Constraint Programming — CP96, Cambridge MA. (Available from authors).
33. Hooker J (1996). Presentation at principles and practice of constraint programming — CP96, Cambridge MA. (Available from authors).
34. Williams HP (1993). Model Building in Mathematical Programming, 3rd Rev. Edn. John Wiley: Chichester.
35. Ashford R and Daniel R (1993). Mixed-integer programming in production scheduling: a case study. In: Ciriani T and Leachman RC (eds). Optimization in Industry. John Wiley & Sons: New York, pp 231-239
36. Belveaux G et al (1998). Model enhanced mixed integer programming methods in production distribution planning. Presentation at the International Symposium on Combinatorial Optimization —CO98, Brussels (unpublished).
37. Hajian MT, Rodosek R and Richards EB (1999). Introduction of a new class of variables to discrete and integer programming problems. Annals of Opns Res (to appear)
38. Mackworth AK (1977). Consistency in networks of relations. Artifi Intell, Berkeley, CA. 8: 99-118.
39. Mayoh B, Tyugu E and Uustalu T (1994). Constraint satisfaction and constraint programming: a brief lead-in. In: Mayoh B, Tyugu E and Penjam J (eds). Constraint Programming. Berlin, Heidelberg, pp 1-16.
40. Nuijten WPM and Aarts EHL (1996). A computational study of constraint satisfaction for multiple capacitated job shop scheduling. Eur J Opl Res 90: 269-284.
41. Van Hentenryck P and Deville Y (1990). The Cardinality Operator: A New Logical Connective for Constraint Logic Programming. Technical Report CS-90-24, Brown University.
42. Beldiceanu N and Contejean E (1994). Introducing global constraints in CHIP. J Math and Comp Modelling 20: 97-123.
43. Kuhn HW and Tucker AW (1951). Nonlinear programming. In: Neymann J (ed). Proceedings Second Berkeley Symposium on Mathematical Statistics and Probability. University of California, pp 481-492
44. Cheng BMW Lee JHM and Wu JCK (1996). Speeding up constraint propagation by redundant modeling. In: Freuder EC (ed). Principles and Practice of Constraint Programming. Berlin: Springer, pp 91-103.
45. Grötschel M and Lovasz L (1994). Optimization. In: Graham R, Grötschel M and Lovasz L (eds). Handbook on Combinatorics, volume 2. North Holland.
46. Nogueira Rangel M (1995). Solving Integer Programming Problems Using Preprocessing and Cutting Planes: Theory and Implementation of Branch and Cut. PhD thesis, Dep. of Mathematics and Statistics, Brunel University, London.
47. Van Roy TJ and Wolsey LA (1986). Valid inequalities for mixed 0-1 programs. Disc Appl Mathe 14: 199-213.
48. Johnson EL, Nemhauser GL and Savelsbergh MWP (1997). Progress in linear programming based branch-and-bound algorithms: an exposition. INFORMS J, on Computing (submitted)
49. Barnhart C et al. (1994). Branch-and-Price: Column Generation for Solving Huge Integer Programs. Technical Report COC-94- 03, School of Industrial and Systems Engineering, Georgia Institute of Technology: Atlanta, GA.
50. Savelsbergh MWP (1994). Preprocessing and probing techniques for mixed integer programming problems. ORSA J Comp 6: 445-454.
51. Freuder EC (1978). Synthesizing constraint expressions. Commun of ACM 21: 958-966.
52. Montanari U (1974). Networks of constraints. Fundamental properties and applications to picture processing. Inform Sci 7: 95-132.
53. Dechter R (1992). From local to global consistency. Artifi Intell 55: 87-107.
54. Mohr R and Henderson TC (1986). Arc and path consistency revisited. Artifi Intell 28: 225-233.
55. Van Hentenryck P, Deville Yand Teng CM (1992). A generic arc consistency algorithm and its specializations. Artifi Intell 57: 291-321.
56. Lhomme O (1993) Consistency techniques for numeric CSPs In: Bajcsy R (ed): Proceedings of the 13th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, San Francisco, CA, pp 232-238.
57. Benhamou F, McAllester D and Van Hentenryck P (1994). CLP(Interval) revisited. In: Bruynooghe M (ed), MIT Press: Proceedings of the International Symposium on Logic Programming (ILPS-94). MIT Press, Cambridge, MA, pp 124-138.
58. Dechter R (1989). Enhancement schemes for constraint processing: backjumping, learning and cutset decomposition. Artifi Intell 41: 273-312.
59. Haralick RM and Elliott GL (1980). Increasing tree search efficiency for constraint satisfaction problems. Artifi Intell 14: 263-313.
60. Nadel BA (1989). Constraint satisfaction algorithms. Comput Intell 5: 188-224.
61. Sabin D and Freuder EC (1994). Contradicting conventional wisdom in constraint satisfaction. In: Cohn A (ed). Proceedings of ECA194. John Wiley: Chichester, pp 100-104.
62. Johnson EL, Kostreva MM and Suhl UH (1985). Solving 0-1 integer programming problems arising from large scale planning models. Opns Res 33: 803-819.
63. Hoffmann KL and Padberg M (1991). Improving LP-represen- tations of zero-one linear programs for branch-and-cut. ORSA J Comput 3: 121-135.
64. Spielberg K and Guignard M (1996). Logical Processing: Extensions, New and Old. Presentation at the CLIAO meeting, Rio de Janeiro (unpublished).
65. Guignard M and Spielberg K (1981). Logical reduction methods in zero-one programming. Opns Res 29: 49-74.
66. Cordier C (1998). bc-opt: an Introduction and User Guide. Technical Report, CORE, Université de Louvainla- Neuve.
67. Hooker JN (1988). A quantitative approach to logical inference. Decis Support Sys 4: 45-69.
68. Hooker JN (1988). Resolutions vs. cutting plane solution of inference problems: some computational results. Ops Res Lett 7: 1-7.
69. Raman R and Grossmann IE (1993). Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks. Annals of Opns Res 42: 169-191.
70. Hooker JN and Osorio MA (1997). Mixed Logical/Linear Programming. Manuscript, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA.
71. Lustig IJ, Marsten RE and Shanno DF (1992). On implementing Mehrotra’s predictor-corrector interior-point method for linear programming. SIAM J. Optim 2: 435-449.
72. Roos (1997). Theory and Algorithms for Linear Optimization. An Interior Point Approach. John Wiley: Chichester, New York.
73. Geoffrion A (1974). Lagrangian relaxation for integer programming. Mathe Program Study, 2: 82-114.
74. Fletcher R (1987). Practical Methods of Optimization (2nd edn). John Wiley: Chichester, New York.
75. Papadimitriou CH and Steiglitz K (1982). Combinatorial Optimization: Algorithms and Complexity. Prentice Hall: Englewood Cliffs.
76. Sadeh N and Fox MS (1996). Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artifi Intell, San Francisco, CA 86: 1-41.
77. Harvey WD and Ginsberg ML (1995). Limited discrepancy search. In: Proceedings of IJCA195, Morgan Kaufmann, CA, USA, pp 607-613.
78. Tebboth JR and Daniel RC (1999): A tightly integrated modelling and optimization library: A new framework for rapid algorithm development. Submitted to Annals of Opns Res, (to appear).
79. Rodosek R, Wallace MG and Hajian MT (1999). A new approach to integrating mixed integer programming and CLP. Annals of Opns Res (to appear).
80. Ahuja T, Magnanti T and Orlin J (1993). Network Flows. Theory, Algorithms andApplications. Prentice Hall: EnglewoodCliffs, NJ.
81. Saraswat VA (1993). Concurrent Constraint Programming. MIT Press: Cambridge MA.
82. Marti Ph and Rueher M (1995). A distributed cooperating constraints solving system. Int J Artifi Intell Tools 4: 93-113.
83. Gendron B and Crainic T (1994). Parallel branch-and- bound algorithms: survey and synthesis. Opns Res 42: 1042-1066.
84. Ashford R, Daniel R and Homeister D (1995). Parallel mixed integer programming: The XPRESS-MP experience. UK Operational Research Society 1995 Annual Conference, Kent. (unpublished).
85. Homeister D (1996). Efficient implementation of parallel branch & cut. Presentation at Fifth SIAM Conference on Optimization (OP96), Victoria, Canada. (unpublished).
86. Zillober Ch (1996). Parallel XPRESS-MP Interior Point. Report and Software Manual. Technical report, PAMIPS (Development of Parallel Algorithms and Software for Mixed Integer Programming in Industrial Scheduling), ESPRIT Project 8755.
87. Colombani Y (1997). Un Modèle de Résolution de Contraintes Adapté aux Problèmes D’ordonnancement. Un Prototype et une Application. PhD thesis, LIM, Université Aix-Marseille II.
88. Colombani Y and Heipcke S (1997). The Constraint Solver SchedEns. Tutorial and Documentation. Technical Report 241, LIM Laboratoire d’Informatique de Marseille.
89. XPRESS-MP (1997). Reference Manual. Dash Associates: Blisworth.
90. Pirlot M (1993). General local search heuristics in combinatorial optimization: a tutorial. Belgian J of Op Res, Statistics and Comp Sc 32: 7-67.
91. Puget J-F (1998). Constraint programming: a great AI success. In: Prade H (ed). Proceedings of ECA198, John Wiley: Chichester, pp 98-705.
92. N’Dong S (1998). Industrial applications and CP: trends and unanswered questions. In: Proceedings of the Forth International Conference on the Practical Application of Constraint Technology—PACT98. The Practical Application Company, Blackpool, UK. London, 27-30.
93. Baptiste Ph, Le Pape C and Nuijten W (1995). Incorporating efficient operations research algorithms in constraint-based scheduling. Presented at 1st Int. Joint Workshop on A.I. and O.R., Timberline Lodge: Oregon. (Available from authors).
94. Beringer H and De Backer B (1995). Combinatorial problem solving in constraint logic programming with cooperating solvers. In: Beierle C and Plumer L (eds). Logic Programming: Formal Methods and Practical Applications. Elsevier Science B.V: Amsterdam, pp 245-272.
95. Lfa) revised. In: Maher M (ed). Logic Programming: Proceedings of the 1996 Joint International Conference and Symposium. Cambridge, MA. MIT Press: Cambridge, MA, pp 22-36.
96. Bockmayr A and Kasper Th (1999). A Unifying Framework for Integer and Finite Domain Constraint Programming. Technical Report MPI-I-97-2-008, Max-Planck-Institut, Saarbriicken.
97. Darby-Dowman K, Little J, Mitra G and Zaffalon M (1997). Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem. Constraints 1: 245-264.
98. McAloon K and Tretkoff C (1999). Logic, modelling, and programming. Annals Opns Res 71: 335-372.
99. Heipcke S (1998). Integrating constraint programming techniques into mathematical programming. In: Prade H (ed). Proceedings ofECAI98. John Wiley: Chichester, pp 259-260.
100. Hooker JN, Kim H-J and Ottoson G (1998). A Declarative Modeling Framework that Integrates Solution Methods. Manuscript, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA.
101. Jacquet-Lagreze E (1998). Hybrid methods for large scale optimisation problems: an OR perspective. In: Proceedings of the Forth International Conference on the Practical Application of Constraint Technology—PACT98. The Practical Application Company, Blackpool, UK, pp 1-10.