Skip to search formSkip to main contentSkip to account menu

Symmetry-breaking constraints

Known as: Symmetry breaking constraints 
In the field of mathematics called combinatorial optimization, the method of symmetry-breaking constraints can be used to take advantage of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations

Broader (2)

Combinatorial optimizationConstraint programming
Constraint satisfactionVehicle routing problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A Lossless Data Reduction for Mining Constrained Patterns in n-ary Relations
Given a binary relation, listing the itemsets takes exponential time. The problem grows worse when searching for analog patterns… 
2010
2010
An Automated Intensity-Modulated Radiation Therapy Planning System
We design and implement an intensity-modulated radiation therapy plan generation technology that effectively and efficiently… 
2010
2010
GAPLex: Generalized Static Symmetry Breaking
We describe a novel algorithm that statically breaks symmetry in CSPs by using computational group theory during search. This… 
2008
2008
Dynamic Posting of Static Symmetry Breaking Constraints
We have proposed a method for dynamically posting symmetry breaking constraints to eliminate value interchangeability [1]. We now… 
2008
2008
Dynamic Symmetry Breaking Constraints
We present a general method for dynamically posting symmetry breaking constraints during search. The basic idea is very simple… 
Highly Cited
2006
Highly Cited
2006
Analog Placement with Symmetry and Other Placement Constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper… 
2005
2005
Sets of Symmetry Breaking Constraints
[Puget, 2004] has shown that if the symmetry in a constraint satisfaction problem acts only on the variables and there is also an… 
2005
2005
Using constraints to break value symmetries in constraint satisfaction problems
Many real life problems can naturally be modeled as constraint satisfaction problems (CSPs), which can sometimes contain both… 
2005
2005
A note on the compatibility of static symmetry breaking constraints and dynamic symmetry breaking methods
Adding static constraints (e.g. lexicographic constraints) and modifying a backtracking search procedure to dynamically eliminate… 
2002
2002
Symmetry Breaking Constraints for Matrix Models
Many CSPs can be effectively represented and efficiently solved using matrix models, in which the matrices may have symmetry… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)