Simple but efficient approaches for the collapsing knapsack problem (Q1364474): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
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 / Wikidata QID
 
Property / Wikidata QID: Q58826516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the 0-1 collapsing knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Collapsing 0–1 Knapsack Problem / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082718338 / rank
 
Normal rank

Latest revision as of 11:38, 30 July 2024

scientific article
Language Label Description Also known as
English
Simple but efficient approaches for the collapsing knapsack problem
scientific article

    Statements

    Simple but efficient approaches for the collapsing knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    4 September 1997
    0 references
    0 references
    collapsing knapsack problem
    0 references
    pseudo-polynomial solution times
    0 references
    0 references
    0 references