A note on semidefinite relaxation for 0-1 quadratic knapsack problems
From MaRDI portal
Publication:2867417
DOI10.1080/10556788.2011.627586zbMATH Open1307.90154OpenAlexW1997679962WikidataQ57445423 ScholiaQ57445423MaRDI QIDQ2867417FDOQ2867417
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
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
- The quadratic knapsack problem -- a survey
- Quadratic knapsack problems
- Extremal problems on the set of nonnegative definite matrices
- A semidefinite programming approach to the quadratic knapsack problem
- Exact Solution of the Quadratic Knapsack Problem
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- A new upper bound for the 0-1 quadratic knapsack problem
- Duality gap estimation of linear equality constrained binary quadratic programming
- On the supermodular knapsack problem
- An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
Cited In (4)
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)
