Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_optimization_problem
|
| gptkbp:application |
logistics
telecommunications supply chain management transportation networks |
| gptkbp:can_be_formulated_as |
linear program
|
| gptkbp:complexity |
NP-hard (in general)
|
| gptkbp:describes |
flow of multiple commodities through a network
|
| gptkbp:field |
gptkb:network_protocol
computer science operations research |
| gptkbp:generalizes |
maximum flow problem
minimum cost flow problem |
| gptkbp:introducedIn |
1963
|
| gptkbp:involves |
capacity constraints on edges
flow conservation constraints multiple source-sink pairs |
| gptkbp:relatedTo |
routing
network flow congestion minimization |
| gptkbp:solvedBy |
linear programming
approximation algorithms decomposition methods |
| gptkbp:studiedBy |
T. C. Hu
|
| gptkbp:bfsParent |
gptkb:Network_Optimization
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Multicommodity Flow Problem
|