A Branch and Bound Algorithm for the Critical Grid Coverage Problem in Wireless Sensor Networks.
Maher RebaiMatthieu Le BerreFaicel HnaienHichem SnoussiLyes KhoukhiPublished in: Int. J. Distributed Sens. Networks (2014)
Keyphrases
- branch and bound algorithm
- wireless sensor networks
- lower bound
- branch and bound
- np hard
- upper bound
- test problems
- optimal solution
- lower bounding
- combinatorial optimization
- sensor networks
- search tree
- single machine scheduling problem
- precedence constraints
- sensor nodes
- upper bounding
- variable ordering
- routing protocol
- randomly generated problems
- mixed integer linear programming
- search algorithm
- lagrangian relaxation
- energy consumption
- finding an optimal solution
- maximum clique
- column generation
- feasible solution
- branch and bound method