"Approximation Algorithms for the Multiple Knapsack Problem with Assignment ..."

Milind Dawande et al. (2000)

> Home

Details and statistics

DOI: 10.1023/A:1009894503716

access: closed

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/DawandeKKSR00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/DawandeKKSR00
Milind Dawande, Jayant Kalagnanam, Pinar Keskinocak, F. Sibel Salman, R. Ravi:
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions. J. Comb. Optim. 4(2): 171-186 (2000)

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.