Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive/Completely Positive Prorams

DOI10.1007/978-3-319-61911-8_2zbMath1429.90064OpenAlexW2734050867MaRDI QIDQ5214092

No author found.

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

copositive programmingknapsack problemcompletely positive programquadratic multidimensional knapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Completely positive and copositive program modelling for quadratic optimization problems ⋮ Strong duality for general quadratic programs with quadratic equality constraints

Cites Work

• Unnamed Item
• Unnamed Item
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• Algorithms for the solution of quadratic knapsack problems
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
• The quadratic knapsack problem -- a survey
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
• A Variational Approach to Copositive Matrices
• An Integer Programming Algorithm for Portfolio Selection
• An Adaptive Linear Approximation Algorithm for Copositive Programs
• Special issue: Selected papers of the international workshop on global optimization, GO '99. Firenze, Italy, 1999

This page was built for publication: Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive/Completely Positive Prorams