A column generation heuristic for optimal wireless sensor network design with mobile sinks
type: Item
instance of: scholarly article
title: A column generation heuristic for optimal wireless sensor network design with mobile sinks
zbMATH Open document ID: 1402.90031
author: M. Emre Keskin
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6875771
zbMATH Keywords: computing science
zbMATH Keywords: integer programming
zbMATH Keywords: column generation
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: OR in telecommunications
describes a project that uses: Knapsack
describes a project that uses: Gurobi
describes a project that uses: OMNet++
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.12.006
OpenAlex ID: W2560383805
cites work: Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks
cites work: Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
cites work: Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks
cites work: Stabilized column generation
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Generalized Bundle Methods
cites work: Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks
cites work: Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks
cites work: A branch-and-price algorithm for the capacitated facility location problem
cites work: Robust scheduling of wireless sensor networks for target tracking under uncertainty
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
cites work: Optimal placement, scheduling, and routing to maximize lifetime in sensor networks
cites work: A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks
cites work: Q4354953
cites work: A Jackson network model and threshold policy for joint optimization of energy and delay in multi-hop wireless networks
DOI: 10.1016/J.EJOR.2016.12.006
description: scientific article; zbMATH DE number 6875771