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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Consistency checking plays a central role in qualitative spatial and temporal reasoning. Given a set of variables V, and a set of… 
2010
2010
Most existing techniques for combining multiple alignment tables can combine only two alignment tables at a time, and are based… 
2010
2010
Software development planning usually does not take any advantage of planning and scheduling techniques involving reasoning about… 
2007
2007
Propositional calculus is a well known and widely treated search area. But, studying it, we can see that using the disposition of… 
2007
2007
This paper present a new optimization model to generate aggregate production planning by considering electric cost. The new Time… 
2004
2004
Qualitative spatial and temporal reasoning problems are usually expressed in terms of constraint satisfaction problems, with… 
2004
2004
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other… 
2003
2003
  • Ji Sun
  • 2003
  • Corpus ID: 123988655
Most of the research on constraint satisfaction problems (CSPs) concentrates on binary constraints, however, non-binary… 
2001
2001
Constraint satisfaction has been the subject of many studies. Different areas of research have tried to solve all kind of… 
1997
1997
In [FRE 91], Freuder has defined the notion of interchangeability on values in a CSP, whose purpose is to reduce the size of the…