A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem.
Kaj HolmbergDi YuanPublished in: Oper. Res. (2000)
Keyphrases
- network design problem
- branch and bound
- optimal solution
- lagrangian relaxation
- branch and bound algorithm
- lower bound
- column generation
- search algorithm
- lagrangian dual
- heuristic solution
- search space
- network flow problem
- upper bound
- combinatorial optimization
- search strategies
- tree search
- metaheuristic
- lagrangian heuristic
- depth first search
- integer programming
- linear program
- max sat
- valid inequalities
- lower and upper bounds
- knapsack problem
- np hard