This HTML5 document contains 29 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n10https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Decomposition_method_(constraint_satisfaction)
dbo:wikiPageWikiLink
dbr:Binary_constraint
Subject Item
dbr:List_of_numerical_analysis_topics
dbo:wikiPageWikiLink
dbr:Binary_constraint
Subject Item
dbr:Constraint_satisfaction_dual_problem
dbo:wikiPageWikiLink
dbr:Binary_constraint
Subject Item
dbr:Complexity_of_constraint_satisfaction
dbo:wikiPageWikiLink
dbr:Binary_constraint
Subject Item
dbr:Local_consistency
dbo:wikiPageWikiLink
dbr:Binary_constraint
Subject Item
dbr:Binary_constraint
rdfs:label
Binary constraint
rdfs:comment
A binary constraint, in mathematical optimization, is a constraint that involves exactly two variables. For example, consider the n-queens problem, where the goal is to place n chess queens on an n-by-n chessboard such that none of the queens can attack each other (horizontally, vertically, or diagonally). The formal set of constraints are therefore "Queen 1 can't attack Queen 2", "Queen 1 can't attack Queen 3", and so on between all pairs of queens. Each constraint in this problem is binary, in that it only considers the placement of two individual queens.
dcterms:subject
dbc:Constraint_programming dbc:Mathematical_optimization
dbo:wikiPageID
11751094
dbo:wikiPageRevisionID
859457054
dbo:wikiPageWikiLink
dbr:Queen_(chess) dbr:Mathematical_optimization dbc:Constraint_programming dbc:Mathematical_optimization dbr:Linear_program dbr:Strongly_polynomial_time dbr:N-queens_problem
owl:sameAs
freebase:m.02rr2t0 n10:4Z1DZ wikidata:Q4913885
dbp:wikiPageUsesTemplate
dbt:Mathapplied-stub dbt:Reflist
dbo:abstract
A binary constraint, in mathematical optimization, is a constraint that involves exactly two variables. For example, consider the n-queens problem, where the goal is to place n chess queens on an n-by-n chessboard such that none of the queens can attack each other (horizontally, vertically, or diagonally). The formal set of constraints are therefore "Queen 1 can't attack Queen 2", "Queen 1 can't attack Queen 3", and so on between all pairs of queens. Each constraint in this problem is binary, in that it only considers the placement of two individual queens. Linear programs in which all constraints are binary can be solved in strongly polynomial time, a result that is not known to be true for more general linear programs.
gold:hypernym
dbr:Constraint
prov:wasDerivedFrom
wikipedia-en:Binary_constraint?oldid=859457054&ns=0
dbo:wikiPageLength
1498
foaf:isPrimaryTopicOf
wikipedia-en:Binary_constraint
Subject Item
wikipedia-en:Binary_constraint
foaf:primaryTopic
dbr:Binary_constraint