Abstract
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic and stochastic cases using linear 0-1 programming techniques. Equivalent formulations are developed in terms of cardinality constraints. We conducted numerical case studies and analyzed the performance of optimization solvers on the considered problem instances.
| Original language | English |
|---|---|
| Pages (from-to) | 35-51 |
| Number of pages | 17 |
| Journal | Journal of Combinatorial Optimization |
| Volume | 22 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jul 2011 |
Keywords
- Combinatorial optimization
- Mathematical programming
- Multi-sensor scheduling
- Risk measures
- Robust optimization
Fingerprint
Dive into the research topics of 'Robust multi-sensor scheduling for multi-site surveillance'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver