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

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2005.06.001 / 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.1016/j.orl.2005.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988173185 / 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: 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
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2005.06.001 / rank
 
Normal rank

Latest revision as of 19:51, 18 December 2024

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

    Statements

    Identifiers