A strongly polynomial Contraction-Expansion algorithm for network flow problems.
Jean Bertrand GauthierJacques DesrosiersMarco E. LübbeckePublished in: Comput. Oper. Res. (2017)
Keyphrases
- strongly polynomial
- search space
- optimal solution
- network flow problem
- network flow
- linear programming
- computational complexity
- cost function
- optimization algorithm
- dynamic programming
- worst case
- combinatorial optimization
- shortest path problem
- network design problem
- simplex algorithm
- np hard
- minimum cost flow
- multi objective
- network simplex algorithm