A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
From MaRDI portal
Publication:1357776
DOI10.1023/A:1018920709696zbMath0880.90092MaRDI QIDQ1357776
Alain Moulet, Virginie Gabrel, Cécile Murat, Vangelis Th. Paschos
Publication date: 24 August 1997
Published in: Annals of Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Related Items (10)
A survey on combinatorial optimization in dynamic environments ⋮ A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds ⋮ An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits ⋮ A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem ⋮ Scheduling for single agile satellite, redundant targets problem using complex networks theory ⋮ Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite ⋮ Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times ⋮ A priori optimization for the probabilistic maximum independent set problem ⋮ QUEST -- a new quadratic decision model for the multi-satellite scheduling problem ⋮ Scheduling of a constellation of satellites: creating a mixed-integer linear model
This page was built for publication: A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
