A new upper bound for the 0-1 quadratic knapsack problem
type: Item
instance of: scholarly article
title: A new upper bound for the 0-1 quadratic knapsack problem
zbMATH Open document ID: 0933.90049
DOI: 10.1016/S0377-2217(97)00414-1
author: Alain Billionnet
author: Alain Faye
author: Éric Soutif
published in: European Journal of Operational Research
publication date: 1999-11-08T00:00:00Z
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 1358122
zbMATH Keywords: quadratic programming
zbMATH Keywords: 0-1 quadratic knapsack problem
zbMATH Keywords: quadratic pseudo-Boolean function
zbMATH Keywords: Lagrangian decomposition
zbMATH Keywords: upper bound
zbMATH Keywords: computational experiments
MaRDI profile type: Publication
cites work: Linear programming for the \(0-1\) quadratic knapsack problem
cites work: Q3835301
cites work: A Decomposition Method for Quadratic Zero-One Programming
cites work: Clustering and domination in perfect graphs
cites work: Quadratic knapsack problems
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
cites work: Validation of subgradient optimization
cites work: A semidefinite programming approach to the quadratic knapsack problem
cites work: Min-cut clustering
cites work: A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm
cites work: Quadratic Binary Programming with Application to Capital-Budgeting Problems
cites work: Lagrangean methods for the 0-1 quadratic knapsack problem
full work available at URL: s0377-2217(97)00414-1
OpenAlex ID: W2057884923
description: scientific article; zbMATH DE number 1358122