(Enter summary)
Abstract: : The daily photograph scheduling problem of earth observation satellites such as Spot 5
consists of scheduling a subset of mono or stereo photographs from a given set of candidates to
different cameras. The scheduling must maximize a profit function while satisfying a large number
of constraints. In this paper, we first present a formulation of the problem as a generalized version
of the well-known knapsack model, which includes large numbers of binary and ternary "logical"
constraints.... (Update)
Similar documents based on text: More All
1.8: Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem - Vasquez, Hao (2003)
(Correct)
0.4: A "Logic-Constrained" Knapsack Formulation and a Tabu.. - Michel Vasquez (2001)
(Correct)
0.4: A Tabu Algorithm for Homogeneous Partition of - Samples Michel Vasquez (2001)
(Correct)
BibTeX entry: (Update)
M. Vasquez and J.K. Hao. A logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite. To appear in Journal of Computational Optimization and Applications, 20(2): November 2001. http://citeseer.ist.psu.edu/vasquez01logicconstrained.html More
@misc{ vasquez01logicconstrained,
author = "M. Vasquez and J. Hao",
title = "A logic-constrained knapsack formulation and a tabu algorithm for the daily
photograph scheduling of an earth observation satellite",
text = "M. Vasquez and J.K. Hao. A logic-constrained knapsack formulation and a
tabu algorithm for the daily photograph scheduling of an earth observation
satellite. To appear in Journal of Computational Optimization and Applications,
20(2): November 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/vasquez01logicconstrained.html" }
Citations (may not include all citations):
229
Knapsack Problems: Algorithms and Computer Implementations (context) - Martello, Toth
147
Kluwer Academic Publishers (context) - Glover, Laguna et al.
22
Critical event tabu search for multidimensional knapsack pro.. (context) - Glover, Kochenberger
22
A genetic algorithm for the multidimensional knapsack proble.. (context) - Chu, Beasley
20
Russian doll search for solving constraint optimization prob..
- Verfaillie, Lematre et al.
18
Dynamic tabu list management using reverse elimination metho.. (context) - Dammeyer, Voss
8
Earth observation satellite management (context) - Bensana, Lematre et al. - 1999
6
A heuristic solution procedure for the multiconstraint zero-.. (context) - Pirkul
5
Improved linear programming bounds via column generation for.. (context) - Gabrel - 1999
4
Solving zero-one mixed integer programming problems using ta.. (context) - Lokketangen, Glover
4
An efficient tabu search approach for the 0-1 multidimension.. (context) - Hanafi, Freville
3
Daily management of an earth observation satellite: comparis.. (context) - Lematre, Verfaillie
2
bidimensional knapsack problem: toward an efficient high-lev.. (context) - Frville, Plateau
2
An efficient preprocessing procedure for the multidimensiona.. (context) - Frville, Plateau
1
Personal communications (context) - Verfaillie - 1999
1
Comparison of heuristics for the 0-1 multidimensional knapsa.. (context) - Hanafi, Freville et al.
Documents on the same site (http://www.info.univ-angers.fr/pub/hao/): More
An Evolutionary Approach for Frequency Assignment in Cellular.. - Dorne, Hao (1995)
(Correct)
Empirical Studies of Heuristic Local Search for Constraint Solving - Hao, Dorne (1996)
(Correct)
Solving the Sports League Scheduling Problem with Tabu Search - Hamiez, Hao (2001)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC