文件名称:06
- 所属分类：
- 其他小程序
- 资源属性：
- [Windows] [Visual.Net] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 936kb
- 下载次数：
- 0次
- 提 供 者：
- c*
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
最优装载方案
成绩: 0 / 折扣: 0.8
试设计一个用队列式分支限界法搜索子集空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数，并将此函数用于解装载问题。
装载问题描述如下：有一批共n个集装箱要装上艘载重量为c的轮船，其中集装箱i的重量为wi 。找出一种最优装载方案，将轮船尽可能装满，即在装载体积不受限制的情况下，将尽可能重的集装箱装上轮船。
输入：第一行有2个正整数n和c。n是集装箱数，c是轮船的载重量
接下来的1行中有n个正整数，表示集装箱的重量
输出：最大载重量
例如：
输入：
5 10
7 2 6 5 4
输出：
10-Optimal loading program
Results: 0/discount: 0.8
Try to design a queue-type branch and bound by law search a subset of function space tree. The function of the parameters to determine the feasibility of including the node function and the upper bound of the necessary functions, such as function, this function will be loaded for the solution of the problem.
Loading problem described as follows: a group of n containers were loaded on ships to load ships for the c, of which the weight of the container i was wi. A program to find the optimal load, the ship filled with as much as possible, that is unrestricted in the loading volume of cases, as far as possible, re-fitted shipping container.
Input: the first line there are two positive integers n and c. n is the number of containers, c is the ship s deadweight
1 the next line in a positive integer n, that the weight of the container
Output: the maximum load
For example:
Input:
5 10
72,654
Output:
10
成绩: 0 / 折扣: 0.8
试设计一个用队列式分支限界法搜索子集空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数，并将此函数用于解装载问题。
装载问题描述如下：有一批共n个集装箱要装上艘载重量为c的轮船，其中集装箱i的重量为wi 。找出一种最优装载方案，将轮船尽可能装满，即在装载体积不受限制的情况下，将尽可能重的集装箱装上轮船。
输入：第一行有2个正整数n和c。n是集装箱数，c是轮船的载重量
接下来的1行中有n个正整数，表示集装箱的重量
输出：最大载重量
例如：
输入：
5 10
7 2 6 5 4
输出：
10-Optimal loading program
Results: 0/discount: 0.8
Try to design a queue-type branch and bound by law search a subset of function space tree. The function of the parameters to determine the feasibility of including the node function and the upper bound of the necessary functions, such as function, this function will be loaded for the solution of the problem.
Loading problem described as follows: a group of n containers were loaded on ships to load ships for the c, of which the weight of the container i was wi. A program to find the optimal load, the ship filled with as much as possible, that is unrestricted in the loading volume of cases, as far as possible, re-fitted shipping container.
Input: the first line there are two positive integers n and c. n is the number of containers, c is the ship s deadweight
1 the next line in a positive integer n, that the weight of the container
Output: the maximum load
For example:
Input:
5 10
72,654
Output:
10
(系统自动生成,下载前可以参看下载内容)
下载文件列表
最优装载
........\Debug
........\.....\最优装载.exe
........\.....\最优装载.ilk
........\.....\最优装载.pdb
........\最优装载
........\........\Debug
........\........\.....\BuildLog.htm
........\........\.....\mt.dep
........\........\.....\vc90.idb
........\........\.....\vc90.pdb
........\........\.....\最优装载.exe.intermediate.manifest
........\........\.....\最优装载.obj
........\........\最优装载.cpp
........\........\最优装载.vcproj
........\........\最优装载.vcproj.CJTC1989-PC.caojun.user
........\最优装载.ncb
........\最优装载.sln
........\Debug
........\.....\最优装载.exe
........\.....\最优装载.ilk
........\.....\最优装载.pdb
........\最优装载
........\........\Debug
........\........\.....\BuildLog.htm
........\........\.....\mt.dep
........\........\.....\vc90.idb
........\........\.....\vc90.pdb
........\........\.....\最优装载.exe.intermediate.manifest
........\........\.....\最优装载.obj
........\........\最优装载.cpp
........\........\最优装载.vcproj
........\........\最优装载.vcproj.CJTC1989-PC.caojun.user
........\最优装载.ncb
........\最优装载.sln