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

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.

• Type: Journal
• Year: 2006
• Where: JCO
• Authors: Virginie Gabrel
• Keywords: JCO 2006, Mission Planning Problem, Set Polytope Formulations, Smaller Integrality Gap