Linear Time Algorithms for Knapsack Problems with Bounded Weights (Q4939603): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q58826506, #quickstatements; #temporary_batch_1712261475387 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jagm.1999.1034 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076844787 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58826506 / rank | |||
Normal rank | |||
Latest revision as of 23:36, 4 April 2024
scientific article; zbMATH DE number 1400079
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear Time Algorithms for Knapsack Problems with Bounded Weights |
scientific article; zbMATH DE number 1400079 |
Statements
Linear Time Algorithms for Knapsack Problems with Bounded Weights (English)
0 references
6 February 2000
0 references
knapsack problem
0 references
dynamic programming
0 references
memorizing
0 references
