New formulations and solution procedures for the hop constrained network design problem.
Hasan PirkulSamit SoniPublished in: Eur. J. Oper. Res. (2003)
Keyphrases
- network design problem
- valid inequalities
- network design
- benders decomposition
- approximation algorithms
- integer programming
- branch and bound
- mixed integer
- mixed integer programming
- minimal cost
- lower and upper bounds
- linear programming
- transportation networks
- traveling salesman problem
- feasible solution
- lagrangian relaxation
- lower bound
- cutting plane
- column generation
- primal dual
- search algorithm
- upper bound
- branch and bound algorithm
- multistage
- dynamic programming
- search space
- lagrangian heuristic