A Lagrangian relaxation approach for expansion of a highway network.
Eusebio AnguloRicardo García-RódenasJosé Luis Espinosa-ArandaPublished in: Ann. Oper. Res. (2016)
Keyphrases
- lagrangian relaxation
- lower bound
- dynamic programming
- integer programming
- feasible solution
- branch and bound algorithm
- network design problem
- np hard
- capacity constraints
- machine learning
- linear programming
- lower and upper bounds
- lagrangian heuristic
- relaxation algorithm
- network design
- graphical models
- data structure