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

    loading  Checking for direct PDF access through Ovid

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.

Related Topics

    loading  Loading Related Articles