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.
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… 
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
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… 
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… 
1999
1999
Optimal Distributed Arc-Consistency
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our… 
Highly Cited
1999
Highly Cited
1999
Non-Binary Constraints
Since the origins of the constraint satisfaction paradigm, its restriction to binary constraints has concentrated a significant… 
Review
1995
Review
1995
Ternary relationship decomposition strategies based on binary imposition rules
We review a set of rules identifying which combinations of ternary and binary relationships can be combined simultaneously in… 
1992
1992
A Symbolic Approach to Interval Constraint Problems
We report on a symbolic approach to solving constraint problems, which uses relation algebra. The method gives good results for… 
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)