An efficient hybrid heuristic method for the 0-1 exact k-item quadratic knapsack problem

An efficient hybrid heuristic method for the 0-1 exact k-item quadratic knapsack problem

The 0-1 exact k-item quadratic knapsack problem (E - kQKP) consists of maximizing a quadratic function subject to two linear constraints: the first one is the classical linear capacity constraint; the second one is an equality cardinality constraint on the number of items in the knapsack. Most insta...

Full description

Bibliographic Details
Main Authors: Lucas Létocart, Marie-Christine Plateau, Gérard Plateau
Format: Article
Language:English
Published: Sociedade Brasileira de Pesquisa Operacional 2014-04-01
Series:Pesquisa Operacional
Subjects:
quadratic programming
0-1 knapsack
quadratic convex reformulation
semidefinite programming
surrogate duality
hybridization
experiments
Online Access:http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382014000100005&lng=en&tlng=en

Internet

http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382014000100005&lng=en&tlng=en

Similar Items