文件名称:zuiyouzhuangzaizhizhongliangzuida
介绍说明－－下载内容均来自于网络，请自行研究使用
最优装载之回溯法
有n个集装箱要装上1艘载重量分别为c的轮船，其中第i个集装箱的重量为wi。最优装载问题要求确定在装载体积不受限制的情况下，将尽可能多的集装箱装上轮船，并找出一种装载方案-The optimal loading of backtracking n containers to be mounted on a load of, respectively, c the ship, the i-th weight of the container for the wi. The optimal loading problem asked to identify the loading volume unrestricted, the possible number of containers loaded on ships, and to find a load
有n个集装箱要装上1艘载重量分别为c的轮船，其中第i个集装箱的重量为wi。最优装载问题要求确定在装载体积不受限制的情况下，将尽可能多的集装箱装上轮船，并找出一种装载方案-The optimal loading of backtracking n containers to be mounted on a load of, respectively, c the ship, the i-th weight of the container for the wi. The optimal loading problem asked to identify the loading volume unrestricted, the possible number of containers loaded on ships, and to find a load
(系统自动生成,下载前可以参看下载内容)
下载文件列表
最优装载之质量最大.cpp