Statements (36)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:complexity |
NP-hard (in general)
|
| gptkbp:field |
gptkb:mathematics
computer science operations research |
| gptkbp:generalizes |
single-commodity flow problem
|
| gptkbp:hasApplication |
gptkb:transportation
logistics telecommunications supply chain management traffic engineering |
| gptkbp:hasSpecialCase |
fractional multicommodity flow
integer multicommodity flow unsplittable flow problem |
| https://www.w3.org/2000/01/rdf-schema#label |
multicommodity flow problem
|
| gptkbp:parameter |
network graph
edge capacities costs per edge set of commodities supply and demand for each commodity |
| gptkbp:prohibits |
capacity constraint
flow conservation |
| gptkbp:relatedTo |
linear programming
network flow maximum flow problem minimum cost flow problem |
| gptkbp:solvedBy |
linear programming
approximation algorithms decomposition methods |
| gptkbp:studiedBy |
1960s
|
| gptkbp:usedIn |
routing
resource allocation network design |
| gptkbp:variant |
flow for each commodity
|
| gptkbp:bfsParent |
gptkb:Dantzig–Wolfe_decomposition
|
| gptkbp:bfsLayer |
6
|