A multiplication-free solution for linear minimum mean-square estimation and equalization using the branch-and-bound principle.
Tsun-Yee YanKung YaoPublished in: IEEE Trans. Inf. Theory (1980)
Keyphrases
- branch and bound
- optimal solution
- branch and bound algorithm
- lower bound
- branch and bound method
- partial solutions
- column generation
- search space
- search algorithm
- combinatorial optimization
- upper bound
- network design problem
- tree search
- previously solved
- randomly generated problems
- branch and bound procedure
- exact solution
- branch and bound search
- beam search
- implicit enumeration
- lagrangian heuristic
- lagrangian relaxation
- heuristic solution
- tree search algorithm
- optimal configuration
- sufficient conditions
- mixed integer programming
- objective function
- search strategies
- np hard
- linear program
- max sat
- integer programming
- search strategy
- integer programming problems
- heuristic search
- bnb adopt
- mathematical model
- multiple knapsack