Propagation algorithms for lexicographic ordering constraints

DOI10.1016/j.artint.2006.03.002zbMath1131.68521OpenAlexW2151352672MaRDI 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

symmetryartificial intelligenceconstraint propagationsymmetry breakingmatrix modelsconstraintsconstraint programminglexicographic orderinggeneralized arc consistency

Mathematics Subject Classification ID

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

Related Items (8)

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

Uses Software

• CPLEX
• CSPLib
• WSAT(OIP)
• SICStus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Propagation algorithms for lexicographic ordering constraints