An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions.
Jeffrey L. ArthurJames O. FrendeweyPublished in: Networks (1994)
Keyphrases
- network flow problem
- minimum cost
- np hard
- optimal solution
- network flow
- minimal cost
- objective function
- network simplex algorithm
- dynamic programming
- search space
- spanning tree
- minimum cost flow
- worst case
- linear programming
- ant colony optimization
- computational complexity
- search algorithm
- edit operations
- genetic algorithm