A dynamic programming algorithm for the knapsack problem with setup (Q342065): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / 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.cor.2015.05.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W286695454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms For The Setup Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problems with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate and exact algorithms for the fixed-charge knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the bounded set-up knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer knapsack problems with set-up weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multilevel passenger screening problem for aviation security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming algorithms for the zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3678962 / rank
 
Normal rank

Latest revision as of 23:56, 12 July 2024

scientific article
Language Label Description Also known as
English
A dynamic programming algorithm for the knapsack problem with setup
scientific article

    Statements

    A dynamic programming algorithm for the knapsack problem with setup (English)
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    knapsack problems
    0 references
    setup
    0 references
    dynamic programming
    0 references
    combination
    0 references
    production planning
    0 references
    0 references
    0 references
    0 references