Column generation algorithm for sensor coverage scheduling under bandwidth constraints
From MaRDI portal
Publication:5326765
DOI10.1002/net.20466zbMath1269.68039OpenAlexW2006903707MaRDI QIDQ5326765
Alok Singh, André Rossi, Marc Sevaux
Publication date: 6 August 2013
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20466
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (8)
Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks ⋮ Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage ⋮ Robust scheduling of wireless sensor networks for target tracking under uncertainty ⋮ A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints ⋮ Maximizing lifetime in wireless sensor networks with multiple sensor families ⋮ An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges ⋮ Minimum energy target tracking with coverage guarantee in wireless sensor networks ⋮ An integer programming formulation of the key management problem in wireless sensor networks
Cites Work
- Maximizing system lifetime in wireless sensor networks
- Optimization scheme for sensor coverage scheduling with bandwidth constraints
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Models and algorithms for three-stage two-dimensional bin packing
- On the Cover Scheduling Problem in Wireless Sensor Networks
- A Linear Programming Approach to the Cutting-Stock Problem
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- Selected Topics in Column Generation
This page was built for publication: Column generation algorithm for sensor coverage scheduling under bandwidth constraints
