We consider a parametric convex quadratic programming (CQP) relaxation for the quadratic knapsack problem (QKP). This relaxation maintains partial quadratic information from the original QKP by perturbing the objective function to obtain a concave quadratic term.
Feb 16, 2020
Jan 20, 2019 · Abstract:We consider a parametric convex quadratic programming, CQP, relaxation for the quadratic knapsack problem, QKP.
We consider a parametric convex quadratic programming (CQP) relaxation for the quadratic knapsack problem (QKP). This relaxation maintains partial quadratic ...
Aug 8, 2019 · We consider a parametric convex quadratic programming (CQP) relaxation for the quadratic knapsack problem (QKP). This relaxation maintains ...
A new reformulation approach to reduce the complexity of a branch and bound algorithm for solving the knapsack linear integer problem is presented, ...
We consider a parametric convex quadratic programming (CQP) relaxation for the quadratic knapsack problem (QKP). This relaxation maintains partial quadratic ...
We consider a parametric convex quadratic programming, CQP, relaxation for the quadratic knapsack problem, QKP. This relaxation maintains partial quadratic ...
Jun 10, 2019 · Abstract. We consider a parametric convex quadratic programming (CQP) relaxation for the quadratic knapsack problem (QKP).
kth.se. vente ... Enkelt søk · Avansert søk - ForskningspublikasjonerAvansert søk - StudentoppgaverStatistikk · EnglishSvenskaNorsk. Jump to content.
A primal-dual IPM to solve the parametric problem. Minimize a log-barrier ... Consists of an IPM to improve the matrix parameter Qp on a convex quadratic ...