On two class-constrained versions of the multiple knapsack problem (Q5930158): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (6 intermediate revisions by 6 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s004530010057 / rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s004530010057 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981405487 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S004530010057 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:51, 9 December 2024
scientific article; zbMATH DE number 1587482
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On two class-constrained versions of the multiple knapsack problem |
scientific article; zbMATH DE number 1587482 |
Statements
On two class-constrained versions of the multiple knapsack problem (English)
0 references
3 July 2001
0 references
knapsack problem
0 references
