0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization

DOI10.1137/110820762zbMath1277.90087OpenAlexW2005777884MaRDI QIDQ4915173

Dominique Quadri, Serigne Gueye, Carlos Diego Rodrigues, Philippe Yves Paul Michelon

Publication date: 9 April 2013

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110820762

zbMATH Keywords

linearizationbranch-and-bound0-1 quadratic knapsack problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Linearizations (93B18)

Related Items (8)

On exact solution approaches for bilevel quadratic 0-1 knapsack problem ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A Branch-and-Bound Algorithm for Team Formation on Social Networks ⋮ On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ \(t\)-linearization for the maximum diversity problem ⋮ Lagrangian heuristics for the quadratic knapsack problem ⋮ A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems

This page was built for publication: 0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization