arXiv (All)
open access
Improved Upper Bounds for Dynamic Bin Packing of General, Unit-Fraction, and Power-Fraction Squares
This paper presents significant upper-bound improvements for dynamic 2D square bin packing, where square items arrive and depart over time and the objective is to minimize the peak number of concurrent active unit bins. In our model, repacking is permitted only within a destination bin upon item arr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Improved Approximation Algorithms for Three-Dimensional Bin Packing#665481
- Improved Approximation Algorithms for Three-Dimensional Bin Packing#663981
- Online Bin Packing with Per-Bin Maximum Delay#1077517
- Exact and Matheuristic Methods for the Generalized Multiple Strip Packing Problem#1013541
- PrecPack: An Efficient Open-Source Exact Solver for Bin Packing with Generalized Precedence Constraints#1123733
Record · ID 985323
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive