Interference Exploitation 1-Bit Massive MIMO Precoding: A Partial Branch-and-Bound Solution with Near-Optimal Performance.
Ang LiFan LiuChristos MasourosYonghui LiBranka VuceticPublished in: CoRR (2019)
Keyphrases
- branch and bound
- optimal solution
- search algorithm
- branch and bound algorithm
- lower bound
- branch and bound method
- column generation
- network design problem
- search space
- partial solutions
- tree search
- branch and bound procedure
- upper bound
- combinatorial optimization
- previously solved
- randomly generated problems
- metaheuristic
- implicit enumeration
- heuristic solution
- beam search
- search strategies
- knapsack problem
- integer programming problems
- linear programming relaxation
- tree search algorithm
- bnb adopt
- branch and bound search
- fading channels
- case based reasoning
- depth first search
- cutting plane
- integer program
- objective function
- max sat
- lagrangian relaxation