Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems

After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger (2004), knapsack problems became a classical and rich research area in combinatorial optimization. The purpose of this survey, structured in two parts, is to cover the developments appeared in this field after t...

Full description

Saved in:
Bibliographic Details
Published inComputers & operations research Vol. 143; p. 105693
Main Authors Cacchiani, Valentina, Iori, Manuel, Locatelli, Alberto, Martello, Silvano
Format Journal Article
LanguageEnglish
Published New York Elsevier Ltd 01.07.2022
Pergamon Press Inc
Subjects
Combinatorial analysis
Combinatorial optimization
Multiple and multidimensional knapsack problems
Operations research
Optimization
Quadratic knapsack problems
Survey
Quadratic knapsack problems
Survey
Combinatorial optimization
Multiple and multidimensional knapsack problems
Online AccessGet full text

Cover

More Information
Summary:After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger (2004), knapsack problems became a classical and rich research area in combinatorial optimization. The purpose of this survey, structured in two parts, is to cover the developments appeared in this field after the publication of the latter volume. Part I treats the classical single knapsack problems and their variants. The present Part II covers multiple, multidimensional, and quadratic knapsack problems, as well as other relevant variants, such as, e.g., multiobjective and online versions.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2021.105693