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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 215; číslo 2; s. 319 - 324
Hlavní autoři:	Huang, Ping H., Lawley, Mark, Morin, Thomas
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.12.2011 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!