arXiv (All)
open access
A Combinatorial Benders Decomposition Framework for Two-Dimensional Irregular Bin Packing Problems with Convex Polygons
Two-dimensional irregular bin packing combines combinatorial bin-assignment decisions with difficult geometric feasibility constraints, making exact optimization challenging. This paper develops an exact combinatorial Benders decomposition framework for the two-dimensional irregular bin packing prob
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
- Folding polyominoes with holes into a cube#301284
- Algorithms for packing and covering problems#818515
- Substitution for minimizing/maximizing a tropical linear (fractional) programming#793615
- Substitution for minimizing/maximizing a tropical linear (fractional) programming#789611
- The Complexity of Recognizing SDP Exactness for the Maximum Cut Problem#1123200
Record · ID 1049202
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