Simple but efficient approaches for the collapsing knapsack problem (Q1364474): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58826516, #quickstatements; #temporary_batch_1711574657256 |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An exact algorithm for the 0-1 collapsing knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A New Algorithm for the 0-1 Knapsack Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Collapsing 0–1 Knapsack Problem / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082718338 / rank | |||
Normal rank | |||
Latest revision as of 10:38, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simple but efficient approaches for the collapsing knapsack problem |
scientific article |
Statements
Simple but efficient approaches for the collapsing knapsack problem (English)
0 references
4 September 1997
0 references
collapsing knapsack problem
0 references
pseudo-polynomial solution times
0 references
