A branch and bound method for the solution of multiparametric mixed integer linear programming problems.
Richard OberdieckMartina Wittmann-HohlbeinEfstratios N. PistikopoulosPublished in: J. Glob. Optim. (2014)
Keyphrases
- mixed integer
- linear programming problems
- mixed integer programming
- branch and bound method
- feasible solution
- linear program
- linear programming
- lot sizing
- optimal solution
- convex hull
- primal dual
- branch and bound algorithm
- continuous variables
- column generation
- lagrangian relaxation
- branch and bound
- mathematical model
- tabu search
- np hard
- lower bound
- multiple objectives
- genetic algorithm