Hybrid heuristic for Capacitated Network Design Problem.
Meriem KhelifiMalika BabesSalim GhanemiMohand Yazid SaidiSaadi BoudjitPublished in: J. High Speed Networks (2015)
Keyphrases
- network design problem
- network design
- approximation algorithms
- network flow problem
- branch and bound
- heuristic solution
- minimal cost
- mixed integer programming
- transportation networks
- integer programming
- mixed integer
- valid inequalities
- lagrangian relaxation
- worst case
- dynamic programming
- neural network
- lot sizing
- exact solution
- column generation
- communication networks
- traveling salesman problem
- linear programming
- optimization problems
- np hard
- search algorithm