Scheme for unifying optimization and constraint satisfaction methods

Knowledge Engineering Review

Volumn 15, Issue 1, 2000, Pages 11-30

  Hooker, John ^a   Ottosson, Greger ^b   Thorsteinsson, Erlender S ^a   Kim, Hak Jin ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; INFERENCE ENGINES; OPTIMIZATION;

CONSTRAINT SATISFACTION METHODS; DUALITIES;

KNOWLEDGE ENGINEERING;

EID: 0034155409     PISSN: 02698889     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269888900001077     Document Type: Article

References (48)

1. De Backer, B and Beringer, H, 1993. "A CLP language handling disjunctions of linear constraints" in DS Warren (ed), Proceedings of the Tenth International Conference on Logic Programming, Budapest, Hungary, 550-563.
2. Balas E, 1975. "Disjunctive programming: Cutting planes from logical conditions" Nonlinear Programming 2 279-312.
3. Balas E, 1979. "Disjunctive programming" in PL Hammer, EL Johnson and BH Korte (eds), Discrete Optimization II 5 3-51. (Annals of Discrete Mathematics, North-Holland.)
4. Bazaraa, MS, Jarvis, JJ and Sherali HD, 1990. Linear Programming and Network Flows Wiley, New York.
5. Beaumont, N, 1990. "An algorithm for disjunctive programs" Euro J Operational Research 48 362-371.
6. Beldiceanu, N and Contejean, E, 1994. "Introducing global constraints in CHIP" Math Comput Modelling 20(12) 97-123.
7. Beringer, H and De Backer, B, 1995. "Combinatorial problem solving in constraint logic programming with cooperating solvers" in C Beierle and I Plümer (eds), Logic Programming: Formal Methods and Practical Applications: Studies in Computer Science and Artificial Intelligence, Chapter 8. Elsevier, Amsterdam, 245-272.
8. Bertele, U and Brioschi, F, 1972. Nonserial Dynamic Programming. Academic Press, New York.
9. Bockmayr, A and Kasper, T, 1998. "Branch-and-infer: A unifying framework for integer and finite domain constraint programme" INFORMS J Computing 10(3) 287-300.
10. Bollapragada, S, Ghattas, O and Hooker, JN, 2000. "Optimal design of truss structures by mixed logical and linear programming" Operations Research (to appear).
11. Caseau, Y and Laburthe, F, 1997a. "Solving various weighted matching problems with constraints" Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 1330 17-31. Springer-Verlag, Berlin.
12. Caseau, Y and Laburthe, F, 1997b. "Solving small TSPs with constraints" in L Naish (ed), Proceedings of the 14th International Conference on Logic Programming 316-330.
13. Dawande, M and Hooker, JN, 2000. "Inference-based sensitivity analysis for mixed integer/linear programming" Operations Research (to appear).
14. de Farias, IR, 2000. "A branch-and-cut approach without binary variables to combinatorial optimization problems with continuous variables and combinatorial constraints" The Knowledge Engineering Review 15(1).
15. El Sakkout, H, Richards, T and Wallace, M, 1998. "Minimal perturbance in dynamic scheduling" in H Prade (ed), Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98) 504-508.
16. Focacci, F, Lodi, A and Milano, M, 1999. "Solving TSP with time windows with constraints" Sixteenth International Conference on Logic Programming.
17. Fourer, R, 1994. "Extending a general-purpose algebraic modeling language to combinatorial optimization: A logic programming approach" Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search Kluwer, Dordrecht.
18. Fourer, R, Gay, DM and Kernighan, BW, 1993. AMPL - A Modeling Language for Mathematical Programming The Scientific Press, San Francisco.
19. Garfinkel, R and Nemhauser, G, 1970. "Optimal political districting by implicit enumeration techniques" Management Science 16.
20. Grossmann, E, Hooker, JN, Raman, R and Yan, H, 1994. "Logic cuts for processing networks with fixed charges" Computers and Operations Research 21 265-279.
21. Heipcke, S, 1998. "Integrating constraint programming techniques into mathematical programming" in H Prade (ed), Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 259-260.
22. Hooker, JN, 1994. "Logic-based methods for optimization" in A Bornig (ed), Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 874. Springer-Verlag, Berlin.
23. Hooker, JN, 1996. "Inference duality as a basis for sensitivity analysis" in Principles and Practice of Constraint Programming-CP96. Lecture Notes in Computer Science 1118. Springer-Verlag, Berlin.
24. Hooker, JN, 1999. "Inference duality as a basis for sensitivity analysis" Constraints 4 101-112.
25. Hooker, JN, 2000. Logic-Based Methods for Optimization. Wiley, New York.
26. Hooker JN and Kim, H-J, 1999. "Obtaining bounds from the relaxation dual" (in preparation).
27. Hooker, JN, Kim, H-J and Ottosson, G, 1998. "A declarative modeling framework that integrates solution methods" Annals of Operations Research, Special Issue on Modeling Languages and Approaches (to appear).
28. Hooker JN and Osorio, MA, 1999. "Mixed logical/linear programming" Discrete Applied Mathematics 96-97 395-442.
29. Hooker, JN and Ottosson, G, 1999. "Logic-based Benders decomposition" Manuscript, Carnegie Mellon University.
30. Hooker, JN, Ottosson, G, Thorsteinsson, ES and Kim, H-K, 1999. "On integrating constraint propagation and linear programming for combinatorial optimization" Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99) 136-141. The AAAI Press/The MIT Press.
31. Jain, V and Grossmann, IE, 1999. "Algorithms for hybrid MILP/CLP models for a class of optimization problems" Technical report, Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, USA.
32. Marriott, K and Stuckey PJ, 1998. Programming with Constraints: An Introduction. MIT Press.
33. Ottosson, G, Thorsteinsson, ES and Hooker, JN, 1999. "Mixed global constraints and inference in hybrid CLP-IP solvers" CP99 Post-Conference Workshop on Large Scale Combinatorial Optimisation and Constraints.
34. Pinto, JM and Grossmann, IE, 1997. "A logic-based approach to scheduling problems with resource constraints" Computers and Chemical Engineering 21 801-818.
35. Prade, H (ed), 1998. Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98). Wiley, Chichester.
36. Raman, R and Grossmann, IE, 1991. "Relation between MILP modeling and logical inference for chemical process synthesis" Computers and Chemical Engineering 15 73-84.
37. Raman, R and Grossman, IE, 1994. "Modeling and computational techniques for logic based integer programming" Computers and Chemical Engineering 18 563-578.
38. Refalo, P, 1999. "Tight cooperation and its application in piecewise linear optimization" in J Jaffar (ed), Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 1713. Springer-Verlag, Berlin.
39. Régin, J-C, 1993. "A filtering algorithm for constraints of difference in CSPs" Technical Report R.R.LIRMM 93-068, LIRM.
40. Régin, J-C, 1994. "A filtering algorithm for constraints of difference in CSPs" Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94) 362-367
41. Régin, J-C and Puget, JF, 1997. "A filtering algorithm for global sequencing constraints" Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 1330 32-41. Springer-Verlag, Berlin.
42. Régin, J-C, 1999. "Arc consistency for global cardinality constraints with costs" in J Jaffar (ed), Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 1713. Springer-Verlag, Berlin.
43. Rodosek R and Wallace, M, 1998. "A generic model and hybrid algorithm for hoist scheduling problems" Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 1520 385-399. Springer-Verlag, Berlin.
44. Rodosek, R, Wallace, M and Hajian, M, 1997. "A new approach to integrating mixed integer programming and constraint logic programming" Baltzer Journals.
45. Tsang, E, 1953. Foundations of Constraint Satisfaction. Academic Press, London.
46. Türkay M and Grossmann, IE, 1996. "Logic-based MINLP algorithms for the optimal synthesis of process networks" Computers and Chemical Engineering 20 959-978.
47. Van Hentenryck, P, 1989. Constraint Satisfaction in Logic Programming. Logic Programming Series. MIT Press, Cambridge, MA.
48. Van Hentenryck, P, 1999. The OPL Optimization Programming Language. MIT Press, Cambridge, MA.