Conditional lexicographic orders in constraint satisfaction problems

DOI10.1007/s10479-008-0385-3zbMath1184.68478OpenAlexW2033623100MaRDI QIDQ846134

Nic Wilson, Richard J. Wallace

Publication date: 1 February 2010

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0385-3

zbMATH Keywords

preferenceconstraint satisfaction problemconstraint programminglexicographic

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Lexicographically-ordered constraint satisfaction problems ⋮ Voting on multi-issue domains with conditionally lexicographic preferences

Uses Software

• CP-nets
• SOFT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lexicographically-ordered constraint satisfaction problems
• Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
• Constraint Satisfaction
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems