A new algorithm for solving the feasibility problem of a network flow.
Hassan Salehi FathabadiMehdi GhiyasvandPublished in: Appl. Math. Comput. (2007)
Keyphrases
- network flow
- objective function
- learning algorithm
- min cost
- np hard
- dynamic programming
- optimization algorithm
- combinatorial optimization
- convex hull
- network flow problem
- worst case
- segmentation algorithm
- search space
- computational complexity
- cost function
- upper bound
- simulated annealing
- linear programming
- energy function