arXiv (All)
open access
SAR: Learning Global Item-Space Matching and Geometry-Aware Placement Ranking for Buffered Online 3D Bin Packing
Online 3D bin packing with a bounded buffer requires irreversible item-selection and placement decisions under limited knowledge of future arrivals. Feasibility alone is insufficient, as feasible actions can produce different residual-space structures and subsequent packing opportunities. A central
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
- Optimal Extensions of Cross-Sections: Sphere Packings in Dimensions 38 to 43#793790
- Optimal Extensions of Cross-Sections: Sphere Packings in Dimensions 38 to 43#789785
- MetaSpatial: Reinforcing 3D Spatial Reasoning in VLMs for the Metaverse#342724
- Breaking the symmetry of nanoparticles by anisotropic modification & fabrication of 3D sers platform for information storage application#190051
- Right concentration#1303520
Record · ID 1400614
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