Fast Approximation Algorithms for Knapsack Problems (Q3861164): Difference between revisions
From MaRDI portal
Created claim: DBLP publication ID (P1635): journals/mor/Lawler79, #quickstatements; #temporary_batch_1731543907597 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.4.4.339 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.4.4.339 / rank | |||
Normal rank | |||
Latest revision as of 22:54, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast Approximation Algorithms for Knapsack Problems |
scientific article |
Statements
Fast Approximation Algorithms for Knapsack Problems (English)
0 references
1979
0 references
NP-complete problems
0 references
knapsack problem
0 references
subset sum problem
0 references
fully polynomial approximation schemes
0 references
approximate solution
0 references
