A polynomially solvable special case of the unbounded knapsack problem.

Moshe Zukerman Long Jia Timothy D. Neame Gerhard J. Woeginger

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

Keyphrases

polynomially solvable
special case
makespan minimization
np hard
np complete
processing times
feasible solution
approximation algorithms
computational complexity
minimum cost
databases
training data
single machine