Wireless sensor networks modeling as a probabilistic combinatorial optimization problem.
Afef GhabriMonia BellalounaPublished in: SNPD (2015)
Keyphrases
- combinatorial optimization
- wireless sensor networks
- traveling salesman problem
- metaheuristic
- combinatorial optimization problems
- simulated annealing
- branch and bound
- branch and bound algorithm
- mathematical programming
- combinatorial problems
- optimization problems
- hard combinatorial optimization problems
- probabilistic model
- memetic algorithm
- vehicle routing problem
- path relinking
- data aggregation
- neural network
- max flow min cut
- energy consumption
- energy efficient
- tabu search
- multi hop
- generative model
- quadratic assignment problem
- sensor networks
- submodular functions
- upper bound
- lower bound