New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
Year of publication: |
2009
|
---|---|
Authors: | Tamir, Arie |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 37.2009, 5, p. 303-307
|
Saved in:
Saved in favorites
Similar items by person
-
Minimality and Complementarity Properties Associated with Z-Functions and M-Functions
Tamir, Arie, (1974)
-
Line Search Techniques Based on Interpolating Polynomials Using Function Values Only
Tamir, Arie, (1974)
-
Pre-Leontief Functions and Least Elements
Tamir, Arie, (1975)
- More ...