On the extension complexity of scheduling polytopes.

Hans Raj Tiwary Victor Verdugo Andreas Wiese

Published in: Oper. Res. Lett. (2020)

Keyphrases

scheduling problem
worst case
convex hull
lower complexity
computational complexity
resource allocation
decision problems
real time
neural network
np complete
round robin
preventive maintenance