A polynomial-time algorithm for knapsack with divisible item sizes

Authors:
W. F. J. Verhaegh;E. H. L. Aarts
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1997

Citing 0
Cited 3

A polynomial algorithm for the multiple knapsack problem with divisible item sizes

Information Processing Letters
Scheduling periodic tasks in a hard real-time environment

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A well-solvable special case of the bounded knapsack problem

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract