Rank two relaxation to the quadratic knapsack problem

zbMATH Open1105.90070MaRDI QIDQ5483089FDOQ5483089

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

Publication date: 16 August 2006

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

zbMATH Keywords

semidefinite relaxationpenalty function methodrounding algorithm

Mathematics Subject Classification ID

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

Cited In (5)

• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
• Title not available (Why is that?)
• A two-phase method for solving continuous rank-one quadratic knapsack problems
• Parametric convex quadratic relaxation of the quadratic knapsack problem
• Ranking in quadratic integer programming 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)