Solving sequential knapsack problems

Authors:
Mark Hartmann;Todd Olmstead
Affiliations:
Department of Operations Research, University of North Carolina, Chapel Hill, NC 27599, USA;Department of Operations Research, University of North Carolina, Chapel Hill, NC 27599, USA
Venue:
Operations Research Letters
Year:
1993

Citing 2
Cited 2

Integer and combinatorial optimization

Integer and combinatorial optimization
A fast algorithm for optimal length-limited Huffman codes

Journal of the ACM (JACM)

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

Information Processing Letters
Greedy algorithms for a class of knapsack problems with binary weights

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an O(n log n) algorithm for solving sequential knapsack problems, whose bottleneck operation is sorting the ratios c"j/a"j; otherwise the running time is O(n). This is used to compute a better bound than z"L"P for the general 0-1 knapsack problem in linear time after sorting the ratios c"J/a"j.