Bin-packing

基本解釋

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