Rank two relaxation to the quadratic knapsack problem

MaRDI QIDQ5483089zbMATH OpenFDO

Authors Y. Ling, Jingjing Huang, Feng-Min Xu

Publication date 16 August 2006

zbMATH Keywords

penalty function methodrounding algorithmsemidefinite relaxation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Combinatorial optimization (90C27)

Recommendations

• Exact solution methods for the k-item quadratic knapsack problem
• Parametric convex quadratic relaxation of the quadratic knapsack problem
• A semidefinite programming approach to the quadratic knapsack problem
• Exact Solution of the Quadratic Knapsack Problem
• scientific article; zbMATH DE number 4112385

Cited in

(5)

• Ranking in quadratic integer programming problems
• Parametric convex quadratic relaxation of the quadratic knapsack problem
• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
• scientific article; zbMATH DE number 1911487 (Why is no real title available?)
• A two-phase method for solving continuous rank-one quadratic knapsack problems

This page was built for publication: Rank two relaxation to the quadratic knapsack problem

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