Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: José Rui Figueira / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65K05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91B10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6047702 / rank
 
Normal rank
Property / zbMATH Keywords
 
discounted knapsack problem
Property / zbMATH Keywords: discounted knapsack problem / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
problem partition
Property / zbMATH Keywords: problem partition / rank
 
Normal rank
Property / zbMATH Keywords
 
core concept
Property / zbMATH Keywords: core concept / rank
 
Normal rank
Property / zbMATH Keywords
 
integer programming
Property / zbMATH Keywords: integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical experiments
Property / zbMATH Keywords: numerical experiments / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank

Revision as of 23:14, 29 June 2023

scientific article
Language Label Description Also known as
English
Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
scientific article

    Statements

    Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    discounted knapsack problem
    0 references
    dynamic programming
    0 references
    problem partition
    0 references
    core concept
    0 references
    integer programming
    0 references
    numerical experiments
    0 references
    algorithm
    0 references