On the wireless local area network design problem with performance guarantees.
Abderraouf BahriSteven ChamberlandPublished in: Comput. Networks (2005)
Keyphrases
- network design problem
- approximation algorithms
- network design
- benders decomposition
- minimal cost
- branch and bound
- mixed integer
- transportation networks
- mixed integer programming
- integer programming
- valid inequalities
- search algorithm
- lagrangian relaxation
- exact solution
- convex hull
- graph cuts
- particle swarm optimization
- moving objects