Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming

References

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