Tight bounds for periodicity theorems on the unbounded Knapsack problem

► Developed three new periodicity bounds for UKP. ► Proved each new bound is tight. ► Showed two new bounds subsume known results. Three new bounds for periodicity theorems on the unbounded Knapsack problem are developed. Periodicity theorems specify when it is optimal to pack one unit of the best i...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research Vol. 215; no. 2; pp. 319 - 324
Main Authors: Huang, Ping H., Lawley, Mark, Morin, Thomas
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 01.12.2011
Elsevier
Elsevier Sequoia S.A
Series:European Journal of Operational Research
Subjects:
Applied sciences
Combinatorial optimization
Combinatorial optimization Integer programming Knapsack problem Number theory Periodicity
Empirical analysis
Exact sciences and technology
Flows in networks. Combinatorial problems
Integer programming
Knapsack problem
Mathematical programming
Number theory
Operational research
Operational research and scientific management
Operational research. Management science
Optimization
Optimization techniques
Periodicity
Studies
Theorems
Integer programming
Combinatorial optimization
Number theory
Periodicity
Knapsack problem
Empirical method
Profit
ISSN:0377-2217, 1872-6860
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:► Developed three new periodicity bounds for UKP. ► Proved each new bound is tight. ► Showed two new bounds subsume known results. Three new bounds for periodicity theorems on the unbounded Knapsack problem are developed. Periodicity theorems specify when it is optimal to pack one unit of the best item (the one with the highest profit-to-weight ratio). The successive applications of periodicity theorems can drastically reduce the size of the Knapsack problem under analysis, theoretical or empirical. We prove that each new bound is tight in the sense that no smaller bound exists under the given condition.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2011.06.010