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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.06.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2112546682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded knapsack problem: Dynamic programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of hard knapsack problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Computation of Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average performance of greedy heuristics for the integer knapsack problem. / 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: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid algorithm for the unbounded knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turnpike Theorems for Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:51, 5 July 2024

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
    combinatorial optimization
    0 references
    integer programming
    0 references
    knapsack problem
    0 references
    number theory
    0 references
    periodicity
    0 references

    Identifiers