arXiv (OAI Expanded)
open access
Improved Approximation Algorithms for Three-Dimensional Bin Packing
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
- An online bin-packing problem with an underlying ternary structure#316788
- High-Multiplicity Bin Packing is FPT#1123335
- MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem#1156291
- Exact and Matheuristic Methods for the Generalized Multiple Strip Packing Problem#1013541
Record · ID 663981
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