An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371): Difference between revisions
From MaRDI portal
Latest revision as of 09:08, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An approximate binary search algorithm for the multiple-choice knapsack problem |
scientific article |
Statements
An approximate binary search algorithm for the multiple-choice knapsack problem (English)
0 references
9 June 2016
0 references
knapsack problem
0 references
approximate algorithm
0 references
approximate binary search
0 references