Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
From MaRDI portal
(Redirected from Publication:711387)
Recommendations
- A branch and bound algorithm for agile earth observation satellite scheduling
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- Upper bounds for the SPOT 5 daily photograph scheduling problem
- Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times
- Maximizing the value of an Earth observation satellite orbit
Cites work
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
- A unified tabu search heuristic for vehicle routing problems with time windows
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- Computer Solutions of the Traveling Salesman Problem
- Earth observation satellite management
- Genetic and hybrid algorithms for graph coloring
- Maximizing the value of a space mission
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- Upper bounds for revenue maximization in a satellite scheduling problem
- Upper bounds for the SPOT 5 daily photograph scheduling problem
Cited in
(30)- Planning the ground object photography by a satellite system
- Upper bounds for the SPOT 5 daily photograph scheduling problem
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
- High-performance technique for satellite range scheduling
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events
- A mixed integer linear programming model for multi-satellite scheduling
- A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem
- Approximate path searching method for single-satellite observation and transmission task planning problem
- Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times
- QUEST -- a new quadratic decision model for the multi-satellite scheduling problem
- A branch and bound algorithm for agile earth observation satellite scheduling
- Distance preserving recombination operator for Earth observation satellites operations scheduling
- An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits
- A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds
- Estimation of the Minimal Duration of an Attitude Change for an Autonomous Agile Earth-Observing Satellite
- scientific article; zbMATH DE number 2084747 (Why is no real title available?)
- A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem
- Scheduling for single agile satellite, redundant targets problem using complex networks theory
- A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
- Maximizing the value of an Earth observation satellite orbit
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- Strong formulation for the spot 5 daily photograph scheduling problem
- Scheduling of Earth observing satellites using distributed constraint optimization
- Branch-and-cut-and-price for agile Earth observation satellite scheduling
- Consistent neighborhood search for combinatorial optimization
- Satellite scheduling problems: a survey of applications in Earth and outer space observation
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
This page was built for publication: Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711387)
