The Fractional Knapsack Problem is a greedy optimization problem in combinatorial algorithmics where the objective is to maximize the total value of items in a knapsack of limited capacity by allowing fractional amounts of each item to be selected, distinguishing it from the discrete variant by permitting partial inclusion of items.
32
Publications
1.1K
Citations
69
Authors
40
Institutions
Publications per year
2017–2026
15
Parents
Publications
32
Ole‐Christoffer Granmo, B. John Oommen, Svein Arild Myrer et al. · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · 2007 · 99 citations
A ninth bibliography of fractional programming
I. M. Stancu-Minasian · Optimization · 2019 · 57 citations
1–5 of 32
Authors
69
- BJ
5
h-index
- OG
5
h-index
- I
3
h-index
- MH
2
h-index
- MM
2
h-index
1–5 of 69
Institutions
40
Carleton University
Ottawa, Canada
5 h-index
5 publications
199 citations
University of Agder
Kristiansand, Norway
5 h-index
12 publications
508 citations
Romanian Academy
Bucharest, Romania
3 h-index
3 publications
116 citations
University of Oulu
Oulu, Finland
3 h-index
6 publications
122 citations
California Institute of Technology
Pasadena, United States
2 h-index
4 publications
98 citations
University of Massachusetts Amherst
Amherst Center, United States
2 h-index
4 publications
98 citations
Hong Kong University of Science and Technology
Hong Kong, Hong Kong
2 h-index
4 publications
98 citations
Universiti Putra Malaysia
Seri Kembangan, Malaysia
1 h-index
4 publications
44 citations
1–8 of 40
Venues
- Optimization
3 publications · 116 citations
3
h-index
- IEEE Transactions on Communications
2 publications · 157 citations
2
h-index
- European Journal of Operational Research
2 publications · 46 citations
2
h-index
- Management Science
1 publications · 28 citations
1
h-index
- Proceedings of the ACM on Measurement and Analysis of Computing Systems
POMACS · 1 publications · 39 citations
1
h-index
1–5