An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions.
Pan XuLizhi WangPublished in: Comput. Oper. Res. (2014)
Keyphrases
- simplifying assumptions
- mixed integer linear programming
- branch and bound algorithm
- cutting plane
- integer programming
- lower bound
- linear programming
- column generation
- branch and bound
- mixed integer linear program
- optimal solution
- upper bound
- combinatorial optimization
- np hard
- mathematical programming
- production planning
- network flow
- integer program
- scheduling problem