On the complexity of the continuous unbounded knapsack problem with uncertain coefficients

Authors:
Eduardo Conde
Affiliations:
Facultad de Matemáticas, Universidad de Sevilla, C/Tarfia S/N, 41012 Sevilla, Spain
Venue:
Operations Research Letters
Year:
2005

Citing 3
Cited 1

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Hyperbolic 0-1 programming and query optimization in information retrieval

Mathematical Programming: Series A and B
Minmax regret linear resource allocation problems

Operations Research Letters

Minmax regret bottleneck problems with solution-induced interval uncertainty structure

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a linear-time algorithm is developed for the minmax-regret version of the continuous unbounded knapsack problem with n items and uncertain objective function coefficients, where the interval estimates for these coefficients are known. This improves the previously known bound of O(nlog(n)) time for this optimization problem.