An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:17, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved binary search algorithm for the Multiple-Choice Knapsack Problem |
scientific article |
Statements
An improved binary search algorithm for the Multiple-Choice Knapsack Problem (English)
0 references
12 January 2017
0 references
multiple-choice knapsack problem (MCKP)
0 references
approximate binary search algorithm
0 references
worst-case performance ratio
0 references
multiple-choice multi-dimensional knapsack problem (MMKP)
0 references
