Strengthened 0-1 linear formulation for the daily satellite mission planning |
| |
| Authors: | Virginie Gabrel |
| |
| Affiliation: | (1) LAMSADE Place du Maréchal de Lattre de Tassigny, University Paris 9, 75775 Paris Cedex 16, France |
| |
| Abstract: | 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. |
| |
| Keywords: | Integer programming Stable set polytope Satellite mission planning Cocomparability graph |
| 本文献已被 SpringerLink 等数据库收录！ |
