scholarly journals A cut-and-branch algorithm for the Quadratic Knapsack Problem

2020 ◽  
pp. 100579 ◽  
Author(s):  
Franklin Djeumou Fomeni ◽  
Konstantinos Kaparis ◽  
Adam N. Letchford
Keyword(s):  
Knapsack Problem ◽  
Quadratic Knapsack Problem ◽  
Quadratic Knapsack

On the continuous quadratic knapsack problem

1992 ◽  
Vol 55 (1-3) ◽  
pp. 99-108 ◽  
Author(s):  
A. G. Robinson ◽  
N. Jiang ◽  
C. S. Lerme
Keyword(s):  
Knapsack Problem ◽  
Quadratic Knapsack Problem ◽  
Quadratic Knapsack

scholarly journals On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem

2020 ◽  
Vol 92 (1) ◽  
pp. 107-132 ◽  
Author(s):  
Britta Schulze ◽  
Michael Stiglmayr ◽  
Luís Paquete ◽  
Carlos M. Fonseca ◽  
David Willems ◽  
...  
Keyword(s):  
Knapsack Problem ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Approximation Ratio ◽  
Experimental Results ◽  
Cardinality Constraint ◽  
Quadratic Knapsack Problem ◽  
Problem Instances ◽  
Quadratic Knapsack ◽  
Special Case

Abstract In this article, we introduce the rectangular knapsack problem as a special case of the quadratic knapsack problem consisting in the maximization of the product of two separate knapsack profits subject to a cardinality constraint. We propose a polynomial time algorithm for this problem that provides a constant approximation ratio of 4.5. Our experimental results on a large number of artificially generated problem instances show that the average ratio is far from theoretical guarantee. In addition, we suggest refined versions of this approximation algorithm with the same time complexity and approximation ratio that lead to even better experimental results.

The Quadratic Knapsack Problem

2004 ◽  
pp. 349-388 ◽  
Author(s):  
Hans Kellerer ◽  
Ulrich Pferschy ◽  
David Pisinger
Keyword(s):  
Knapsack Problem ◽  
Quadratic Knapsack Problem ◽  
Quadratic Knapsack
Sign in / Sign up

Export Citation Format

Share Document