Strong formulation for the spot 5 daily photograph scheduling problem
type: Item
instance of: scholarly article
title: Strong formulation for the spot 5 daily photograph scheduling problem
zbMATH Open document ID: 1206.90047
author: Glaydston Mattos Ribeiro
author: Miguel Constantino
author: Luiz Antonio Nogueira Lorena
published in: Journal of Combinatorial Optimization
publication date: 2010-12-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5828801
zbMATH Keywords: independence systems
zbMATH Keywords: clique inequalities
describes a project that uses: CPLEX
MaRDI profile type: MaRDI publication profile
full work available at URL: s10878-009-9215-z
OpenAlex ID: W2058114259
cites work: Conflict graphs in solving integer programming problems
cites work: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
cites work: Upper bounds for revenue maximization in a satellite scheduling problem
cites work: Earth observation satellite management
cites work: On the Facial Structure of Independence System Polyhedra
cites work: Maximizing the value of an Earth observation satellite orbit
cites work: Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
cites work: The multidimensional 0-1 knapsack problem -- bounds and computational aspects
cites work: Blocking and anti-blocking pairs of polyhedra
cites work: Strengthened 0-1 linear formulation for the daily satellite mission planning
cites work: A generalization of antiwebs to independence systems and their canonical facets
cites work: Q3993418
cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
cites work: Properties of vertex packing and independence system polyhedra
cites work: On the facial structure of set packing polyhedra
cites work: On the facial structure of the set covering polytope
cites work: A ``logic-constrained'' knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
cites work: Upper bounds for the SPOT 5 daily photograph scheduling problem
DOI: 10.1007/S10878-009-9215-Z
description: scientific article; zbMATH DE number 5828801