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

DOI10.1080/10556788.2011.627586zbMath1307.90154OpenAlexW1997679962WikidataQ57445423 ScholiaQ57445423MaRDI QIDQ2867417

Xiaoling Sun, Li, Duan, Xiao Jin Zheng

Publication date: 19 December 2013

Published in: Optimization Methods and 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

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

Cites Work

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

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