Online Knapsack
Online Knapsack is an online optimization problem in which items arrive sequentially and must be irrevocably accepted or rejected upon arrival, aiming to maximize the total value of selected items without exceeding a fixed capacity, distinguishing it from offline knapsack variants by the absence of future item information and the requirement for immediate decision-making.
53
Publications
5.6K
Citations
124
Authors
86
Institutions
Publications per year
2017–2026
23
Variants
Online Knapsack Problem
Parents
53
Ole‐Christoffer Granmo, B. John Oommen, Svein Arild Myrer et al. · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · 2007 · 99 citations
1–5 of 53
124
5
h-index
Hong Kong University of Science and Technology, Hong Kong SAR China
5 publications · 101 citations
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 124
86
Dalian University of Technology
Dalian, China
5 h-index
6 publications
151 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
5 h-index
8 publications
162 citations

Kyoto University
Kyoto, Japan
4 h-index
4 publications
109 citations

Cornell University
Ithaca, United States
4 h-index
7 publications
150 citations
California Institute of Technology
Pasadena, United States
4 h-index
6 publications
138 citations

University of Massachusetts Amherst
Amherst Center, United States
4 h-index
8 publications
178 citations

University of Agder
Kristiansand, Norway
3 h-index
7 publications
433 citations

Carleton University
Ottawa, Canada
3 h-index
3 publications
167 citations
1–8 of 86
6 publications · 167 citations
6
h-index
Repository · 3 publications · 57 citations
3
h-index
2 publications · 49 citations
2
h-index
OR · 2 publications · 3.8K citations
2
h-index
POMACS · 2 publications · 59 citations
2
h-index
1–5