This HTML5 document contains 31 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/
n4https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
dbpedia-fahttp://fa.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Network_flow_problem
dbo:wikiPageWikiLink
dbr:Out-of-kilter_algorithm
Subject Item
dbr:Minimum-cost_flow_problem
dbo:wikiPageWikiLink
dbr:Out-of-kilter_algorithm
Subject Item
dbr:D._R._Fulkerson
dbo:wikiPageWikiLink
dbr:Out-of-kilter_algorithm
Subject Item
dbr:Out-of-kilter_algorithm
rdf:type
dbo:Software
rdfs:label
Out-of-kilter algorithm
rdfs:comment
The out-of-kilter algorithm is an algorithm that computes the solution to the minimum-cost flow problem in a flow network. It was published in 1961 by D. R. Fulkerson  and is described here. The analog of steady state flow in a network of nodes and arcs may describe a variety of processes. Examples include transportation systems & personnel assignment actions. Arcs generally have cost & capacity parameters. A recurring problem is trying to determine the minimum cost route between two points in a capacitated network. The idea of the algorithm is to identify out-of-kilter arcs and modify the flow network until all arcs are in-kilter and a minimum cost flow has been reached. The algorithm can be used to minimize the total cost of a constrained flow in an oriented network.
dcterms:subject
dbc:Network_flow_problem
dbo:wikiPageID
40772392
dbo:wikiPageRevisionID
1003490700
dbo:wikiPageWikiLink
dbr:Minimum-cost_flow_problem dbr:Flow_network dbc:Network_flow_problem dbr:D._R._Fulkerson dbr:Algorithm
owl:sameAs
n4:eYFy dbpedia-fa:الگوریتم_خروج_از_آشفتگی wikidata:Q16893660 freebase:m.0y7wpqq
dbp:wikiPageUsesTemplate
dbt:YouTube dbt:Nnbsp dbt:Reflist
dbp:id
JaDnsMbeUkE
dbp:title
Algoritmo Out-of-Kilter
dbo:abstract
The out-of-kilter algorithm is an algorithm that computes the solution to the minimum-cost flow problem in a flow network. It was published in 1961 by D. R. Fulkerson  and is described here. The analog of steady state flow in a network of nodes and arcs may describe a variety of processes. Examples include transportation systems & personnel assignment actions. Arcs generally have cost & capacity parameters. A recurring problem is trying to determine the minimum cost route between two points in a capacitated network. The idea of the algorithm is to identify out-of-kilter arcs and modify the flow network until all arcs are in-kilter and a minimum cost flow has been reached. The algorithm can be used to minimize the total cost of a constrained flow in an oriented network.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Out-of-kilter_algorithm?oldid=1003490700&ns=0
dbo:wikiPageLength
3604
foaf:isPrimaryTopicOf
wikipedia-en:Out-of-kilter_algorithm
Subject Item
dbr:Out-of-Kilter_algorithm
dbo:wikiPageWikiLink
dbr:Out-of-kilter_algorithm
dbo:wikiPageRedirects
dbr:Out-of-kilter_algorithm
Subject Item
wikipedia-en:Out-of-kilter_algorithm
foaf:primaryTopic
dbr:Out-of-kilter_algorithm