Approximate Algorithms for the 0/1 Knapsack Problem (Q4136930): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/321864.321873 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089047615 / rank | |||
Normal rank | |||
Latest revision as of 15:28, 19 March 2024
scientific article; zbMATH DE number 3564688
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate Algorithms for the 0/1 Knapsack Problem |
scientific article; zbMATH DE number 3564688 |
Statements
Approximate Algorithms for the 0/1 Knapsack Problem (English)
0 references
1975
0 references
