Skip to search formSkip to main contentSkip to account menu

Binary constraint

A binary constraint, in mathematical optimization, is a constraint that involves exactly two variables. For example, consider the n-queens problem… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Complexity of constraint satisfactionConstraint satisfaction dual problemDecomposition method (constraint satisfaction)List of numerical analysis topics

Broader (1)

Constraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Decomposition of the Factor Encoding for CSPs
Generalized arc consistency (GAC) is one of the most fundamental properties for reducing the search space when solving constraint… 
2012
2012
Challenging heuristics: evolving binary constraint satisfaction problems
In computer science it is a common practice to evaluate the performance of algorithms using a set of benchmark or randomly… 
2011
2011
Solving Qualitative Constraints Involving Landmarks
Consistency checking plays a central role in qualitative spatial and temporal reasoning. Given a set of variables V, and a set of… 
2007
2007
Propositional Calculus via Constraint Networks
Propositional calculus is a well known and widely treated search area. But, studying it, we can see that using the disposition of… 
2004
2004
Characterization of a New Restart Strategy for Randomized Backtrack Search
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other… 
2003
2003
Solving Non-Binary Constraint Satisfaction Problem
  • Sun Ji
  • 2003
  • Corpus ID: 123988655
Most of the research on constraint satisfaction problems (CSPs) concentrates on binary constraints, however, non-binary… 
2003
2003
Evolving binary constraint satisfaction problem instances that are difficult to solve
  • Jano van Hemert
  • The Congress on Evolutionary Computation, . CEC…
  • 2003
  • Corpus ID: 6279348
We present a study on the difficulty of solving binary constraint satisfaction problems where an evolutionary algorithm is used… 
2001
2001
Constraint Satisfaction Problems and Evolutionary Computation: A Reality Check
Constraint satisfaction has been the subject of many studies. Different areas of research have tried to solve all kind of… 
Highly Cited
1989
Highly Cited
1989
Object recognition based on graph matching implemented by a Hopfield-style neural network
A model-based object recognition technique is presented. For each model, distinct features such as curvature points are extracted… 
Highly Cited
1989
Highly Cited
1989
On binary constraint networks
It is well-known that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) [Pei92]. CSPs may… 
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)