Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem

@article{Vasquez2003UpperBF,
  title={Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem},
  author={Michel Vasquez and Jin-Kao Hao},
  journal={J. Comb. Optim.},
  year={2003},
  volume={7},
  pages={87-103}
}
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… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS
24 Citations
8 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Earth observation satellite management

  • J. C. Agnèse, N. Bataille, D. Blumstein
  • 1999

Improved linear programming bounds via column generation procedure for the daily scheduling of earth observation satellite

  • D. Johnson
  • 1999

Exact and inexact methods for the daily management of an earth observation satellite

  • G. Plateau
  • Proc . 4 th Intl
  • 1996

An algorithm for the solution of the 0 - 1 knapsack problem

  • A. Hertz C. Friden, D. de Werra
  • Computing
  • 1982

An efficient algorithm for 0-1 knapsack problem,

  • R. M. Nauss
  • Management Science,
  • 1976
1 Excerpt

A logicconstrained ” knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite

  • J. K. Hao
  • Journal of Computational Optimization and…

Similar Papers

Loading similar papers…