Discrete Spatial Compression beyond Beamspace Channel Sparsity Based on Branch-and-Bound.
Zhiyuan JiangSheng ZhouZhisheng NiuPublished in: ICC (2018)
Keyphrases
- branch and bound
- branch and bound algorithm
- lower bound
- search algorithm
- column generation
- search space
- upper bound
- optimal solution
- combinatorial optimization
- randomly generated problems
- branch and bound method
- data compression
- tree search
- search strategies
- branch and bound procedure
- beam search
- branch and bound search
- network design problem
- lagrangian heuristic
- image compression
- tree search algorithm
- compression algorithm
- max sat
- compression ratio
- genetic algorithm
- lagrangian relaxation
- partial solutions
- linear programming relaxation
- search tree
- np hard
- integer programming problems