A parametric branch and bound approach to suboptimal explicit hybrid MPC.
Daniel AxehillThomas BesselmannDavide Martino RaimondoManfred MorariPublished in: Autom. (2014)
Keyphrases
- branch and bound
- branch and bound algorithm
- lower bound
- search algorithm
- column generation
- search space
- upper bound
- optimal solution
- branch and bound procedure
- beam search
- network design problem
- combinatorial optimization
- lagrangian heuristic
- search strategies
- randomly generated problems
- branch and bound method
- tree search
- tree search algorithm
- depth first search
- linear programming relaxation
- integer programming problems
- max sat
- bnb adopt
- branch and bound search
- lower and upper bounds
- genetic algorithm
- lot sizing
- heuristic search
- cost function
- objective function