Strengthened 0-1 linear formulation for the daily satellite mission planning

Thumbnail
Date
2006
Dewey
Recherche opérationnelle
Sujet
Stable set polytope; Satellite mission planning; Integer programming
Journal issue
Journal of Combinatorial Optimization
Volume
11
Number
3
Publication date
2006
Article pages
341-346
Publisher
Springer Netherlands
DOI
http://dx.doi.org/10.1007/s10878-006-7912-4
URI
https://basepub.dauphine.fr/handle/123456789/2483
Collections
Metadata
Show full item record
Author
Gabrel, Virginie
Type
Article accepté pour publication ou publié
Abstract (EN)
In this paper, we compare several 0-1 linear programs for solving the satellite mission planning problem. We prove that one of them presents a smaller integrality gap. Our explanation is based on stable set polytope formulations for perfect graphs.