An improved convex 0-1 quadratic program reformulation for quadratic knapsack problems

MaRDI QIDQ4906120zbMATH OpenFDO

Authors Shuhui Ji, Xiaoling Sun, X. J. Zheng

Publication date 7 February 2013

Full work available at URL http://www.yokohamapublishers.jp/online2/oppjo/vol8/p75.html

zbMATH Keywords

convex 0-1 QP reformulationconvex relaxationquadratic knapsack problemSDP relaxation

Mathematics Subject Classification ID

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

Recommendations

• An improved convex 0-1 quadratic program reformulation for chance-constrained quadratic knapsack problems
• Parametric convex quadratic relaxation of the quadratic knapsack problem
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
• Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
• Exact solution methods for the k-item quadratic knapsack problem

Cited in

(8)

• Parametric convex quadratic relaxation of the quadratic knapsack problem
• An improved convex 0-1 quadratic program reformulation for chance-constrained quadratic knapsack problems
• Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
• A conic approximation method for the 0-1 quadratic knapsack problem
• scientific article; zbMATH DE number 1795719 (Why is no real title available?)
• Reformulation of the quadratic multidimensional knapsack problem as copositive/completely positive programs
• An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c

This page was built for publication: An improved convex 0-1 quadratic program reformulation for quadratic knapsack problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4906120)