A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite

Related Items (39)

Strengthened 0-1 linear formulation for the daily satellite mission planning ⋮ Adaptive tabu search for course timetabling ⋮ A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem ⋮ A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites ⋮ A two-phase scheduling method with the consideration of task clustering for Earth observing satellites ⋮ A logical approach to efficient Max-SAT solving ⋮ Optimization-based scheduling for the single-satellite, multi-ground station communication problem ⋮ A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds ⋮ Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events ⋮ A threshold search based memetic algorithm for the disjunctively constrained knapsack problem ⋮ WPM3: an (in)complete algorithm for weighted partial MaxSAT ⋮ Strong formulation for the spot 5 daily photograph scheduling problem ⋮ Responsive strategic oscillation for solving the disjunctively constrained knapsack problem ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ A mixed integer linear programming model for multi-satellite scheduling ⋮ Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Scatter search for the 0-1 multidimensional knapsack problem ⋮ LocalSolver 1.x: A black-box local-search solver for 0-1 programming ⋮ A hybrid genetic algorithm for satellite image downlink scheduling problem ⋮ Solving the swath segment selection problem through Lagrangean relaxation ⋮ Essential particle swarm optimization queen with tabu search for MKP resolution ⋮ Scheduling for single agile satellite, redundant targets problem using complex networks theory ⋮ Approximate path searching method for single-satellite observation and transmission task planning problem ⋮ Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem ⋮ Consistent neighborhood search for combinatorial optimization ⋮ The case for strategic oscillation ⋮ Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite ⋮ QUEST -- a new quadratic decision model for the multi-satellite scheduling problem ⋮ Convexity and Solutions of Stochastic Multidimensional 0-1 Knapsack Problems with Probabilistic Constraints ⋮ Scheduling of a constellation of satellites: creating a mixed-integer linear model ⋮ Cooperative parallel SAT local search with path relinking ⋮ Consistency checking within local search applied to the frequency assignment with polarization problem ⋮ An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem ⋮ A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems ⋮ Collaborative mission optimization for ship rapid search by multiple heterogeneous remote sensing satellites ⋮ Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite ⋮ Iterative and core-guided maxsat solving: a survey and assessment ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects

This page was built for publication: A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite