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

DOI10.1007/s10878-006-7912-4zbMath1255.90138OpenAlexW1975845493MaRDI QIDQ2369977

Virginie 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) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (7)

A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem ⋮ A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds ⋮ Strong formulation for the spot 5 daily photograph scheduling problem ⋮ A temporal logic programming approach to planning ⋮ A mixed integer linear programming model for multi-satellite scheduling ⋮ A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem ⋮ QUEST -- a new quadratic decision model for the multi-satellite scheduling problem

Cites Work

• Geometric algorithms and combinatorial optimization
• Node packings on cocomparability graphs
• Upper bounds for the SPOT 5 daily photograph scheduling problem
• Earth observation satellite management
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• 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

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