A note on optimal solutions to quadratic knapsack problems
type: Item
instance of: scholarly article
title: A note on optimal solutions to quadratic knapsack problems
zbMATH Open document ID: 1205.65197
DOI: 10.1504/IJMMNO.2010.035431
author: Haibo Wang
author: Yaquan Xu
author: Gary A. Kochenberger
published in: International Journal of Mathematical Modelling and Numerical Optimisation
publication date: 2010-12-27T00:00:00Z
review text: Summary: We report our success in applying \texttt{CPLEX}'s mixed integer quadratic programming solver to a set of standard quadratic knapsack test problems. The results we give show that this general purpose commercial code outperforms a leading special purpose method reported in the literature by a wide margin.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 5829531
zbMATH Keywords: quadratic knapsack problem
zbMATH Keywords: optimisation
zbMATH Keywords: mixed integer quadratic programming
zbMATH Keywords: numerical examples
describes a project that uses: CPLEX
MaRDI profile type: Publication
Recommended article: The quadratic knapsack problem -- a survey
Recommended article: A Closed-Form Solution To A Class Of Quadratic Knapsack Problems
Recommended article: Approximation of the Quadratic Knapsack Problem
Recommended article: Approximation of the quadratic knapsack problem
Recommended article: A semidefinite programming approach to the quadratic knapsack problem
Recommended article: An O(n) algorithm for quadratic knapsack problems
Recommended article: Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
Recommended article: On the continuous quadratic knapsack problem
Recommended article: Algorithms for the solution of quadratic knapsack problems
Recommended article: Global optimality conditions and optimization methods for quadratic knapsack problems
description: scientific article; zbMATH DE number 5829531