Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming

INFORMS Journal on Computing

Volumn 13, Issue 2, 2001, Pages 96-103

  Williams, H P ^a   Yan, Hong ^b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

All_different Predicate; Constraint Logic Programming; Constraint Satisfaction; Convex Hull; Facets

Indexed keywords

EID: 0141557700     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.13.2.96.10515     Document Type: Article

References (21)

1. Balas, E. 1974. Disjunctive programming: facets of the convex hull of feasible points. Working Paper 348, GSIA, Carnegie Mellon University, Pittsburgh, PA.
2. Barth, P. 1996. Logic-based 0-1 Constraint Programming. Kluwer, Boston, MA.
3. Brailsford, S.C., P.M. Hubbard, B.M. Smith, H.P. Williams. 1995. The progressive party problem: integer linear programming and constraint programming compared. U. Montanar, F. Rosi, eds. Principles and Practice of Constraint Programming. Springer-Verlag, Berlin, Germany.
4. Darby-Dowman, K., J. Little. 1998. Properties of some combinatorial optimization problems and their effect in the performance of integer programming and constraint logic programming. INFORMS J. Computing 10 276-286.
5. Crowder, H., F.L. Johnson, M.W. Padberg. 1983. Solving large-scale zero-one linear programming problems. Operations Research 31 803-834.
6. Fourer, R. 1998. Extending a general-purpose algebra modeling language to combinatorial optimization: a logic programming approach. D.L. Woordruff, ed. Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search. Kluwer, Boston, MA.
7. Hajian, M.T., R. Rodosek, B. Richards. 1999. Introduction of a new class of variables to discrete and integer programming problems. Annals of Operations Research 86 39-51.
8. Hammer, P.L., E.L. Johnson, U.N. Poland. 1975. Facets of regular 0-1 polytopes. Mathematical Programming 8 178-206.
9. Hooker, J.N. 1998. Constraint satisfaction methods for generating valid cuts. D.L. Woodruff, ed. Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search. Kluwer, Boston, MA.
10. Hooker, J.N. 2000. Logic Based Methods for Optimization. Wiley-Inter-Science, New York.
11. Jeroslow, R. 1989. Logic-based decision support: mixed integer model formulation. Annals of Discrete Mathematics 40 North-Holland, Amsterdam, The Netherlands.
12. McKinnon, K.I., H.P. Williams. 1989. Constructing integer programming models by the predicate calculus. Annals of Operations Research 21 227-246.
13. Proll, L., B. Smith. 1998. Integer linear programming and constraint programming approaches to a transportation design problem. INFORMS J. Computing 10 265-275.
14. Tsang, E. 1994. Foundations of Constraint Satisfaction. Wiley, Chichester, UK.
15. Van Hentenryck, P. 1989. Constraint Satisfaction in Logic Programming. MIT Press, Boston, MA.
16. Williams, H.P. 1974. Experiments in the formulations of integer programming problems. Mathematical Programming Study 2 180-197.
17. Williams, H.P. 1978. The formulation of two mixed integer programming problems. Mathematical Programming 14 325-331.
18. Williams, H.P. 1986. Fourier's method of linear programming and its dual. The American Mathematical Monthly 93 681-334.
19. Wilson, S.M. 1990. The formulation and solution of logical puzzles and some implication for artificial intelligence. Bulletin of the Institute of Mathematics and Its Applications 26 86-90.
20. Wolsey, L.A. 1975. Facets for a linear inequality in 0-1 variables. Mathematical Programming 8 165-178.
21. Yan, H., J.N. Hooker. 1999. Tight representation of logic constraints as cardinality rules. Mathematical Programming 85 363-377.