Strong formulation for the spot 5 daily photograph scheduling problem

DOI10.1007/s10878-009-9215-zzbMath1206.90047OpenAlexW2058114259MaRDI QIDQ613663

Glaydston Mattos Ribeiro, Miguel Fragoso 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

zbMATH Keywords

independence systemsclique inequalities

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (4)

A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem ⋮ A two-phase scheduling method with the consideration of task clustering for Earth observing satellites ⋮ A mixed integer linear programming model for multi-satellite scheduling ⋮ A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• A generalization of antiwebs to independence systems and their canonical facets
• On the facial structure of the set covering polytope
• Upper bounds for the SPOT 5 daily photograph scheduling problem
• Upper bounds for revenue maximization in a satellite scheduling problem
• Earth observation satellite management
• Conflict graphs in solving integer programming problems
• Strengthened 0-1 linear formulation for the daily satellite mission planning
• Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
• On the Facial Structure of Independence System Polyhedra
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• Properties of vertex packing and independence system polyhedra
• On the facial structure of set packing polyhedra
• Maximizing the value of an Earth observation satellite orbit
• Blocking and anti-blocking pairs of polyhedra
• A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite

This page was built for publication: Strong formulation for the spot 5 daily photograph scheduling problem