Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks
DOI10.1016/J.COR.2015.02.001zbMath1348.90174OpenAlexW2015871869MaRDI QIDQ337548
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.02.001
Lagrangian relaxationsimulated annealinglifetime maximizationweighted Dantzig-Wolfe decompositionwireless sensor network design
Mixed integer programming (90C11) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Uses Software
Cites Work
- Optimization by Simulated Annealing
- 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
- Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
- Decomposition Principle for Linear Programs
- The Decomposition Algorithm for Linear Programs
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Optimal placement, scheduling, and routing to maximize lifetime in sensor networks
- Unnamed Item
This page was built for publication: Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks