An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Michael L. Pinedo / rank
Normal rank
 
Property / author
 
Property / author: Michael L. Pinedo / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
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.1051/ro/2015061 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2540476875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of a multiple-choice knapsack algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate binary search algorithm for the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Approximation Schemes for Multidimensional Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector bin packing with multiple-choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank
 
Normal rank

Latest revision as of 07:43, 13 July 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
    0 references
    0 references
    0 references
    0 references
    0 references
    12 January 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references