An enhanced branch-and-bound algorithm for bilevel integer linear programming.
Shaonan LiuMingzheng WangNan KongXiangpei HuPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- branch and bound algorithm
- integer linear programming
- column generation
- branch and bound
- lower bound
- boolean satisfiability
- optimal solution
- randomly generated
- upper bound
- linear programming
- precedence constraints
- np hard
- cutting plane
- combinatorial optimization
- lower bounding
- search tree
- boolean optimization
- randomly generated problems
- search space
- single machine scheduling problem
- branch and bound method
- global constraints
- integer programming
- upper bounding
- symmetry breaking
- combinatorial problems
- mixed integer programming
- max sat
- search algorithm
- integer program
- linear program
- finding an optimal solution
- tree search
- exact solution