A constructive periodicity bound for the unbounded knapsack problem (Q1758270): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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.orl.2012.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053370990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded knapsack problems with arithmetic weight sequences / 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: Tight bounds for periodicity theorems on the unbounded knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / 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: New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems / 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 21:12, 5 July 2024

scientific article
Language Label Description Also known as
English
A constructive periodicity bound for the unbounded knapsack problem
scientific article

    Statements