| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524009 | Operations Research Letters | 2005 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Eduardo Conde,