Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem.
Graciano SáPublished in: Oper. Res. (1969)
Keyphrases
- approximate solutions
- branch and bound
- np hard
- optimal solution
- network design problem
- lower bound
- branch and bound algorithm
- column generation
- upper bound
- exact solution
- combinatorial optimization
- search space
- np complete
- search algorithm
- beam search
- approximation algorithms
- linear programming
- heuristic solution
- vehicle routing problem
- knapsack problem
- branch and bound procedure
- branch and bound method
- tree search
- tree search algorithm
- lot sizing
- linear program
- randomly generated problems
- computational complexity
- max sat
- branch and bound search
- feasible solution
- lower and upper bounds
- integer programming
- benchmark problems
- special case
- lagrangian relaxation
- metaheuristic
- computer vision
- integer programming problems
- lagrangian heuristic