On a branch-and-bound approach for a Huff-like Stackelberg location problem.
M. Elena SáizEligius M. T. HendrixJosé FernándezBlas PelegrínPublished in: OR Spectr. (2009)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- search space
- column generation
- upper bound
- combinatorial optimization
- optimal solution
- tree search
- branch and bound method
- randomly generated problems
- branch and bound procedure
- depth first search
- integer programming problems
- branch and bound search
- lagrangian heuristic
- tree search algorithm
- network design problem
- search strategies
- graphical models
- probabilistic model
- np hard