Approximation of the quadratic knapsack problem

DOI10.1016/j.orl.2016.05.005zbMath1380.90240arXiv1509.01866OpenAlexW2963081326MaRDI QIDQ1694783

Peng Zhang

Publication date: 6 February 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.01866

zbMATH Keywords

approximation algorithmquadratic knapsack

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (7)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ On the rectangular knapsack problem ⋮ Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem ⋮ A lifted-space dynamic programming algorithm for the quadratic knapsack problem ⋮ Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem ⋮ Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback

Cites Work

• Unnamed Item
• Unnamed Item
• The quadratic knapsack problem -- a survey
• The quadratic 0-1 knapsack problem with series-parallel support
• Detecting high log-densities
• Approximation of the Quadratic Knapsack Problem
• The dense \(k\)-subgraph problem

This page was built for publication: Approximation of the quadratic knapsack problem