Welcome![Sign In][Sign Up]
Location:
Search - fenzhi

Search list

[Other resourcefenzhi

Description: 零件切割问题: 给定一块宽度为W的矩形板,矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi,宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小? 任给一个输入实例,能输出切割所需要的实际高度并能用图形演示切割的过程-cutting parts : a given width of the rectangular plate W, the height of rectangular plate unrestricted. Need from the board is cutting out respectively n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked how cutting makes use of the rectangular plate height h minimum? As an input for example, will cut output by the needs of the high and can be used graphic demonstration of the cutting proce
Platform: | Size: 65743 | Author: 章为到 | Hits:

[Otherfenzhi

Description: 用分支定界算法求以下问题: 某公司于乙城市的销售点急需一批成品,该公司成品生产基地在甲城 市。 甲城市与乙城市之间共有n 座城市,互相以公路连通。甲城市、乙 城市以及其它各城市之间的公路连通情况及每段公路的长度由矩阵 M1 给出。 每段公路均由地方政府收取不同额度的养路费等费用,具体数额由矩 阵M2 给出。 请给出在需付养路费总额不超过1500 的情况下,该公司货车运送其 产品从甲城市到乙城市的最短运送路线。 具体数据参见文件: M1.txt: 各城市之间的公路连通情况及每段公路的长度矩阵(有向 图) 甲城市为城市Num.1,乙城市为城市Num.50。 M2.txt:每段公路收取的费用矩阵(非对称)。
Platform: | Size: 2316 | Author: rl | Hits:

[Other resourcefenzhi

Description: 整数规划分支定界算法matlab通用源程序 各参数的意义同matlab优化工具箱的线性规划函数linprog 调用前,输入参数要化成matlab的标准形式
Platform: | Size: 1029 | Author: 周虎川 | Hits:

[Data structsfenzhi

Description: 零件切割问题: 给定一块宽度为W的矩形板,矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi,宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小? 任给一个输入实例,能输出切割所需要的实际高度并能用图形演示切割的过程-cutting parts : a given width of the rectangular plate W, the height of rectangular plate unrestricted. Need from the board is cutting out respectively n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked how cutting makes use of the rectangular plate height h minimum? As an input for example, will cut output by the needs of the high and can be used graphic demonstration of the cutting proce
Platform: | Size: 65536 | Author: 章为到 | Hits:

[Otherfenzhi

Description: 用分支定界算法求以下问题: 某公司于乙城市的销售点急需一批成品,该公司成品生产基地在甲城 市。 甲城市与乙城市之间共有n 座城市,互相以公路连通。甲城市、乙 城市以及其它各城市之间的公路连通情况及每段公路的长度由矩阵 M1 给出。 每段公路均由地方政府收取不同额度的养路费等费用,具体数额由矩 阵M2 给出。 请给出在需付养路费总额不超过1500 的情况下,该公司货车运送其 产品从甲城市到乙城市的最短运送路线。 具体数据参见文件: M1.txt: 各城市之间的公路连通情况及每段公路的长度矩阵(有向 图) 甲城市为城市Num.1,乙城市为城市Num.50。 M2.txt:每段公路收取的费用矩阵(非对称)。-err
Platform: | Size: 2048 | Author: rl | Hits:

[matlabfenzhi

Description: 整数规划分支定界算法matlab通用源程序 各参数的意义同matlab优化工具箱的线性规划函数linprog 调用前,输入参数要化成matlab的标准形式-Integer programming branch and bound algorithm matlab source general meaning of each parameter with the matlab optimization toolbox of linear programming linprog function call before the input parameters to the standard form into matlab
Platform: | Size: 1024 | Author: 周虎川 | Hits:

[CSharpfenzhi

Description: 用分支考试等级分开了很多时间快乐发生的累计访客的-Separate branch of the examination grades with a lot of time accumulated occurred happy visitors
Platform: | Size: 410624 | Author: lidongdong | Hits:

[Data structsfenzhi

Description: 通过分支限界的方法,求解1到n的最短路径。设数组a保存图的邻接矩阵,0-9号,共10个节点。节点1为源点,n为目标点.-Through the branch and bound approach for solving 1 to n shortest path. A preservation plan for an array of adjacency matrix ,0-9, a total of 10 nodes. Node 1 is the source, n for the target points.
Platform: | Size: 2048 | Author: | Hits:

[assembly languagefenzhi

Description: (1)编写分支结构.asm文件实现:如果输入大小写子母就在屏幕上输出c 如果输入数字就将数字输出 如果输入其他不输出 按回车键推出的功能. (2)编写分支结构.asm文件实现统计一串分数串中不及格、60分-69分、70到79分、80分到89分、90分到100分的个数 -(1) the preparation of branch structure. Asm file to achieve: If you enter sensitive cluster on the screen output c If you enter the number of digital output will not output if the input of other press Enter to launch the function. (2) the preparation of branch structure. asm file to achieve statistical scores of string in a string of failure, the 60 points-69 points, 70-79 points, 80 assigned to 89 points, 90 assigned to 100 the number of
Platform: | Size: 35840 | Author: 李平 | Hits:

[Mathimatics-Numerical algorithmsfenzhi

Description: 这是一个利用分治法求最短回路的算法,希望对大家有帮助撒-This is a law governing the use of sub-algorithm for the shortest loop, in the hope that everyone has to help spread
Platform: | Size: 300032 | Author: xuli | Hits:

[Windows Developfenzhi

Description: 算法分析中的实例,利用分治思想解决此类问题-Examples of algorithm analysis, the use of sub-rule idea to solve such problems
Platform: | Size: 2048 | Author: 查春晨 | Hits:

[CSharpfenzhi

Description: 算法设计程序设计中分支界限法的C++实现-Algorithm design process the design limits of the law branch of C++ to achieve
Platform: | Size: 182272 | Author: 小牛儿 | Hits:

[Compress-Decompress algrithmsfenzhi

Description: 正好在写用分治法求众数问题实验报告,写好了,让大家看下-Just writing to use divide and conquer the problem seeking plural experimental report, written, and let everyone Kanxia
Platform: | Size: 47104 | Author: isolate | Hits:

[matlabfenzhi

Description: #include <iostream.h> int main() { int i(0),sum(0) while (i<=100) { sum=sum+i ++i }cout<<"sum="<<sum<<endl return 0; } -#include <iostream.h> int main() { int i(0),sum(0) while (i<=100) { sum=sum+i ++i }cout<<"sum="<<sum<<endl return 0; }
Platform: | Size: 2048 | Author: 张凤莲 | Hits:

[Otherknap

Description: 分支限界求背包问题相对于贪心法等有很大的优势-fenzhi xianjie beibao
Platform: | Size: 1208320 | Author: chuanye | Hits:

[Otherfenzhi

Description: 这是一个关于分治算法的一些例子,里面包含了源代码,请仔细研究-some example
Platform: | Size: 57344 | Author: 陈俊 | Hits:

[Otherfenzhi

Description: 输入若干数字,检查其中转换为二进制后为负数的数字的个数。-Enter some numbers, check them into a negative binary number after the number.
Platform: | Size: 1024 | Author: vincent | Hits:

[VC/MFCtubao

Description: 凸包的计算在算法设计中是一个重要的分支,也是很多人研究的方向-tubao jisuan zai suanfashejizhong shi yigezhongyao de fenzhi, yeshi henduoren yanjiu de fangxiang
Platform: | Size: 122880 | Author: puhongquan | Hits:

[Mathimatics-Numerical algorithmsfenzhi

Description: 算法,用c++实现分治法算法的众数问题(在VS2008平台上)-Algorithm, using c++ implementation of divide and conquer algorithm mode problem (in VS2008 platform)
Platform: | Size: 30720 | Author: yan | Hits:

[Data structsfenzhi

Description: 分治法源码,01背包问题,经典的01背包问题-Divide and conquer source, 01 knapsack problem
Platform: | Size: 2048 | Author: 123 | Hits:
« 12 »

CodeBus www.codebus.net