Login / Signup

A branch-and-cut algorithm for a resource-constrained scheduling problem.

Renaud SirdeyHervé Kerivin
Published in: RAIRO Oper. Res. (2007)
Keyphrases
  • resource constrained
  • scheduling problem
  • np hard
  • cost function
  • dynamic programming
  • computational complexity
  • sensor networks
  • resource constraints
  • search space
  • simulated annealing
  • benchmark problems