Branch and bound algorithm for code spread OFDM.
Ali A. ElgharianiMichael D. ZoltowskiPublished in: SSP (2012)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- np hard
- test problems
- optimal solution
- lower bounding
- precedence constraints
- upper bounding
- mixed integer linear programming
- combinatorial optimization
- randomly generated problems
- communication systems
- branch and bound method
- lagrangian relaxation
- variable ordering
- max sat
- single machine scheduling problem
- search algorithm
- space time block
- finding an optimal solution
- neural network
- column generation
- ofdm system
- fading channels
- approximation algorithms
- linear program
- search space