A dynamic programming based reduction procedure for the multidimensional 0–1 knapsack problem

This paper presents a preprocessing procedure for the 0–1 multidimensional knapsack problem. First, a non-increasing sequence of upper bounds is generated by solving LP-relaxations. Then, a non-decreasing sequence of lower bounds is built using dynamic programming. The comparison of the two sequence...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 186; číslo 1; s. 63 - 76
Hlavní autoři:	Balev, Stefan, Yanev, Nicola, Fréville, Arnaud, Andonov, Rumen
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.04.2008 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	Applied sciences Comparative analysis Computer Science Discrete Mathematics Dynamic programming Exact sciences and technology Flows in networks. Combinatorial problems Heuristic Heuristics Integer programming Knapsack problem Multidimensional knapsack problem Operational research and scientific management Operational research. Management science Operations Research Studies Variable reduction Integer programming Variable reduction Dynamic programming Heuristics Multidimensional knapsack problem Lower bound Computation time Upper bound Heuristic method Large scale Knapsack problem
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!