Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound.
Kaj HolmbergJohan HellstrandPublished in: Oper. Res. (1998)
Keyphrases
- network design problem
- branch and bound
- combinatorial optimization
- heuristic solution
- branch and bound search
- network flow problem
- benders decomposition
- search algorithm
- optimal solution
- branch and bound procedure
- lower bound
- branch and bound algorithm
- column generation
- tree search
- lagrangian heuristic
- mixed integer programming
- upper bound
- search strategies
- depth first search
- linear programming relaxation
- traveling salesman problem
- search space
- simulated annealing
- lagrangian relaxation
- metaheuristic
- network design
- lp relaxation
- tabu search
- heuristic search
- optimization problems
- timetabling problem
- knapsack problem
- approximation algorithms
- exact solution
- objective function
- exact algorithms
- mixed integer
- lower and upper bounds
- valid inequalities
- search heuristics
- feasible solution
- dynamic programming
- special case