"A Note on the Max-Min 0-1 Knapsack Problem."

Hiroshi Iida (1999)

> Home

Details and statistics

DOI: 10.1023/A:1009821323279

access: closed

type: Journal Article

metadata version: 2017-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/Iida99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/Iida99
Hiroshi Iida:
A Note on the Max-Min 0-1 Knapsack Problem. J. Comb. Optim. 3(1): 89-94 (1999)

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.