An algorithm to solve the proportional network flow problem.
David R. MorrisonJason J. SauppeSheldon H. JacobsonPublished in: Optim. Lett. (2014)
Keyphrases
- network flow problem
- np hard
- dynamic programming
- computational complexity
- search space
- network flow
- objective function
- worst case
- bayesian networks
- learning algorithm
- probabilistic model
- genetic algorithm
- linear programming
- expectation maximization
- multistage
- approximation algorithms
- minimal cost
- network design problem