A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion.
John FreidenfeldsC. D. McLaughlinPublished in: Oper. Res. (1979)
Keyphrases
- branch and bound algorithm
- capacity expansion
- mixed integer programming
- lagrangian relaxation
- optimal solution
- finding an optimal solution
- lower bounding
- combinatorial optimization
- branch and bound method
- variable ordering
- mathematical programming
- branch and bound
- lower bound
- mixed integer programming model
- production planning
- np hard
- upper bound
- multistage
- column generation
- single machine scheduling problem
- search algorithm
- capacity planning
- knapsack problem
- valid inequalities
- simulated annealing
- network design problem
- search space
- neural network
- linear programming relaxation
- planning horizon
- distribution network
- linear programming
- search strategies
- metaheuristic
- optimization problems
- dynamic programming
- bayesian networks