A fast algorithm for the linear multiple-choice knapsack problem (Q800227): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(84)90027-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2155737905 / rank | |||
Normal rank | |||
Revision as of 01:29, 20 March 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
