Date
2006
Indexation documentaire
Recherche opérationnelle
Subject
Stable set polytope; Satellite mission planning; Integer programming
Nom de la revue
Journal of Combinatorial Optimization
Volume
11
Numéro
3
Date de publication
2006
Pages article
341-346
Nom de l'éditeur
Springer Netherlands
Type
Article accepté pour publication ou publié
Résumé en anglais
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.
