A Cost-Scaling Algorithm for Minimum-Cost Node-Capacitated Multiflow Problem.
Hiroshi HiraiMotoki IkedaPublished in: CoRR (2019)
Keyphrases
- minimum cost
- np hard
- network flow problem
- dynamic programming
- undirected graph
- spanning tree
- network flow
- computational complexity
- worst case
- tree structure
- minimal cost
- approximation algorithms
- minimum cost flow
- optimal solution
- transportation problem
- shortest path problem
- graph structure
- path planning
- linear programming
- simulated annealing