Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
Year of publication: |
1993
|
---|---|
Authors: | Lai, T.-C. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 14.1993, 4, p. 215-220
|
Saved in:
Saved in favorites
Similar items by person
-
Analysing the c-minus-age strategy for life-cycle investing
Lai, Christine W., (2009)
-
Measures of problem uncertainty for scheduling with interval processing times
Sotskov, Jurij Nazarovič, (2013)
-
Minimizing total weighted flow time under uncertainty using dominance and a stability box
Sotskov, Jurij Nazarovič, (2012)
- More ...