Solving the sensor cover energy problem via integer linear programming.

DOI10.14736/KYB-2021-4-0568MaRDI QIDQ5033216zbMATH OpenOpenAlexFDO

Authors Pingke Li

Publication date 22 February 2022

Published in Kybernetika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14736/kyb-2021-4-0568

zbMATH Keywords

integer linear programmingmax-plus algebrasensor coverage problem

Mathematics Subject Classification ID

Max-plus and related algebras (15A80) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Linear programming (90C05) Integer programming (90C10) Combinatorial optimization (90C27)

Recommendations

• Optimizing sensor cover energy via DC programming
• An integer linear programming-based tool for wireless sensor networks
• Monotonic optimization for sensor cover energy problem
• A Lagrangean-based heuristics for the target covering problem in wireless sensor network
• On the maximization of the lifetime of a sensor network subject to limited resources

Cited in

(4)

• Monotonic optimization for sensor cover energy problem
• An integer linear programming-based tool for wireless sensor networks
• Optimizing sensor cover energy via DC programming
• On sparsity of approximate solutions to max-plus linear systems.

Describes a project that uses

Uses Software

• Matlab
• Optimization Toolbox

This page was built for publication: Solving the sensor cover energy problem via integer linear programming.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033216)