Dual-based approach for a hub network design problem under non-restrictive policy.
C. S. SungH. W. JinPublished in: Eur. J. Oper. Res. (2001)
Keyphrases
- network design problem
- approximation algorithms
- network design
- benders decomposition
- branch and bound
- primal dual
- mixed integer programming
- mixed integer
- minimal cost
- integer programming
- transportation networks
- valid inequalities
- lagrangian relaxation
- optimal policy
- lot sizing
- genetic algorithm
- communication networks
- road network
- linear programming
- np hard
- lower bound
- optimal solution