Approximation algorithms for the multiple knapsack problem with assignment restrictions (Q1583697): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Milind W. Dawande / rank | |||
| Property / author | |||
| Property / author: Jayant R. Kalagnanam / rank | |||
| Property / author | |||
| Property / author: Pinar Keskinocak / rank | |||
| Property / author | |||
| Property / author: F. Sibel Salman / rank | |||
| Property / author | |||
| Property / author: Milind W. Dawande / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Jayant R. Kalagnanam / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Pinar Keskinocak / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: F. Sibel Salman / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:00, 5 March 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
