On the online bin packing problem
By S. Seiden. JACM, 2001
358 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/87aa2524ac337cdccebf5cebfeeb84c02ffe6f7a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Computer Graphics and Computer-Aided Design
In Industrial and Manufacturing Engineering
Citations in the corpus
- Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model (2024, background): “We focus on the online scenario (Seiden, 2002), where items are packed as they arrive, in contrast to the offline scenario where all items are known beforehand.”
- A Framework for Partitioning and Execution of Data Stream Applications in Mobile Cloud Computing (2012, methodology): “The load scheduling problem can be modeled as a Online Bin Packing Problem [21].”
- Pocket: Elastic Ephemeral Storage for Serverless Analytics (2018, neutral): “sharing resources with other jobs [67].”
- A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers (2010, methodology): “If only a single resource such as CPU is considered per day, the online version of SSAP can be solved using online bin packing algorithms [35].”