Conditional Symmetry Breaking

DOI10.1007/11564751_21zbMath1153.68459OpenAlexW1858160249WikidataQ61442811 ScholiaQ61442811MaRDI QIDQ3524179

Steve Linton, Barbara M. Smith, Iain McDonald, Tom Kelsey, Ian Miguel, Ian Philip Gent

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11564751_21

Mathematics Subject Classification ID

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

Related Items (7)

\textsc{Conjure}: automatic generation of constraint models from problem specifications ⋮ Local Symmetry Breaking During Search in CSPs ⋮ Exploiting subproblem dominance in constraint programming ⋮ Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem ⋮ Dynamic symmetry-breaking for Boolean satisfiability ⋮ Symmetries, almost symmetries, and lazy clause generation ⋮ Dominance breaking constraints

This page was built for publication: Conditional Symmetry Breaking