Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases.
Serafino CiceroneGianlorenzo D'AngeloGabriele Di StefanoDaniele FrigioniAlfredo NavarraPublished in: J. Comb. Optim. (2009)
Keyphrases
- computational complexity
- special case
- high computational complexity
- parameter tuning
- computationally efficient
- worst case
- theoretical analysis
- computational cost
- learning algorithm
- complexity analysis
- space complexity
- np hard
- significant improvement
- neural network
- lower complexity
- complexity measures
- computationally complex
- np complete
- benchmark datasets
- orders of magnitude
- approximation algorithms
- data streams
- data structure
- timetabling problem