Strong formulation for the spot 5 daily photograph scheduling problem

Glaydston Mattos Ribeiro (), Miguel Fragoso Constantino () and Luiz Antonio Nogueira Lorena ()
Additional contact information
Glaydston Mattos Ribeiro: UFES—Universidade Federal do Espírito Santo
Miguel Fragoso Constantino: Universidade de Lisboa
Luiz Antonio Nogueira Lorena: INPE—Instituto Nacional de Pesquisas Espaciais

Journal of Combinatorial Optimization, 2010, vol. 20, issue 4, No 5, 385-398

Abstract: Abstract Earth observation satellites, such as the SPOT 5, take photographs of the earth according to consumers’ demands. Obtaining a good schedule for the photographs is a combinatorial optimization problem known in the literature as the daily photograph scheduling problem (DPSP). The DPSP consists of selecting a subset of photographs, from a set of candidates, to different cameras, maximizing a profit function and satisfying a large number of constraints. Commercial solvers, with standard integer programming formulations, are not able to solve some DPSP real instances available in the literature. In this paper we present a strengthened formulation for the DPSP, based on valid inequalities arising in node packing and 3-regular independence system polyhedra. This formulation was able, with a commercial solver, to solve to optimality all those instances in a short computation time.

Keywords: Daily photograph scheduling problem; Independence systems; Clique inequalities (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9215-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:20:y:2010:i:4:d:10.1007_s10878-009-9215-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-009-9215-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().