An optimization algorithm for a penalized knapsack problem (Q2466588): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the two-dimensional level strip packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional packing problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and bounds for two-dimensional level packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank

Revision as of 15:16, 27 June 2024

scientific article
Language Label Description Also known as
English
An optimization algorithm for a penalized knapsack problem
scientific article

    Statements

    Identifiers