"A polynomially solvable special case of the unbounded knapsack problem."

Moshe Zukerman et al. (2001)

> Home

Details and statistics

DOI: 10.1016/S0167-6377(01)00076-1

access: closed

type: Journal Article

metadata version: 2017-06-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/ZukermanJNW01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/ZukermanJNW01
Moshe Zukerman, Long Jia, Timothy D. Neame, Gerhard J. Woeginger:
A polynomially solvable special case of the unbounded knapsack problem. Oper. Res. Lett. 29(1): 13-16 (2001)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.