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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 215; H. 2; S. 319 - 324
Hauptverfasser:	Huang, Ping H., Lawley, Mark, Morin, Thomas
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.12.2011 Elsevier Elsevier Sequoia S.A
Schriftenreihe:	European Journal of Operational Research
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!