A constructive periodicity bound for the unbounded knapsack problem

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research letters 2012-09, Vol.40 (5), p.329-331
Hauptverfasser: Huang, Ping H., Tang, Kwei
Format: Artikel
Sprache:eng
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2012.05.001