Propagation algorithms for lexicographic ordering constraints

DOI10.1016/j.artint.2006.03.002zbMath1131.68521MaRDI QIDQ2457611

Toby Walsh, Zeynep Kiziltan, Ian Miguel, Brahim Hnich, Alan M. Frisch

Publication date: 23 October 2007

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2006.03.002

zbMATH Keywords

symmetry; artificial intelligence; constraint propagation; symmetry breaking; matrix models; constraints; constraint programming; lexicographic ordering; generalized arc consistency

Mathematics Subject Classification ID

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Automated streamliner portfolios for constraint satisfaction problems, Variable symmetry breaking in numerical constraint problems, Constraint programming for planning test campaigns of communications satellites, An improved SAT formulation for the social golfer problem, On matrices, automata, and double counting in constraint programming, Generating custom propagators for arbitrary constraints, Parameterized Complexity Results in Symmetry Breaking, Breaking Symmetry of Interchangeable Variables and Values

Uses Software

• CPLEX
• CSPLib
• WSAT(OIP)
• SICStus

Cites Work

• Consistency in networks of relations
• Increasing constraint propagation by redundant modeling: An experience report
• Integer optimization by local search. A domain-independent approach
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item