Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications.
Balachandran VaidyanathanRavindra K. AhujaPublished in: Oper. Res. (2010)
Keyphrases
- minimum cost flow
- shortest path algorithm
- bi objective
- shortest path
- network simplex algorithm
- minimum cost
- optimization problems
- strongly polynomial
- efficient solutions
- combinatorial optimization
- worst case
- lower bound
- shortest path problem
- combinatorial optimization problems
- maximum flow
- test problems
- computational efficiency
- np complete