Improved complexity analysis of branch and bound for hybrid MPC.
Daniel AxehillManfred MorariPublished in: CDC (2010)
Keyphrases
- branch and bound
- complexity analysis
- lower bound
- upper bound
- branch and bound algorithm
- search algorithm
- column generation
- optimal solution
- search space
- beam search
- theoretical analysis
- tree search algorithm
- tree search
- branch and bound method
- branch and bound procedure
- combinatorial optimization
- randomly generated problems
- max sat
- branch and bound search
- network design problem
- integer programming problems
- lagrangian heuristic
- search strategies
- objective function
- linear programming relaxation
- first order logic
- lower and upper bounds
- computational complexity
- neural network
- depth first search
- linear programming
- bayesian networks