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

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

PrefixNamespace IRI
n6http://dbpedia.org/resource/Go_(game)
n5http://dbpedia.org/resource/Benson's_algorithm_(Go)
rdfshttp://www.w3.org/2000/01/rdf-schema#
n2http://dbpedia.org/resource/Benson'
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
xsdhhttp://www.w3.org/2001/XMLSchema#
Subject Item
n2:s_algorithm
rdfs:comment
Benson's algorithm, named after Harold Benson, is a method for solving linear multi-objective optimization problems. This works by finding the "efficient extreme points in the outcome set". The primary concept in Benson's algorithm is to evaluate the upper image of the vector optimization problem by cutting planes.
owl:differentFrom
n5: n6: