Approximation algorithms for the multiple knapsack problem with assignment restrictions (Q1583697): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:03, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for the multiple knapsack problem with assignment restrictions |
scientific article |
Statements
Approximation algorithms for the multiple knapsack problem with assignment restrictions (English)
0 references
6 February 2001
0 references
multiple knapsack problem with assignment restrictions
0 references
maximizing assigned weight
0 references
minimizing utilized capacity
0 references
approximate solutions
0 references
polynomial computational time
0 references
