Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem

Michel Vasquez () and Jin-Kao Hao ()
Additional contact information
Michel Vasquez: LGI2P-EMA, Parc Scientifique G. Besse
Jin-Kao Hao: LERIA Université d'Angers

Journal of Combinatorial Optimization, 2003, vol. 7, issue 1, No 6, 87-103

Abstract: Abstract This paper introduces tight upper bounds for the daily photograph scheduling problem of earth observation satellites. These bounds, which were unavailable until now, allow us to assess the quality of the heuristic solutions obtained previously. These bounds are obtained with a partition-based approach following the “divide and pas conquer” principle. Dynamic programming and tabu search are conjointly used in this approach. We present also simplex-based linear programming relaxation and a relaxed knapsack approach for the problem.

Keywords: bounds; partition; constraint relaxation; tabu search; branch & bound (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://link.springer.com/10.1023/A:1021950608048 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:7:y:2003:i:1:d:10.1023_a:1021950608048

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1021950608048

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().