A capacity scaling heuristic for the multicommodity capacitated network design problem.
N. KatayamaM. ChenM. KuboPublished in: J. Comput. Appl. Math. (2009)
Keyphrases
- network design problem
- capacitated fixed charge
- heuristic solution
- network design
- mixed integer programming
- benders decomposition
- approximation algorithms
- lagrangian relaxation
- network flow problem
- branch and bound
- minimal cost
- integer programming
- mixed integer
- valid inequalities
- transportation networks
- lagrangian heuristic
- facility location
- feasible solution
- communication networks
- branch and bound algorithm
- dynamic programming
- search algorithm
- exact solution
- lower and upper bounds
- neural network
- network architecture
- simulated annealing
- special case
- evolutionary algorithm
- optimal solution
- genetic algorithm