Strong formulation for the spot 5 daily photograph scheduling problem
From MaRDI portal
Publication:613663
DOI10.1007/S10878-009-9215-ZzbMATH Open1206.90047OpenAlexW2058114259MaRDI QIDQ613663FDOQ613663
Authors: Glaydston Mattos Ribeiro, Miguel Constantino, Luiz Antonio Nogueira Lorena 
Publication date: 21 December 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-009-9215-z
Recommendations
- Upper bounds for the SPOT 5 daily photograph scheduling problem
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- scientific article; zbMATH DE number 2050786
- 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
Cites Work
- Title not available (Why is that?)
- Properties of vertex packing and independence system polyhedra
- A generalization of antiwebs to independence systems and their canonical facets
- On the facial structure of set packing polyhedra
- Conflict graphs in solving integer programming problems
- Blocking and anti-blocking pairs of polyhedra
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the facial structure of the set covering polytope
- Maximizing the value of an Earth observation satellite orbit
- Upper bounds for the SPOT 5 daily photograph scheduling problem
- Earth observation satellite management
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- Upper bounds for revenue maximization in a satellite scheduling problem
- Strengthened 0-1 linear formulation for the daily satellite mission planning
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
- On the Facial Structure of Independence System Polyhedra
Cited In (8)
- Strengthened 0-1 linear formulation for the daily satellite mission planning
- Title not available (Why is that?)
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem
- Upper bounds for the SPOT 5 daily photograph scheduling problem
- A mixed integer linear programming model for multi-satellite scheduling
Uses Software
This page was built for publication: Strong formulation for the spot 5 daily photograph scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613663)
