Solving the sensor cover energy problem via integer linear programming

Title:

Solving the sensor cover energy problem via integer linear programming

Creator:

Li, Pingke

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:1c844f26-3951-4c44-b730-ea5ccbdfd4d2
uuid:1c844f26-3951-4c44-b730-ea5ccbdfd4d2
doi:10.14736/kyb-2021-4-0568

Subject:

max-plus algebra, sensor coverage problem, and integer linear programming

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

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.

Language:

English

Rights:

http://creativecommons.org/licenses/by-nc-sa/4.0/
policy:public

Coverage:

568-593

Source:

Kybernetika | 2021 Volume:57 | Number:4

Harvested from:

CDK

Metadata only:

false