An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365)

From MaRDI portal
Revision as of 01:36, 24 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references