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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Vladimir G. Deǐneko / rank
Normal rank
 
Property / author
 
Property / author: Vladimir G. Deǐneko / rank
 
Normal rank
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
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.ejor.2011.03.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090987741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for integer programming in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear forms whose coefficients are in arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: When the Greedy Solution Solves a Class of Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the linear knapsack problem with general integer variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On variations of the subset sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomially solvable special case of the unbounded knapsack problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:24, 4 July 2024

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
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    computational complexity
    0 references
    dynamic programming
    0 references
    polynomially solvable special case
    0 references
    0 references