A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem
From MaRDI portal
Publication:6149387
DOI10.1287/MOOR.2022.1345arXiv2303.06599MaRDI QIDQ6149387
Publication date: 5 March 2024
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.06599
Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Integer programming (90C10)
This page was built for publication: A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem