An extended branch and bound algorithm for linear bilevel programming.
Chenggen ShiJie LuGuangquan ZhangHong ZhouPublished in: Appl. Math. Comput. (2006)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- randomly generated
- upper bound
- optimal solution
- np hard
- lower bounding
- combinatorial optimization
- precedence constraints
- test problems
- upper bounding
- search tree
- single machine scheduling problem
- max sat
- variable ordering
- branch and bound method
- mixed integer linear programming
- maximum clique
- finding an optimal solution
- randomly generated problems
- lagrangian relaxation
- cost function
- column generation
- metaheuristic
- special case
- search algorithm