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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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

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