Benders-and-cut algorithm for fixed-charge capacitated network design problem.
Varadharajan SridharJune Sung ParkPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- network design problem
- network flow problem
- fixed charge
- transportation problem
- network design
- np hard
- minimum cost
- dynamic programming
- objective function
- computational complexity
- worst case
- optimal solution
- benders decomposition
- network flow
- minimal cost
- cost function
- mixed integer
- mixed integer programming
- linear programming
- search space
- search algorithm
- convergence rate
- convex hull