Near-Optimal Interference Exploitation 1-Bit Massive MIMO Precoding Via Partial Branch-and-Bound.
Ang LiFan LiuChristos MasourosYonghui LiBranka VuceticPublished in: ICASSP (2020)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- upper bound
- column generation
- search space
- optimal solution
- combinatorial optimization
- branch and bound method
- tree search
- network design problem
- branch and bound procedure
- lagrangian heuristic
- randomly generated problems
- tree search algorithm
- max sat
- beam search
- multipath
- fading channels
- branch and bound search
- search strategies
- integer programming problems
- lagrangian relaxation
- partial solutions
- linear programming relaxation
- search strategy
- np hard