Statements (26)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:application |
logistics
telecommunications supply chain management transportation problem network flow optimization |
| gptkbp:basedOn |
gptkb:simplex_algorithm
|
| gptkbp:complexity |
polynomial time for special cases
|
| gptkbp:developedBy |
gptkb:James_B._Orlin
gptkb:George_B._Dantzig |
| gptkbp:field |
gptkb:mathematical_optimization
computer science operations research |
| gptkbp:firstPublished |
1960s
|
| gptkbp:input |
gptkb:graph
capacities costs supplies and demands |
| gptkbp:output |
minimum-cost flow
|
| gptkbp:relatedTo |
network flow algorithms
simplex method minimum-cost flow problem |
| gptkbp:solvedBy |
minimum-cost flow problem
|
| gptkbp:bfsParent |
gptkb:Earth_Mover's_Distance
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
network simplex algorithm
|