Finding Maximum Minimum Cost Flows to Evaluate Gas Network Capacities.
Kai HoppmannRobert SchwarzPublished in: OR (2017)
Keyphrases
- minimum cost
- network flow
- network flow problem
- spanning tree
- np hard
- approximation algorithms
- capacity constraints
- network simplex algorithm
- complex networks
- minimum cost flow
- network structure
- shortest path algorithm
- origin destination
- communication networks
- genetic algorithm
- undirected graph
- worst case
- upper bound
- similarity measure
- minimum cost path