A conic approximation method for the 0-1 quadratic knapsack problem

DOI10.3934/JIMO.2013.9.531MaRDI QIDQ380482zbMATHOpenAlexFDO

Authors Dejun Chen, Zhenbo Wang, Wenxun Xing, Jing Zhou

Publication date 14 November 2013

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2013.9.531

zbMATH Keywords

0-1 quadratic knapsack problemconic approximationnonnegative quadratic function cone

Mathematics Subject Classification ID

Quadratic programming (90C20) Semidefinite programming (90C22) Integer programming (90C10)

Recommendations

• 0-1 quadratic knapsack problems: an exact approach based on a \(t\)-linearization
• Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
• Exact solution methods for the \(k\)-item quadratic knapsack problem
• Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
• An improved convex 0-1 quadratic program reformulation for quadratic knapsack problems

Cited in

(8)

• Conic approximation to quadratic optimization with linear complementarity constraints
• Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems
• A binary differential search algorithm for the 0-1 multidimensional knapsack problem
• scientific article; zbMATH DE number 6836465 (Why is no real title available?)
• Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem
• A Newton's method for the continuous quadratic knapsack problem
• A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints
• Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem

This page was built for publication: A conic approximation method for the 0-1 quadratic knapsack problem

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