Commodity family extended formulations of uncapacitated fixed charge network flow problems.
Peh H. NgRonald L. RardinPublished in: Networks (1997)
Keyphrases
- fixed charge
- network flow problem
- valid inequalities
- transportation problem
- network design
- network design problem
- minimum cost
- minimal cost
- network flow
- integer programming
- capacity expansion
- traveling salesman problem
- cutting plane
- mixed integer
- mixed integer programming
- feasible solution
- np hard
- special case
- convex hull
- neural network
- lower and upper bounds
- primal dual
- fixed cost
- column generation
- linear programming
- evolutionary algorithm