Pages that link to "Item:Q711387"

The following pages link to Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite (Q711387):

Displaying 15 items.

• A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite (Q319628) (← links)
• 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)
• Scheduling for single agile satellite, redundant targets problem using complex networks theory (Q509214) (← links)
• Consistent neighborhood search for combinatorial optimization (Q693704) (← links)
• High-performance technique for satellite range scheduling (Q1652343) (← links)
• An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time (Q1652375) (← links)
• A mixed integer linear programming model for multi-satellite scheduling (Q1713768) (← 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)
• Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times (Q2273657) (← links)
• QUEST -- a new quadratic decision model for the multi-satellite scheduling problem (Q2289905) (← links)
• A branch and bound algorithm for agile earth observation satellite scheduling (Q2314755) (← links)
• An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits (Q2664286) (← links)
• A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems (Q5247673) (← links)