A conic approximation method for the 0-1 quadratic knapsack problem

DOI10.3934/jimo.2013.9.531zbMath1281.90028OpenAlexW2074438010MaRDI QIDQ380482

Jing Zhou, Dejun Chen, Wen-Xun Xing, Zhen-bo Wang

Publication date: 14 November 2013

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2013.9.531

zbMATH Keywords

conic approximation0-1 quadratic knapsack problemnonnegative quadratic function cone

Mathematics Subject Classification ID

Semidefinite programming (90C22) Integer programming (90C10) Quadratic programming (90C20)

Related Items (3)

Conic approximation to quadratic optimization with linear complementarity constraints ⋮ Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems ⋮ A binary differential search algorithm for the 0-1 multidimensional knapsack problem

This page was built for publication: A conic approximation method for the 0-1 quadratic knapsack problem