搜索资源列表
-
2下载：
利用C语言，解决多为背包问题的禁忌搜索算法！世界名家所写！-Tabu search code for multimentional bin packing problem
-
-
3下载：
装箱问题的FFD代码，很有用的，大家-FFD bin-packing problem of the code, looking for a long time, we try
-
-
0下载：
2D single bin packing 问题的4Block算法-4-Block Algorithm for 2D single bin packing Problem
-
-
2下载：
自己编写的装箱问题的各种求解策略，包括BESTFIT,FIRSTFIT,WORSTFIT,NEXTFIT-I have written a variety of bin-packing problem solving strategy, including the BESTFIT, FIRSTFIT, WORSTFIT, NEXTFIT etc.
-
-
0下载：
bin packing problem
vb and c# codes exists
-
-
8下载：
货物配装问题实质上是背包问题与装箱问题的混合，有着广泛的应用。配装,是指充分利用运输工具(如火车、货车、轮船等,本文主要是指货车) 的载重量和容积,采用先进的装载方法,合理安排货物的装载计划，最大限度地发挥货车容积和承载能力，从而降低配送成本。-Cargo loading problem and knapsack problem is essentially a mixture of bin-packing problem, with a wide range of applications.
-
-
0下载：
详细讲解了动态规划的算法问题，再通过“装箱问题”等7个程序实例介绍解决动态规划问题的思路和方法。-Gave a detailed algorithm for dynamic programming problems, and through the " bin-packing problem" and other instances of seven procedures introduced to solve the problem of dynamic programmin
-
-
0下载：
三维装箱问题的混合模拟退火算法，解决np-hard问题的基本思路-Three-dimensional bin-packing problem of the hybrid simulated annealing algorithm, np-hard problem to solve the basic ideas
-
-
0下载：
装箱问题解法集，共5个。
问题：有一个箱子容量为v(正整数，o≤v≤20000)，同时有n个物品(o≤n≤30)，每个物品有一个体积 (正整数)。要求从 n 个物品中，任取若千个装入箱内，使箱子的剩余空间为最小。 -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
-
-
5下载：
是解决装箱问题的程序，已经解决的比较好了。-Procedures to solve the packing problem，Has been resolved better . .
-
-
0下载：
3d bin packing problem
-
-
0下载：
Bin packing problem belongs to the class of NP-hard problems, like the others that were discussed in previous articles. The task is to pack a set of items of different size into bins of fixed size in such way that minimal number bins is used. Dependi
-
-
0下载：
对一维数据问题的优化，仅供参考的代码，通过优化使结果更优(The optimization of one dimensional data problem)
-
-
1下载：
bin packing problem in matlab
-
-
0下载：
matlab code for bin packed problem
-
-
1下载：
这是一个可以完成装箱问题的遗传算法，很容易移植到各个地方。(This is a genetic algorithm that can complete the bin packing problem. It is easy to transplant to various places.)
-
