Tight bounds for periodicity theorems on the unbounded knapsack problem (Q421659): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: H. S. Yoon / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6035098 / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial optimization
Property / zbMATH Keywords: combinatorial optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
integer programming
Property / zbMATH Keywords: integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
knapsack problem
Property / zbMATH Keywords: knapsack problem / rank
 
Normal rank
Property / zbMATH Keywords
 
number theory
Property / zbMATH Keywords: number theory / rank
 
Normal rank
Property / zbMATH Keywords
 
periodicity
Property / zbMATH Keywords: periodicity / rank
 
Normal rank

Revision as of 21:49, 29 June 2023

scientific article
Language Label Description Also known as
English
Tight bounds for periodicity theorems on the unbounded knapsack problem
scientific article

    Statements

    Tight bounds for periodicity theorems on the unbounded knapsack problem (English)
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    0 references
    combinatorial optimization
    0 references
    integer programming
    0 references
    knapsack problem
    0 references
    number theory
    0 references
    periodicity
    0 references