A note on an open-end bin packing proble
✍
Joseph Y.-T. Leung; Moshe Dror; Gilbert H. Young
📂
Article
📅
2001
🏛
Springer US
🌐
English
⚖ 71 KB
👁 1 views
We consider a variant of the classical one-dimensional bin packing problem, which we call the open-end bin packing problem. Suppose that we are given a list L = (p 1 ; p 2 ; : : : ; pn) of n pieces, where p j denotes both the name and the size of the jth piece in L, and an inÿnite collection of inÿn