Login / Signup
Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates.
Yuan Gao
Jinjiang Yuan
Published in:
Discret. Appl. Math. (2015)
Keyphrases
</>
np hardness
absolute deviation
np hard
approximation algorithms
completion times
worst case analysis
pairwise
processing times
discrete tomography
mixed integer
convex functions
lower bound
learning algorithm
objective function
optimization problems