A fast algorithm for the linear multiple-choice knapsack problem (Q800227): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the computational power of pushdown automata / 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: An O(n) algorithm for the multiple-choice knapsack linear program / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the knapsack problem with special ordered sets / 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 | |||
Latest revision as of 15:56, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for the linear multiple-choice knapsack problem |
scientific article |
Statements
A fast algorithm for the linear multiple-choice knapsack problem (English)
0 references
1984
0 references
fast algorithm
0 references
median finding in ordered sets
0 references
linear multiple-choice knapsack problem
0 references
branch-and bound approach
0 references
