Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Barcia P, Cerdeira JO (2003) Node packings on cocomparability graphs. Oper Res Lett 31: 341–342

    Article  MathSciNet  Google Scholar 

  • Bensanna E, Verfaillie G, Agnése JC, Bataille N, Blumstein D (1996) Exact and approximate methods for the daily management of an earth observation satellite. In: Proc. of the 4th Int. Symposium on Space Mission Operations and Ground Data Systems, Munich, Germany

  • Bensanna E, Lemaître M, Verfaillie G (1999) Earth observation satellite management. Constraints 4: 293–299

    Article  Google Scholar 

  • Gabrel V, Murat C (2003) Mathematical programming for earth observation satellite mission planning. In: Ciriani TA, Fasano G, Gliozzi S, Tadei R (ed.) Operations Research in Space and Air, Kluwer Academic Publishers, pp. 103–122

  • Gabrel V (2005) An extensive comparison of 0–1 linear programs for SPOT5 daily mission planning problem. Annales du LAMSADE no. 4–5

  • Gilmore PC, Hoffman AJ (1964) A characterization of comparability graphs and of interval graphs. Can J Math 16: 539–548

    MathSciNet  Google Scholar 

  • Grütschel M, Lovàsz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization, Springer-Verlag

  • Pnueli A, Lempel A, Even S (1971) Transitive orientation of graphs and identification of permutation graphs. Can J Math 23(1): 160–175

    MathSciNet  Google Scholar 

  • Vasquez M, Hao JK (2001) A Ȍlogic-constrainedȍ knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite. J Comp Optim and Appl 20: 137–157

    Article  MathSciNet  Google Scholar 

  • Vasquez M, Hao JK (2003) Upper bounds for the SPOT5 Daily Photograph Scheduling Problem. J Comb Optim 7: 87–103

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LAMSADE Place du Maréchal de Lattre de Tassigny, University Paris 9, 75775, Paris Cedex 16, France

    Virginie Gabrel

Authors
  1. Virginie Gabrel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Virginie Gabrel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gabrel, V. Strengthened 0-1 linear formulation for the daily satellite mission planning. J Comb Optim 11, 341–346 (2006). https://doi.org/10.1007/s10878-006-7912-4

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-006-7912-4

Keywords

Search

Navigation