Login / Signup

A "Logic-Constrained" Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite.

Michel VasquezJin-Kao Hao
Published in: Comput. Optim. Appl. (2001)
Keyphrases
  • dynamic programming
  • optimal solution
  • data sets
  • knapsack problem
  • np hard
  • simulated annealing
  • scheduling problem
  • multi dimensional
  • data management
  • search procedure