- freely available
- re-usable
Algorithms 2009, 2(1), 565-581; doi:10.3390/a2010565
Review
Mathematical Programming Techniques for Sensor Networks
1
Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611-6595, United States
2
University of Florida Research and Engineering Education Facility (UF-REEF), Department of Industrial and Systems Engineering, 1350 N Poquito Road, Shalimar, FL 32579, United States
* Author to whom correspondence should be addressed.
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)
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
Article Statistics
Click here to load and display the download statistics.Cite This Article
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 StyleSorokin A., Boyko N., Boginski V., Uryasev S., Pardalos P.M. Mathematical Programming Techniques for Sensor Networks. Algorithms. 2009; 2(1):565-581.
Chicago/Turabian StyleSorokin, 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 Publishing, Basel, Switzerland
RSS
E-Mail Table of Contents Alert
