Title: bin Download
 Description: In the bin-packing problem, there are a number of capacity c and n of the box into the box to be loaded with goods. Items i need to occupy s [i] units (0 <s[i]≤c)。成功装载是指能把所有物品都装入箱子。最优装载是指使用最少 箱子的成功装载。 例如某运输公司要把包裹装入卡车中,每个包裹都有一定的重量,且每辆卡车也有其载 重限制(假设每辆卡车的载重都一样)。在卡车装载问题中,希望用最少的卡车来装载包裹。 此问题可看作装箱问题。卡车对应于箱子,包裹对应于物品。
 To Search: bin packing
File list (Click to check if it's the file you need, and recomment it at the bottom):
bin.c
    

DSSZ www.dssz.org