Algorithms 2009, 2(1), 565-581; doi:10.3390/a2010565
Review

Mathematical Programming Techniques for Sensor Networks

1email, 1, 2email, 1email and 1,* email
Received: 31 October 2008; in revised form: 2 March 2009 / Accepted: 2 March 2009 / Published: 17 March 2009
(This article belongs to the Special Issue Sensor Algorithms)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: This paper presents a survey describing recent developments in the area of mathematical programming techniques for various types of sensor network applications. We discuss mathematical programming formulations associated with these applications, as well as methods for solving the corresponding problems. We also address some of the challenges arising in this area, including both conceptual and computational aspects.
Keywords: Sensor Networks; Localization; Optimization; Scheduling; Interdiction
PDF Full-text Download PDF Full-Text [365 KB, uploaded 17 March 2009 14:20 CET]

Export to BibTeX |
EndNote


MDPI and ACS Style

Sorokin, A.; Boyko, N.; Boginski, V.; Uryasev, S.; Pardalos, P.M. Mathematical Programming Techniques for Sensor Networks. Algorithms 2009, 2, 565-581.

AMA Style

Sorokin A, Boyko N, Boginski V, Uryasev S, Pardalos PM. Mathematical Programming Techniques for Sensor Networks. Algorithms. 2009; 2(1):565-581.

Chicago/Turabian Style

Sorokin, Alexey; Boyko, Nikita; Boginski, Vladimir; Uryasev, Stan; Pardalos, Panos M. 2009. "Mathematical Programming Techniques for Sensor Networks." Algorithms 2, no. 1: 565-581.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert