On the Product Knapsack Problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Optimization Letters Année : 2018

On the Product Knapsack Problem

Résumé

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.
Fichier non déposé

Dates et versions

hal-02098406 , version 1 (12-04-2019)

Identifiants

Citer

Claudia d'Ambrosio, Fabio Furini, Michele Monaci, Emiliano Traversi. On the Product Knapsack Problem. Optimization Letters, 2018, 12 (4), ⟨10.1007/s11590-017-1227-5⟩. ⟨hal-02098406⟩
124 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More