Strengthened 0-1 linear formulation for the daily satellite mission planning

DOI10.1007/S10878-006-7912-4MaRDI QIDQ2369977zbMATH OpenOpenAlexFDO

Authors V. Gabrel

Publication date 21 June 2007

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-006-7912-4

zbMATH Keywords

integer programmingstable set polytopecocomparability graphsatellite mission planning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 2050786
• Planification à moyen terme de la production d'un satellite défilant et ensembles stables
• A mixed integer linear programming model for multi-satellite scheduling
• Strong formulation for the spot 5 daily photograph scheduling problem
• A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts

Cites work

• A Characterization of Comparability Graphs and of Interval Graphs
• A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
• Earth observation satellite management
• Geometric algorithms and combinatorial optimization
• Node packings on cocomparability graphs
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• Upper bounds for the SPOT 5 daily photograph scheduling problem

Cited in

(10)

• A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem
• Application of unified methodical approach to online planning of target operation of satellite monitoring and communication systems
• scientific article; zbMATH DE number 2050786 (Why is no real title available?)
• A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds
• Strong formulation for the spot 5 daily photograph scheduling problem
• Planification à moyen terme de la production d'un satellite défilant et ensembles stables
• QUEST -- a new quadratic decision model for the multi-satellite scheduling problem
• A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem
• A temporal logic programming approach to planning
• A mixed integer linear programming model for multi-satellite scheduling

This page was built for publication: Strengthened 0-1 linear formulation for the daily satellite mission planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369977)