Login / Signup

Complexity, bounds and dynamic programming algorithms for single track train scheduling.

Jonas HarberingAbhiram RanadeMarie SchmidtOliver Sinnen
Published in: Ann. Oper. Res. (2019)
Keyphrases
  • dynamic programming algorithms
  • complexity bounds
  • databases
  • dynamic programming
  • scheduling problem
  • worst case
  • database systems
  • query answering
  • constraint networks