The Knapsack Problem and Its Variants: Formulations and Solution Methods - Université Polytechnique des Hauts-de-France Accéder directement au contenu
Chapitre D'ouvrage Année : 2022

The Knapsack Problem and Its Variants: Formulations and Solution Methods

Résumé

The Knapsack Problem is among the most well-known and widely studied optimization problems. Given a set of items, each item with an associated weight, the problem asks for a subset of items with a total weight no larger than an available capacity and which maximizes a corresponding measure of profit. The problem appears in distinct versions and also in accompanying variants to these versions, each version being defined by a different type of objective function. Every variant, in turn, imposes some additional requirements on item selection. In this chapter we review a subset of these variants, with a focus on recent papers that bring interesting new applications for the problem
Fichier non déposé

Dates et versions

hal-03723558 , version 1 (15-07-2022)

Identifiants

Citer

Christophe Wilbaut, Saïd Hanafi, Igor Machado Coelho, Abilio Lucena. The Knapsack Problem and Its Variants: Formulations and Solution Methods. The Palgrave Handbook of Operations Research, Springer International Publishing, pp.105-151, 2022, ⟨10.1007/978-3-030-96935-6_4⟩. ⟨hal-03723558⟩
54 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More