Description: Bin-packing problem solution sets, a total of 5. Q: Is there a box capacity of v (a positive integer, o ≤ v ≤ 20000), at the same time there are n-items (o ≤ n ≤ 30), each item has a size (positive integer). Request from the n-value items, either check box if the 1000 loaded, so that the remaining space for the smallest box.
To Search:
- [BreakGcc] - The most horrible onliner in C you even
- [2d3dkp] - 3d bin packing loader pack packaging cag
- [BinPacking] - Bin packing algorithms implementation in
- [PackingTool] - packing tool
File list (Check if you may need any files):
装箱问题解法集\box1.pas
..............\box2.pas
..............\box3.pas
..............\box4.pas
..............\box5(搜索).PAS
装箱问题解法集
Download