IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v11y2006i3d10.1007_s10878-006-7912-4.html
   My bibliography  Save this article

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

Author

Listed:
  • Virginie Gabrel

    (University Paris 9)

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.

Suggested Citation

  • Virginie Gabrel, 2006. "Strengthened 0-1 linear formulation for the daily satellite mission planning," Journal of Combinatorial Optimization, Springer, vol. 11(3), pages 341-346, May.
    • Handle: RePEc:spr:jcomop:v:11:y:2006:i:3:d:10.1007_s10878-006-7912-4
    DOI: 10.1007/s10878-006-7912-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-006-7912-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-006-7912-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Michel Vasquez & Jin-Kao Hao, 2003. "Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem," Journal of Combinatorial Optimization, Springer, vol. 7(1), pages 87-103, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Glaydston Mattos Ribeiro & Miguel Fragoso Constantino & Luiz Antonio Nogueira Lorena, 2010. "Strong formulation for the spot 5 daily photograph scheduling problem," Journal of Combinatorial Optimization, Springer, vol. 20(4), pages 385-398, November.
    2. Zhang Ye & Hu Xiaoxuan & Zhu Waiming & Jin Peng, 2018. "Solving the Observing and Downloading Integrated Scheduling Problem of Earth Observation Satellite with a Quantum Genetic Algorithm," Journal of Systems Science and Information, De Gruyter, vol. 6(5), pages 399-420, October.
    3. Kai Yang & Cong Tian & Nan Zhang & Zhenhua Duan & Hongwei Du, 2019. "A temporal logic programming approach to planning," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 402-420, August.
    4. Chen, Xiaoyu & Reinelt, Gerhard & Dai, Guangming & Spitz, Andreas, 2019. "A mixed integer linear programming model for multi-satellite scheduling," European Journal of Operational Research, Elsevier, vol. 275(2), pages 694-707.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chen, Xiaoyu & Reinelt, Gerhard & Dai, Guangming & Spitz, Andreas, 2019. "A mixed integer linear programming model for multi-satellite scheduling," European Journal of Operational Research, Elsevier, vol. 275(2), pages 694-707.
    2. Glaydston Mattos Ribeiro & Miguel Fragoso Constantino & Luiz Antonio Nogueira Lorena, 2010. "Strong formulation for the spot 5 daily photograph scheduling problem," Journal of Combinatorial Optimization, Springer, vol. 20(4), pages 385-398, November.
    3. Hao, Jin-Kao & Benlic, Una, 2011. "Lower bounds for the ITC-2007 curriculum-based course timetabling problem," European Journal of Operational Research, Elsevier, vol. 212(3), pages 464-472, August.
    4. Bianchessi, Nicola & Cordeau, Jean-Francois & Desrosiers, Jacques & Laporte, Gilbert & Raymond, Vincent, 2007. "A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites," European Journal of Operational Research, Elsevier, vol. 177(2), pages 750-762, March.
    5. J-F Cordeau & G Laporte, 2005. "Maximizing the value of an Earth observation satellite orbit," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 962-968, August.
    6. Xiao, Yiyong & Zhang, Siyue & Yang, Pei & You, Meng & Huang, Jiaoying, 2019. "A two-stage flow-shop scheme for the multi-satellite observation and data-downlink scheduling problem considering weather uncertainties," Reliability Engineering and System Safety, Elsevier, vol. 188(C), pages 263-275.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:11:y:2006:i:3:d:10.1007_s10878-006-7912-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.