arXiv (All)
open access
Approximation algorithms for the square min-sum bin packing problem
In this work, we study the Square Min-Sum Bin Packing Problem (SMSBPP), where a list of $n$ square items has to be packed into square bins of dimensions $1 \times 1$ with no overlap between the areas of the items. The bins are indexed (starting at one) and the cost of packing each item is equal to t
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
- Approximation algorithms for the square min-sum bin packing problem#920782
- An online bin-packing problem with an underlying ternary structure#316788
- Bin Packing Problem with Machine Learning Techniques#624454
- High-Multiplicity Bin Packing is FPT#1123335
- An In-depth Study of LLM Contributions to the Bin Packing Problem#288183
Record · ID 925016
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