搜索资源列表
GA_01Knap
- 用遗传算法解决背包问题，可以求最优解，也可以自己设定次数-using genetic algorithms to solve knapsack problem, the optimal solution can help, can set its own number
sa_tsp1.m
- 模拟退火算法解决stp问题的例程，直接运行即可，可以通过改变参数得到不同的图。-simulated annealing algorithm to solve the problem stp routines, can be run directly. by changing the parameters can be different plans.
SATSP-MATLAB1
- 再加一个SA的程序说明文件 车辆路径问题-SA with a descr iption of the procedures for document vehicle routing problem
jiucan
- 哲学家就餐问题，本人已经在网上找了很久啦，希望能和大家分享-dining philosophers problem, I have to find on the Internet-- for a long time, and we hope to share
01knap_Dynamic_Programming
- 本文通过研究动态规划原理，提出了根据该原理解决０／１背包问题的方法与算法实现，并对算法的正确性作了验证．观察程序运行结果，发现基于动态规划的算法能够得到正确的决策方案且比穷举法有效．-through research paper on dynamic programming, According to the principle of resolving the 0/1 knapsack problem with the algorit
PackageProblem
- 实现背包问题 package problem 1． 问题描述 假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解： （1，4，3，2）、（1，4，5）、（8，2）、（3，5，2）。 2． 基本
0_1question
- 计算机算法中著名的0_1背包问题：给定n种物品和一背包。物品i的重量是Wi，其价值为Vi，背包的容量是c，问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。-computer algorithm famous 0_1 knapsack problem : given n product and a backpack. I articles of the weight of Wi, the value of Vi and ba
vrpnewGASA
- 遗传算法求解车辆路径问题，没有解压缩的密码。-Genetic Algorithm for vehicle routing problem, no extract passwords.
WindowsApplication24zhang
- 模拟退火和遗传算法混和求解车辆路径问题的程序，没有解压密码。-simulated annealing and genetic algorithms hybrid vehicle routing problem solving process, not extracting passwords.
456456413786
- 数据结构课程设计打包下载，包括两个1.约瑟夫环 2.最小生成树问题！！！我已经交给老师，发给大家参考一下-data structure course design package download, including two one. Josephus 2. The minimum spanning tree problem! ! ! I was handed over to the teachers, to your referen
lotteryproblem
- 彩票中的数学lottery problem.pdf-lottery math lottery problem.pdf
tsp.c
- 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes
TheDynamicAssignmentProblem
- The Dynamic Assignment Problem，动态排班问题，使用到了各个智能算法-The Dynamic Assignment Problem, dynamic scheduling problems, use of the various intelligent algorithm
hungry
- 用匈牙利算法解决二部图的最优匹配问题,可用于多任务的指派问题的解决.-Hungary algorithm used to solve the two plans optimal matching can be used for many tasks assigned to resolve the problem.
beibao__1wei
- 背包问题得模拟退火解法实现，调试通过，觉得有收藏价值。-knapsack problem in the simulated annealing method to achieve, through debugging feel the collectible value.
lunch
- 哲学家进餐问题 在多线程中如何避免死锁。 问题描述：有五位哲学家围绕着餐桌坐，每一位哲学家要么思考 要么等待，要么吃饭。为了吃饭，哲学家必须拿起两双筷子（分 别放于左右两端）不幸的是，筷子的数量和哲学家相等，所以每 只筷子必须由两位哲学家共享-dining philosophers problem in multithreaded how to avoid deadlock. Problem descr ipt
tourzxh
- 旅行商问题,动态规划,附加说明文档,是程序竞赛的经典题-traveling salesman problem, dynamic programming, additional documentation, and procedures of the classic title race
eating-apple-problem
- 吃苹果eating apple problem问题代码-eat apples problem was eating apple code
lamb_problem
- Lamb problem: The analytical solution of vertical point source. This is very important for synthetic modeling-Lamb problem : The analytical solution of vertical point sour ce. This is very important for synthetic modeli
2_8.c
- 约瑟夫环问题 采用C语言编写 没有用链表 而是用数组实现-Josephus problem using C language does not use chain instead of the array to achieve