A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem.
Hiroshi HiraiMotoki IkedaPublished in: Math. Program. (2022)
Keyphrases
- lagrangian relaxation
- np hard
- minimum cost
- integer programming
- dynamic programming
- lower bound
- linear programming
- approximation algorithms
- optimal solution
- network flow problem
- np complete
- spanning tree
- worst case
- undirected graph
- network flow
- computational complexity
- path planning
- transportation problem
- tree structure
- routing problem