Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems.
Fred W. GloverDavid KarneyDarwin KlingmanPublished in: Networks (1974)
Keyphrases
- primal dual
- minimum cost
- network flow problem
- approximation algorithms
- network simplex algorithm
- simplex algorithm
- np hard
- linear programming
- network design problem
- network flow
- linear program
- linear programming problems
- interior point methods
- special case
- convex optimization
- worst case
- algorithm for linear programming
- interior point
- mixed integer
- convergence rate
- simplex method
- minimal cost
- lower bound
- np complete
- genetic algorithm
- valid inequalities
- evolutionary algorithm