| Article ID: | iaor20115760 |
| Volume: | 22 |
| Issue: | 1 |
| Start Page Number: | 35 |
| End Page Number: | 51 |
| Publication Date: | Jul 2011 |
| Journal: | Journal of Combinatorial Optimization |
| Authors: | Uryasev Stanislav, Boginski Vladimir, Zrazhevsky Grigoriy, Pardalos M, Boyko Nikita, Turko Timofey, Jeffcoat E |
| Keywords: | optimization, scheduling |
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.