Solving the sensor cover energy problem via integer linear programming
Kybernetika, Tome 57 (2021) no. 4, pp. 568-593
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
This paper demonstrates that the sensor cover energy problem in wireless communication can be transformed into a linear programming problem with max-plus linear inequality constraints. Consequently, by a well-developed preprocessing procedure, it can be further reformulated as a 0-1 integer linear programming problem and hence tackled by the routine techniques developed in linear and integer optimization. The performance of this two-stage solution approach is evaluated on a set of randomly generated instances and demonstrates that it is capable of solving large size instances of the sensor cover energy problem.
DOI :
10.14736/kyb-2021-4-0568
Classification :
15A80, 52C15, 90C10
Keywords: sensor coverage problem; max-plus algebra; integer linear programming
Keywords: sensor coverage problem; max-plus algebra; integer linear programming
@article{10_14736_kyb_2021_4_0568,
author = {Li, Pingke},
title = {Solving the sensor cover energy problem via integer linear programming},
journal = {Kybernetika},
pages = {568--593},
publisher = {mathdoc},
volume = {57},
number = {4},
year = {2021},
doi = {10.14736/kyb-2021-4-0568},
zbl = {07478629},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.14736/kyb-2021-4-0568/}
}
TY - JOUR AU - Li, Pingke TI - Solving the sensor cover energy problem via integer linear programming JO - Kybernetika PY - 2021 SP - 568 EP - 593 VL - 57 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.14736/kyb-2021-4-0568/ DO - 10.14736/kyb-2021-4-0568 LA - en ID - 10_14736_kyb_2021_4_0568 ER -
Li, Pingke. Solving the sensor cover energy problem via integer linear programming. Kybernetika, Tome 57 (2021) no. 4, pp. 568-593. doi: 10.14736/kyb-2021-4-0568
Cité par Sources :