The Multiple-Choice Knapsack Problem (Q4193264): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.27.3.503 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2135814502 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.27.3.503 / rank | |||
Normal rank | |||
Latest revision as of 09:47, 29 December 2024
scientific article; zbMATH DE number 3632224
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Multiple-Choice Knapsack Problem |
scientific article; zbMATH DE number 3632224 |
Statements
The Multiple-Choice Knapsack Problem (English)
0 references
1979
0 references
Integer Programming
0 references
Multiple Choice Knapsack Problem
0 references
Computational Study
0 references
Comparison of Algorithms
0 references
Branch and Bound Algorithm
0 references
Linear Programming Relaxation
0 references
