Description: Container packing problem given a container, and its length L, width W and height H, the current batch of cylindrical timber, each timber are of a long L, but the radius is different from the first i set the root radius of timber ri. Asked how the packing, making maximum utilization of container space
To Search:
- [LimitBin] - packing problem : packing problems, ther
- [circlecutting] - problem given a container, its long-L, w
- [window_socket] - windows of network programming source bo
- [b048008] - this experiment designed to use the line
- [expr3] - problem given a container, its length L,
- [tanxinfazhuangxiang] - Data structure in the bin-packing proble
- [lingjian_1] - Parts mutilation given width W of a rect
- [greedy] - err
- [lab_3] - Given a container, and its length L, wid
- [kmeansren] - k-means clustering algorithm for the dyn
File list (Check if you may need any files):
Download