A Lagrangean-based heuristics for the target covering problem in wireless sensor network

DOI10.1016/j.apm.2013.02.006zbMath1426.90259OpenAlexW1969102173MaRDI QIDQ1788968

Fethi Jarray

Publication date: 9 October 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2013.02.006

zbMATH Keywords

combinatorial optimizationLagrangean relaxationsensor schedulingmaximum set covers

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Simulation-based optimal sensor scheduling with application to observer trajectory planning
• Resource allocation in wireless networks. Theory and algorithms
• Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
• Mathematical programming techniques for sensor networks
• The wireless network jamming problem
• Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
• Target coverage optimisation of wireless sensor networks using a multi-objective immune co-evolutionary algorithm
• An Analysis and Solution of the Sensor Scheduling Problem
• Robust Wireless Network Jamming Problems

This page was built for publication: A Lagrangean-based heuristics for the target covering problem in wireless sensor network