New Branch-and-Bound Rules for Linear Bilevel Programming.
Pierre HansenBrigitte JaumardGilles SavardPublished in: SIAM J. Sci. Comput. (1992)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- upper bound
- column generation
- optimal solution
- search space
- combinatorial optimization
- network design problem
- tree search
- branch and bound procedure
- lagrangian heuristic
- partial solutions
- randomly generated problems
- branch and bound method
- tree search algorithm
- search strategies
- integer programming problems
- beam search
- depth first search
- max sat
- branch and bound search
- max sat solver
- bayesian networks
- cost function
- evolutionary algorithm