A Branch-and-Bound Algorithm for Discrete Receive Beamforming with Improved Bounds.
Johannes IsraelAndreas FischerJohn MartinovicPublished in: ICUWB (2015)
Keyphrases
- branch and bound algorithm
- lower bound
- upper bound
- branch and bound
- upper bounding
- test problems
- optimal solution
- np hard
- search tree
- lower bounding
- lower and upper bounds
- precedence constraints
- combinatorial optimization
- mixed integer linear programming
- single machine scheduling problem
- objective function
- max sat
- randomly generated problems
- lagrangian relaxation
- branch and bound method
- finding an optimal solution
- linear programming relaxation
- variable ordering
- column generation
- mathematical programming
- worst case
- bayesian networks