A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem
From MaRDI portal
Publication:1725600
DOI10.1016/j.cor.2018.12.007zbMath1458.90308OpenAlexW2905314116MaRDI QIDQ1725600
Publication date: 14 February 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.12.007
Related Items
An improved genetic algorithm for the integrated satellite imaging and data transmission scheduling problem ⋮ A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service ⋮ Scheduling complex observation requests for a constellation of satellites: large neighborhood search approaches ⋮ Orientational variable-length strip covering problem: a branch-and-price-based algorithm
Cites Work
- Unnamed Item
- Large-scale optimization with the primal-dual column generation method
- 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
- A new warmstarting strategy for the primal-dual column generation method
- An introduction to optimal satellite range scheduling
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
- A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
- 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
- Multi satellites scheduling algorithm based on task merging mechanism
- Clustered maximum weight clique problem: algorithms and empirical analysis
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Earth observation satellite management
- New developments in the primal-dual column generation technique
- Strengthened 0-1 linear formulation for the daily satellite mission planning
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
- Decomposition Principle for Linear Programs
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- On a single machine-scheduling problem with separated position and resource effects
- Maximizing the value of an Earth observation satellite orbit
- Selected Topics in Column Generation
- A Primer in Column Generation
