A Low Complexity Branch and Bound Approach to Optimal Spectrum Balancing for Digital Subscriber Lines.
Paschalis TsiaflakisJan VangorpMarc MoonenJan VerlindenPublished in: GLOBECOM (2006)
Keyphrases
- low complexity
- branch and bound
- optimal solution
- branch and bound algorithm
- lower bound
- search algorithm
- column generation
- search space
- upper bound
- motion estimation
- tree search
- computational complexity
- branch and bound method
- combinatorial optimization
- branch and bound procedure
- implicit enumeration
- lower complexity
- dynamic programming
- network design problem
- mode decision
- randomly generated problems
- tree search algorithm
- branch and bound search
- lagrangian heuristic
- neural network
- linear programming relaxation
- knapsack problem
- evolutionary algorithm