A new upper bound for the 0-1 quadratic knapsack problem

The 0-1 quadratic knapsack problem (QKP) consists in maximizing a positive quadratic pseudo-Boolean function subject to a linear capacity constraint. We present in this paper a new method, based on Lagrangian decomposition, for computing an upper bound of QKP. We report computational experiments whi...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 112; číslo 3; s. 664 - 672
Hlavní autoři:	Billionnet, Alain, Faye, Alain, Soutif, Éric
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.02.1999 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	0-1 Quadratic knapsack problem Applied sciences Bounds Computational Complexity Computational experiments Computer Science Exact sciences and technology Flows in networks. Combinatorial problems Knapsack problem Lagrangian decomposition Mathematical models Operational research and scientific management Operational research. Management science Operations research Optimization techniques Quadratic programming Studies Theory Lagrangian decomposition Computational experiments 0-1 Quadratic knapsack problem Quadratic programming Bounds Upper bound Decomposition Zero one programming Lagrangian method 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!