On the Product Knapsack Problem

Given a set of items, each characterized by a profit and a weight, we study the problem of maximizing the product of the profits of the selected items, while respecting a given capacity. To the best of our knowledge this is the first manuscript that studies this variant of the knapsack problem which we call Product Knapsack Problem (PKP). We show that PKP is weakly NP-hard. We propose and implement a Dynamic Programming algorithm and different Mixed Integer Linear and Nonlinear Programming formulations for the PKP. Finally, we present an extensive computational study on a large set of benchmark instances derived from the literature.

[1]  P. Hammer,et al.  Quadratic knapsack problems , 1980 .

[2]  Silvano Martello,et al.  Heuristic algorithms for the general nonlinear separable knapsack problem , 2011, Comput. Oper. Res..

[3]  David Pisinger,et al.  The quadratic knapsack problem - a survey , 2007, Discret. Appl. Math..

[4]  Takeo Yamada,et al.  Heuristic and Exact Algorithms for the Disjunctively Constrained Knapsack Problem , 2002 .

[5]  David Pisinger,et al.  Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction , 2007, INFORMS J. Comput..

[6]  Nikolaos V. Sahinidis,et al.  A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..

[7]  Yann Chevaleyre,et al.  A Short Introduction to Computational Social Choice , 2007, SOFSEM.

[8]  S. Brams,et al.  The paradox of multiple elections , 1998 .

[9]  Giovanni Rinaldi,et al.  Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case , 2007, SIAM J. Optim..

[10]  Leo Liberti,et al.  Branching and bounds tighteningtechniques for non-convex MINLP , 2009, Optim. Methods Softw..

[11]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[12]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[13]  Valentina Cacchiani,et al.  A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph , 2017, INFORMS J. Comput..

[14]  Joel Uckelman.  Alice and Bob Will Fight: The Problem of Electing a Committee in the Presence of Candidate Interdependence , 2010, ECAI.

[15]  Christodoulos A. Floudas,et al.  ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations , 2014, Journal of Global Optimization.

[16]  Paolo Toth,et al.  Exact Solution of the Quadratic Knapsack Problem , 1999, INFORMS J. Comput..

[17]  Egon Balas,et al.  An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..

[18]  Ruslan Sadykov,et al.  Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm , 2013, INFORMS J. Comput..

[19]  Ellis Horowitz,et al.  Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.

[20]  Hans Kellerer,et al.  Knapsack problems , 2004 .

[21]  S. Martello,et al.  Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .

[22]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .