Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

74

Voted

CPAIOR
2006
Springer

favoriteEmaildiscussreport

103views Operations Research» more CPAIOR 2006»

Conditional Lexicographic Orders in Constraint Satisfaction Problems

15 years 1 months ago

Conditional Lexicographic Orders in Constraint Satisfaction Problems

Download 4c.ucc.ie

The lexicographically-ordered CSP ("lexicographic CSP" for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs. Preferences are defined by a total ordering across all assignments, such that a change in assignment to variable

Richard J. Wallace, Nic Wilson

Real-time Traffic

Conditional Preference | CPAIOR 2006 | Lexicographic Csps | Operations Research | Ordinary Lexicographic Csps |

claim paper

Related Content

» Lexicographicallyordered constraint satisfaction problems

» Combining Symmetry Breaking with Other Constraints Lexicographic Ordering with Sums

» Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction

» Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains

» Propagation algorithms for lexicographic ordering constraints

» Six Ways of Integrating Symmetries within Nonoverlapping Constraints

» A nonbinary constraint ordering heuristic for constraint satisfaction problems

» STCSP Structured Temporal Constraint satisfaction Problems

» Evaluation of Solving Models for Conditional Constraint Satisfaction Problems

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	CPAIOR
Authors	Richard J. Wallace, Nic Wilson

Comments (0)