Pages that link to "Item:Q1411341"
From MaRDI portal
The following pages link to Upper bounds for the SPOT 5 daily photograph scheduling problem (Q1411341):
Displayed 15 items.
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites (Q336398) (← links)
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds (Q342441) (← links)
- Strong formulation for the spot 5 daily photograph scheduling problem (Q613663) (← links)
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite (Q711387) (← links)
- Graph colouring approaches for a satellite range scheduling problem (Q835607) (← links)
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites (Q856269) (← links)
- A mixed integer linear programming model for multi-satellite scheduling (Q1713768) (← links)
- Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites (Q1717905) (← links)
- A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem (Q1725600) (← links)
- Approximate path searching method for single-satellite observation and transmission task planning problem (Q1993086) (← links)
- QUEST -- a new quadratic decision model for the multi-satellite scheduling problem (Q2289905) (← links)
- Strengthened 0-1 linear formulation for the daily satellite mission planning (Q2369977) (← links)
- Solving the swath segment selection problem through Lagrangean relaxation (Q2456644) (← links)
- A threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← links)
- A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem (Q5059415) (← links)