A branch and bound approach to speed up the sphere decoder.
Mihailo StojnicHaris VikaloBabak HassibiPublished in: ICASSP (3) (2005)
Keyphrases
- branch and bound
- lower bound
- search algorithm
- branch and bound algorithm
- upper bound
- search space
- optimal solution
- column generation
- combinatorial optimization
- tree search
- branch and bound procedure
- network design problem
- branch and bound search
- beam search
- branch and bound method
- search strategies
- np hard
- search tree
- linear programming relaxation
- tree search algorithm
- mini bucket
- multi agent
- lower and upper bounds
- depth first search