Unbounded knapsack problems with arithmetic weight sequences (Q545110): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / 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: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5910992 / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial optimization
Property / zbMATH Keywords: combinatorial optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomially solvable special case
Property / zbMATH Keywords: polynomially solvable special case / rank
 
Normal rank

Revision as of 12:13, 1 July 2023

scientific article
Language Label Description Also known as
English
Unbounded knapsack problems with arithmetic weight sequences
scientific article

    Statements

    Unbounded knapsack problems with arithmetic weight sequences (English)
    0 references
    22 June 2011
    0 references
    combinatorial optimization
    0 references
    computational complexity
    0 references
    dynamic programming
    0 references
    polynomially solvable special case
    0 references

    Identifiers