Deep Reinforcement Learning on Item-Compatibility Graphs for One-Dimensional Bin Packing
arXiv:2609.25397v1 Announce Type: new Abstract: The one-dimensional bin packing problem (1D-BPP) is a classical NP-hard combinatorial optimization problem with applications ranging from logistics and manufacturing to cloud resource management. Although deep reinforcement learning (DRL) has become a…
Read the full story at arXiv cs.LG ↗
Timeline · 1 report
- 2026-09-23 04:00 · arXiv cs.LG
Deep Reinforcement Learning on Item-Compatibility Graphs for One-Dimensional Bin Packing