An efficient branch-and-bound algorithm for compute-and-forward.
Johannes RichterChristian ScheunertEduard A. JorswieckPublished in: PIMRC (2012)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- lower bounding
- randomly generated
- upper bound
- np hard
- test problems
- precedence constraints
- optimal solution
- combinatorial optimization
- single machine scheduling problem
- search tree
- mixed integer linear programming
- variable ordering
- randomly generated problems
- upper bounding
- lagrangian relaxation
- search algorithm
- finding an optimal solution
- max sat
- neural network
- integer variables
- optimization problems
- special case