A simplex algorithm for minimum-cost network-flow problems in infinite networks.
Thomas C. SharkeyH. Edwin RomeijnPublished in: Networks (2008)
Keyphrases
- network simplex algorithm
- minimum cost
- network flow problem
- simplex algorithm
- minimum cost flow
- np hard
- network flow
- approximation algorithms
- network design problem
- linear programming
- minimal cost
- network design
- randomly generated
- linear programming problems
- primal dual
- linear program
- polynomially solvable
- special case
- network structure
- dynamic programming
- simulated annealing
- simplex method
- mixed integer
- feasible solution