A note on semidefinite relaxation for 0-1 quadratic knapsack problems

DOI10.1080/10556788.2011.627586MaRDI QIDQ2867417zbMATH OpenOpenAlexWikidataFDO

Authors Xiaoling Sun, Duan Li, X. J. Zheng

Publication date 19 December 2013

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2011.627586

zbMATH Keywords

SDP relaxationLagrangian dual0-1 quadratic knapsack problemuniqueness of optimal solution

Mathematics Subject Classification ID

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

Recommendations

• A semidefinite programming approach to the quadratic knapsack problem
• Exact solution methods for the \(k\)-item quadratic knapsack problem
• scientific article; zbMATH DE number 1911487
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
• Quadratic maximization and semidefinite relaxation

Cites work

• A new upper bound for the 0-1 quadratic knapsack problem
• A semidefinite programming approach to the quadratic knapsack problem
• An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• Duality gap estimation of linear equality constrained binary quadratic programming
• Exact Solution of the Quadratic Knapsack Problem
• Extremal problems on the set of nonnegative definite matrices
• Lagrangean methods for the 0-1 quadratic knapsack problem
• On the gap between the quadratic integer programming problem and its semidefinite relaxation
• On the supermodular knapsack problem
• Quadratic knapsack problems
• The quadratic knapsack problem -- a survey

Cited in

(4)

• A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem
• scientific article; zbMATH DE number 1911487 (Why is no real title available?)
• A semidefinite programming approach to the quadratic knapsack problem
• Quadratic knapsack relaxations using cutting planes and semidefinite programming

This page was built for publication: A note on semidefinite relaxation for 0-1 quadratic knapsack problems

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