𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the continuous quadratic knapsack problem

✍ Scribed by A. G. Robinson; N. Jiang; C. S. Lerme

Publisher
Springer-Verlag
Year
1992
Tongue
English
Weight
495 KB
Volume
55
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the supermodular knapsack problem
On the supermodular knapsack problem
✍ G. Gallo; B. Simeone πŸ“‚ Article πŸ“… 1989 πŸ› Springer-Verlag 🌐 English βš– 631 KB
On the complexity of the continuous unbo
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
✍ Eduardo Conde πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 166 KB

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(n lo