Efficient implementation of heuristics for the continuous network design problem.
Patrice MarcotteGérald MarquisPublished in: Ann. Oper. Res. (1992)
Keyphrases
- efficient implementation
- network design problem
- heuristic solution
- approximation algorithms
- network design
- branch and bound
- active set
- transportation networks
- minimal cost
- mixed integer programming
- mixed integer
- integer programming
- search algorithm
- exact algorithms
- lagrangian relaxation
- random variables
- np hard
- continuous variables
- valid inequalities
- network architecture
- knapsack problem
- branch and bound algorithm
- worst case
- evolutionary algorithm
- lower bound