Some Complexity Isseus in A Class of Knapsack Problems: What Makes A Knapsack Problem "Hard"?
Year of publication: |
1994
|
---|---|
Authors: | Krass, n.D. ; Sethi, S. ; Sorger, G. |
Published in: |
INFOR : information systems and operational research. - Ottawa : INFOR Journal, ISSN 0315-5986, ZDB-ID 1212606. - Vol. 32.1994, 3, p. 149-162
|
Saved in:
Saved in favorites
Similar items by person
-
Forecast horizons in the discounted dynamic lot size model
Chand, Suresh, (1992)
-
On the sensitivity of optimal growth paths
Sorger, Gerhard, (1992)
-
Consistent expectations equilibria
Hommes, Cars H., (1997)
- More ...