Deep reinforcement learning on item-compatibility graphs for one-dimensional bin packing.
Read the original at arxiv.org→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...
Original headline: "Deep Reinforcement Learning on Item-Compatibility Graphs for One-Dimensional Bin Packing"
Coverage timeline
- Sep 23, 04:00 UTC arXiv cs.LG lead source Deep Reinforcement Learning on Item-Compatibility Graphs for One-Dimensional Bin Packing