A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints.
Fabian CastañoAndré RossiMarc SevauxNubia VelascoPublished in: Comput. Oper. Res. (2014)
Keyphrases
- column generation
- wireless sensor networks
- integer program
- constraint programming
- linear programming problems
- branch and bound
- energy consumption
- linear programming
- vehicle routing
- mixed integer programming
- set partitioning
- integer programming
- linear program
- valid inequalities
- integer linear programming
- lagrangean relaxation
- network connectivity
- data gathering
- linear relaxation
- energy efficient
- dual variables
- lagrangian relaxation
- cutting plane
- exact solution
- sensor networks
- network lifetime
- set covering
- multi hop
- maximum lifetime
- constraint satisfaction
- routing algorithm
- optimal solution
- lp relaxation
- genetic algorithm
- base station
- search algorithm
- dantzig wolfe
- global constraints
- energy efficiency
- vehicle routing problem with time windows
- upper bound
- search space
- lower bound
- dantzig wolfe decomposition