Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_optimization
|
| gptkbp:application |
gptkb:transportation
logistics supply chain management |
| gptkbp:field |
computer science
operations research |
| gptkbp:formulatedAs |
gptkb:graph
|
| gptkbp:input |
network with capacities and costs
|
| gptkbp:objective |
minimize total cost
|
| gptkbp:output |
flow assignment with minimum cost
|
| gptkbp:prohibits |
capacity constraint
flow conservation |
| gptkbp:relatedTo |
linear programming
network flow assignment problem maximum flow problem transportation problem |
| gptkbp:solvedBy |
gptkb:network_simplex_algorithm
cycle canceling algorithm successive shortest path algorithm |
| gptkbp:bfsParent |
gptkb:Network_Optimization
gptkb:Network_Flow_Algorithms |
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Minimum Cost Flow Problem
|