Reformulation of the quadratic multidimensional knapsack problem as copositive/completely positive programs

DOI10.1007/978-3-319-61911-8_2MaRDI QIDQ5214092zbMATH OpenOpenAlexFDO

Authors

Publication date 7 February 2020

Published in Advanced Computational Methods for Knowledge Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-61911-8_2

zbMATH Keywords

knapsack problemcopositive programmingcompletely positive programquadratic multidimensional knapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• An improved convex 0-1 quadratic program reformulation for quadratic knapsack problems
• Integer quadratic knapsack problems
• Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
• Algorithms for the solution of quadratic knapsack problems
• A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming

Cites work

• scientific article; zbMATH DE number 1933860 (Why is no real title available?)
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
• A variational approach to copositive matrices
• Algorithms for the solution of quadratic knapsack problems
• An Integer Programming Algorithm for Portfolio Selection
• An adaptive linear approximation algorithm for copositive programs
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Special issue: Selected papers of the international workshop on global optimization, GO '99. Firenze, Italy, 1999
• The quadratic knapsack problem -- a survey
• Upper bounds for large scale integer quadratic multidimensional knapsack problems
• Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem

Cited in

(3)

• Strong duality for general quadratic programs with quadratic equality constraints
• Completely positive and copositive program modelling for quadratic optimization problems
• Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems

This page was built for publication: Reformulation of the quadratic multidimensional knapsack problem as copositive/completely positive programs

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