Login / Signup
Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications.
Hans Kellerer
Vitaly A. Strusevich
Published in:
Algorithmica (2010)
Keyphrases
</>
approximation schemes
approximation algorithms
scheduling problem
round robin
scheduling algorithm
numerical methods
knapsack problem
resource constraints
np hard
search algorithm
higher order
resource allocation
bin packing