arXiv (All)
open access
GeoNest: Learning to Select Failure-Aware Neighborhoods for the Irregular Knapsack Problem in a Circular Container
The two-dimensional irregular knapsack problem in a fixed circular container is an important combinatorial optimization problem for maximizing material utilization in manufacturing. Conventional geometric packing solvers can produce tightly packed layouts, yet they often partition the residual space
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
- 50 U.S.C. § 4512 — Hoarding of designated scarce materials#598835
- A Logic-based Benders Decomposition Method for Refrigerated Container Stacking and Relocation Problem#196230
- A Logic-based Benders Decomposition Method for Refrigerated Container Stacking and Relocation Problem#196123
- Order and disorder in hard-sphere packings#1038979
- Faster Minimum k-Cut I: Simple and Sparse Weighted Graphs#1064325
Record · ID 1143464
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