An O(n) algorithm for the multiple-choice knapsack linear program (Q3315277): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56324187, #quickstatements; #temporary_batch_1712201099914 |
Created claim: DBLP publication ID (P1635): journals/mp/Dyer84, #quickstatements; #temporary_batch_1731505720702 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A o(n logn) algorithm for LP knapsacks with GUB constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: THE MULTIPLE-CHOICE KNAPSACK PROBLEM / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Convex Analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Multiple-Choice Knapsack Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Linear Multiple Choice Knapsack Problem / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/mp/Dyer84 / rank | |||
Normal rank | |||
Latest revision as of 15:22, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n) algorithm for the multiple-choice knapsack linear program |
scientific article |
Statements
An O(n) algorithm for the multiple-choice knapsack linear program (English)
0 references
1984
0 references
linear algorithm
0 references
computational complexity
0 references
analysis of algorithms
0 references
multiple choice knapsack problem
0 references
