Upper bounds for revenue maximization in a satellite scheduling problem
From MaRDI portal
Publication:1762888
DOI10.1007/s10288-004-0044-8zbMath1136.90538OpenAlexW1972778100MaRDI QIDQ1762888
Benoît Rottembourg, Thierry Benoist
Publication date: 11 February 2005
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-004-0044-8
Applications of mathematical programming (90C90) Case-oriented studies in operations research (90B90)
Related Items (8)
A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem ⋮ High-performance technique for satellite range scheduling ⋮ A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds ⋮ Strong formulation for the spot 5 daily photograph scheduling problem ⋮ Soft car sequencing with colors: lower bounds and optimality proofs ⋮ Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite ⋮ QUEST -- a new quadratic decision model for the multi-satellite scheduling problem ⋮ Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain
This page was built for publication: Upper bounds for revenue maximization in a satellite scheduling problem
