scientific article; zbMATH DE number 1795719
From MaRDI portal
Publication:4550768
The problem is to \(\max x^TQx\), s.t. \(Ax\leq b\), \(x_i\in\{0,1\}\) where all coefficients of \(A\) are non-negative and those of \(b\) are all positive. In this paper \(A\) is assumed to be a single row vector and the problem is reformulated as an unconstrained binary quadratic program. This is then solved by a recently developed heuristic method. A lot of computational experiments are given. For the entire collection see [Zbl 0988.00046].
Recommendations
- The quadratic knapsack problem -- a survey
- Linear programming for the \(0-1\) quadratic knapsack problem
- An improved convex 0-1 quadratic program reformulation for quadratic knapsack problems
- An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
Cited in
(12)- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- A computational study on the quadratic knapsack problem with multiple constraints
- The polynomial robust knapsack problem
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- Penalty and partitioning techniques to improve performance of QUBO solvers
- A dynamic programming heuristic for the quadratic knapsack problem
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem
- The quadratic knapsack problem
- The quadratic knapsack problem with setup
- The quadratic knapsack problem -- a survey
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4550768)
