Bin-packing

基本解释

The object grouping problem contains Bin Packing Balance Problem and Vertex Coloring Problem（VCP）.
至於物件分群優化問題，本研究以區間指派法求解裝箱重量均等問題。
In online bin packing problem,for the online property of next fit(NF) algorithm,it is used widely.
在裝箱問題中,下次填充法(NF)由於其在線特性,而被廣泛應用。
A variation of one-dimensional bin packing problem: the minimum cardinality bin covering problem is described and it is a huristic algorithm is designed.
摘要文章介紹一維裝箱問題的一個衍生問題：最小基數箱子覆蓋問題和它的一個啓發式算法。
A Survey of Online Bin Packing Algorithms
侷內裝箱算法綜述
three dimensional bin packing problem
三維裝箱問題