| Article ID: | iaor2007295 |
| Country: | Netherlands |
| Volume: | 11 |
| Issue: | 3 |
| Start Page Number: | 341 |
| End Page Number: | 346 |
| Publication Date: | May 2006 |
| Journal: | Journal of Combinatorial Optimization |
| Authors: | Gabrel Virginie |
| Keywords: | programming: integer, graphs, combinatorial optimization, heuristics |
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.