A constructive periodicity bound for the unbounded knapsack problem

A classic bound for periodicity was defined by Kellerer et al. (2004) [5] in their comprehensive book on knapsack problems. We propose an almost-tight bound which improves on the classic bound in all instances.

Saved in:

Bibliographic Details
Published in:	Operations research letters Vol. 40; no. 5; pp. 329 - 331
Main Authors:	Huang, Ping H., Tang, Kwei
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier B.V 01-09-2012 Elsevier
Subjects:	Applied sciences Combinatorial optimization Construction Exact sciences and technology Flows in networks. Combinatorial problems Integer programming Knapsack problem Mathematical programming Operational research and scientific management Operational research. Management science Operations research Periodicity Integer programming Combinatorial optimization Periodicity Knapsack problem
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	A classic bound for periodicity was defined by Kellerer et al. (2004) [5] in their comprehensive book on knapsack problems. We propose an almost-tight bound which improves on the classic bound in all instances.
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0167-6377 1872-7468
DOI:	10.1016/j.orl.2012.05.001