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
三维装箱问题