An effective GRASP and tabu search for the 0-1 quadratic knapsack problem

DOI10.1016/j.cor.2012.11.023zbMath1352.90064OpenAlexW2019810495MaRDI QIDQ502417

Guoqing Wang, Zhen Yang, Feng Chu

Publication date: 5 January 2017

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.11.023

zbMATH Keywords

meta-heuristic0-1 quadratic knapsack problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (7)

Dual mean field search for large scale linear and quadratic knapsack problems ⋮ 0-1 quadratic knapsack problem solved with VNS algorithm ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Asymptotic behavior of the quadratic knapsack problem ⋮ An iterated ``hyperplane exploration approach for the quadratic knapsack problem ⋮ A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem ⋮ Dual mean field annealing scheme for binary optimization under linear constraints

This page was built for publication: An effective GRASP and tabu search for the 0-1 quadratic knapsack problem