Substitutes and complements in network flow problems.
David GaleThemistocles PolitofPublished in: Discret. Appl. Math. (1981)
Keyphrases
- network flow problem
- minimum cost
- minimal cost
- network flow
- network design problem
- fixed charge
- network simplex algorithm
- mixed integer
- np hard
- approximation algorithms
- transportation problem
- linear programming
- network design
- mixed integer programming
- valid inequalities
- feasible solution
- shortest path
- minimum cost flow
- bayesian networks