Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:basedOn |
gptkb:Simplex_method
|
| gptkbp:category |
gptkb:mathematical_optimization
|
| gptkbp:complexity |
Polynomial time (in practice)
|
| gptkbp:developedBy |
gptkb:Jack_Edmonds
Robert Karp |
| gptkbp:field |
gptkb:mathematical_optimization
Operations research |
| gptkbp:implementedIn |
gptkb:COIN-OR
Google OR-Tools LEMON library |
| gptkbp:input |
gptkb:Directed_graph
Edge costs Node supplies and demands |
| gptkbp:introducedIn |
1972
|
| gptkbp:output |
Minimum-cost feasible flow
|
| gptkbp:relatedTo |
Linear programming
Transportation problem Network flow |
| gptkbp:usedFor |
Minimum-cost flow problem
|
| gptkbp:bfsParent |
gptkb:Network_Optimization
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Network Simplex Method
|