A column generation heuristic for optimal wireless sensor network design with mobile sinks
From MaRDI portal
Publication:1753436
DOI10.1016/j.ejor.2016.12.006zbMath1402.90031OpenAlexW2560383805MaRDI QIDQ1753436
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.12.006
Integer programming (90C10) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Exact and heuristic approaches for maximizing flows in UAV-enabled wireless cellular networks with multi-hop backhauls ⋮ Dealing with residual energy when transmitting data in energy-constrained capacitated networks
Uses Software
Cites Work
- Unnamed Item
- Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks
- Robust scheduling of wireless sensor networks for target tracking under uncertainty
- Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks
- A branch-and-price algorithm for the capacitated facility location problem
- Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks
- Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks
- A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks
- Stabilized column generation
- Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
- A Jackson network model and threshold policy for joint optimization of energy and delay in multi-hop wireless networks
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
- Generalized Bundle Methods
- Optimal placement, scheduling, and routing to maximize lifetime in sensor networks
This page was built for publication: A column generation heuristic for optimal wireless sensor network design with mobile sinks
