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

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 112; no. 3; pp. 664 - 672
Main Authors:	Billionnet, Alain, Faye, Alain, Soutif, Éric
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.02.1999 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!