Deep Reinforcement Learning on Item-Compatibility Graphs for One-Dimensional Bin Packing

T1Covered by 1 source · first reported by arXiv at 24 Sept, 04:00 UTC

arXiv:2609.25397v1 Announce Type: cross 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…

science

Sources

• T1Deep Reinforcement Learning on Item-Compatibility Graphs for One-Dimensional Bin PackingarXiv24 Sept, 04:00