CoChat

Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem

Open access
Vasquez, Michel, Hao, Jin-Kao · 2003 · Journal of Combinatorial Optimization
Cited by 73

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1023/a:1021950608048

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Research works printed but not linked: 11

  1. R. Battiti and A.A. Bertossi, “Greedy, prohibition, and reactive heuristics for graph partitioning,” IEEE Transactions on Computers, vol. 48, no. 4, pp. 361-385, 1999. · DOI
  2. R. Bellman and D. Stuart, Applied Dynamic Programming, Princeton University Press, 1962. · DOI · Paper page
  3. E. Bensana, M. Lemaître, and G. Verfaillie, “Earth observation satellite management,” Constraints, vol. 4, no. 3, pp. 293-299, 1999. · DOI · Paper page
  4. E. Bensana, G. Verfaillie, J.C. Agnse, N. Bataille, and D. Blumstein, “Exact and inexact methods for the daily management of an earth observation satellite,” in Proc. 4th Intl. Symposium on Space Mission Operations and Ground Data Systems, Münich, Germany, 1996.
  5. D. Fayard and G. Plateau, “An algorithm for the solution of the 0-1 knapsack problem,” Computing, vol. 28, pp. 269-287, 1982. · doi:10.1007/bf02241754
  6. C. Friden, A. Hertz, and D. de Werra, “Stabulus: A technique for finding stable sets in large graphs with tabu search,” Computing, vol. 42, pp. 35-44, 1989. · doi:10.1007/bf02243141
  7. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, JohnWiley: New York, 1990.
  8. R.M. Nauss, “An efficient algorithm for 0-1 knapsack problem,” Management Science, vol. 23, ppp.27-31, 1976. · doi:10.1287/mnsc.23.1.27
  9. W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical Recipes in C, Cambridge University Press: Cambridge, 1992.
  10. E. Rolland, H.P. Pirkul, and F. Glover, “Tabu search for graph partitioning,” Annals of Operations Research, vol. 63, pp. 209-232, 1996. · DOI
  11. G. Verfaillie, M. Lemaître, and T. Schiex, “Russian doll search for solving constraint optimization problems,” in Proc. 13th National Conference on Artificial Intelligence, Portland, USA, 1996, pp. 182-187.

Cited by

See all 73

Metadata

Authors
Vasquez, M., & Hao, J.-K.
Venue
Journal of Combinatorial Optimization
Published
2003-03
Volume
7
Issue
1
Pages
87-103
ISSN
  • 1382-6905 (ISSN-L)
  • 1573-2886
OpenAlex
W99814351
Cited by
73
References
1
FWCI
9.51
Type
journal article
Language
en
Open access
green
Licence

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem. https://app.cochat.ai/papers/10.1023/a:1021950608048
The paper
Vasquez, M., & Hao, J.-K. (2003). Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem. Journal of Combinatorial Optimization. https://doi.org/10.1023/a%3A1021950608048

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.