(Enter summary)
Abstract: A problem is presented which can be formulated as a constraint satisfaction problem, and in particular as a permutation problem, i.e. it has the same number of values as variables, all variables have the same domain and each variable must be assigned a different value. Different ways of modelling the problem and finding all solutions are investigated. Permutation problems have a dual representation in which the roles of the variables and values are interchanged. It is shown that adding the dual ... (Update)
Context of citations to this paper: More
.... use of multiple matrices to encode information redundantly and channelling constraints to maintain consistency between the matrices [20, 3, 16, 22]. We claim that matrix models can be studied as a class, and that by doing so we can discover powerful generalities about how to use...
Cited by: More
Permutation Problems and Channelling Constraints - Walsh (2001)
(Correct)
Dual Models of Permutation Problems - Smith (2001)
(Correct)
Modeling and Analyzing Soft Constraint Optimization.. - Zhang, Swanson, Moran (2001)
(Correct)
Active bibliography (related documents): More All
0.0: Modelling a Balanced Academic Curriculum Problem - Hnich, Kiziltan, Walsh (2002)
(Correct)
0.0: Algebraic Properties of CSP Model Operators - Law, Lee
(Correct)
0.0: Automatable High-Level Integration of Constraint Programs - Hnich, Flener
(Correct)
Similar documents based on text: More All
0.5: A Fast and Simple Algorithm for Bounds Consistency .. - Lopez-Ortiz.. (2003)
(Correct)
0.4: Integer Programming Models 1: Selected Models - Kalvelagen (2001)
(Correct)
0.2: Faster Algorithms for Bound-Consistency of the Sortedness and .. - Mehlhorn, Thiel (2000)
(Correct)
Related documents from co-citation: More All
11: Increasing constraint propagation by redundant modeling: an experience report
- Cheng, Choi et al. - 1999
6: The OPL Optimization Programming Language (context) - Van Hentenryck - 1999
5: Symmetry breaking during search in constraint programming
- Gent, Smith - 1999
BibTeX entry: (Update)
B.M. Smith. Modelling a Permutation Problem. In Proceedings of ECAI'2000 Workshop on Modelling and Solving Problems with Constraints, 2000. Also available as Research Report from http://www.comp.leeds.ac.uk/bms/papers.html. http://citeseer.ist.psu.edu/smith00modelling.html More
@inproceedings{ smith00modelling,
author = "B. Smith",
title = "Modelling a Permutation Problem",
booktitle = "Proceedings of ECAI'2000 Workshop on Modelling and Solving
Problems with Constraints",
year = "2000",
url = "citeseer.ist.psu.edu/smith00modelling.html" }
Citations (may not include all citations):
35
Look-ahead value ordering for constraint satisfaction proble..
- Frost, Dechter - 1995
35
Dual Viewpoint Heuristics for Binary Constraint Satisfaction.. (context) - Geelen - 1992
27
Increasing constraint propagation by redundant modeling: an ..
- Cheng, Choi et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.scs.leeds.ac.uk/bms/papers.html): More
Locating the Phase Transition in Binary Constraint Satisfaction.. - Smith (1994)
(Correct)
Modelling Exceptionally Hard Constraint Satisfaction Problems - Smith, Grant (1997)
(Correct)
In Search of Exceptionally Difficult Constraint Satisfaction.. - Smith (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC