The Linear Multiple Choice Knapsack Problem (Q3893672): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.28.6.1412 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2157513965 / rank | |||
Normal rank | |||
Latest revision as of 20:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Linear Multiple Choice Knapsack Problem |
scientific article |
Statements
The Linear Multiple Choice Knapsack Problem (English)
0 references
1980
0 references
linear multiple choice knapsack problem
0 references
fast algorithm
0 references
linear programming relaxation
0 references
running time complexity
0 references
implementation
0 references
