Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/34662
Title: Representations of the all_different predicate of constraint satisfaction in integer programming
Authors: Williams, HP
Yan, H 
Keywords: Constraint satisfaction
Constraint logic programming
All_different predicate
Facets
Convex hull
Issue Date: 2001
Publisher: INFORMS
Source: INFORMS journal on computing, 2001, v. 13, no. 2, p. 96-103 How to cite?
Journal: INFORMS journal on computing
Abstract: The use of predicates to state constraints in Constraint Satisfaction is explained. If, as an alternative, the traditional approach of Integer Programming (IP) is used, it is desirable to model these constraints so as to give as tight a linear programming relaxation as possible. One of the most commonly used predicates is the “all_different” predicate. Different applications of this are described together with different IP formulations. The facet defining constraints for the convex hull are then described and proved to be facet defining.
URI: http://hdl.handle.net/10397/34662
ISSN: 1091-9856 (print)
1526-5528 (online)
DOI: 10.1287/ijoc.13.2.96.10515
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

WEB OF SCIENCETM
Citations

22
Last Week
0
Last month
Citations as of Feb 20, 2017

Page view(s)

15
Last Week
1
Last month
Checked on Feb 19, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.