The online knapsack problem is a classic resource allocation in networking and operations research. Its basic version studies how to pack arriving items of different sizes values into capacity-limited knapsack. In this paper, we study general that includes item departures, while also considering multiple knapsacks multi-dimensional sizes. We design threshold-based algorithm prove the can achiev...