Knapsack Problems is a combinatorial optimization problem in which the objective is to select a subset of items, each with given weights and values, such that the total value is maximized while the total weight does not exceed a given capacity constraint.
1.9K
Publications
128.5K
Citations
3.6K
Authors
1.3K
Institutions
Publications per year
2017–2026
463
Variants
Knapsack Problem
Publications
1.9K
1–5 of 1.9K
Authors
3.6K
- SM
19
h-index
- DP
18
h-index
- UP
17
h-index
- PT
16
h-index
- JH
16
h-index
1–5 of 3.6K
Institutions
1.3K
University of Bologna
Bologna, Italy
32 h-index
75 publications
12.6K citations
Centre National de la Recherche Scientifique
Paris, France
25 h-index
87 publications
3.6K citations
Hebei GEO University
Shijiazhuang, China
22 h-index
53 publications
2.2K citations
Massachusetts Institute of Technology
Cambridge, United States
20 h-index
37 publications
11.6K citations
University of Graz
Graz, Austria
19 h-index
32 publications
2K citations
Université Polytechnique Hauts-de-France
Valenciennes, France
18 h-index
40 publications
2.3K citations
Carnegie Mellon University
Pittsburgh, United States
17 h-index
27 publications
2.7K citations
University of Copenhagen
Copenhagen, Denmark
17 h-index
21 publications
3.3K citations
1–8 of 1.3K
Venues
- European Journal of Operational Research
113 publications · 7.6K citations
40
h-index
- Operations Research
55 publications · 11K citations
36
h-index
- Computers & Operations Research
68 publications · 3.4K citations
33
h-index
- Management Science
36 publications · 3.8K citations
29
h-index
- Mathematical Programming
43 publications · 2.7K citations
27
h-index
1–5