搜索资源列表
GA
- 基于遗传算法的背包问题求解，有基本的说明和代码 其他人不需帐号就可自由下载此源码 -Based on genetic algorithms for solving knapsack problem, some basic instructions and code other people without accounts can download this free source
queens
- prolog语言写的一个八皇后问题,程序比较简单,有注释-prolog language to write an eight-queen problem, the procedure is relatively simple, has the Notes
01beibaozhenghechengxu
- 背包问题非常有用的程序代码打包，包括贪心，回溯，动态规划-Knapsack problem is very useful package of program code, including greedy, backtracking, dynamic programming
Antbeibao
- 用蚁群算法解决0-1背包问题,matlab实现,自己亲自写的,没问题-Using ant colony algorithm to solve 0-1 knapsack problem, matlab realize that he personally wrote, no problem
TSP
- 这是一个货郎担问题的动态规划代码,是C语言版的,能在TC上和VC++6.0上运行.加入了许多注释.-This is a traveling salesman problem dynamic programming code, is a C language version, can TC and VC++ 6.0 run. Adding a lot of notes.
Knap2
- knap2 背包问题非递归，运用栈及回溯算法优化了一下，可以找到所有满足条件的解。 如果遇到什么问题，请发邮件至horsewhite32@hotmail.com,笔者将不胜感激 uuhorse-non-recursive knap2 knapsack problem, the use of stack and the backtracking algorithm to optimize the look, you can f
queen
- 所谓八皇后问题（Eight Queens Problem），是在8*8格的棋盘上，放置8个皇后。要求每行每列放一个皇后,而且每一条对角线和每一条反对角线上最多只能有一个皇后，这是一个典型并行算法，C语言实现。-The so-called Queen s the issue of eight (Eight Queens Problem), in the 8* 8 grid of the chessboard, 8 Queen s plac
box
- 经典的一维装箱问题(Bin Packing Problem)是指，给定 件物品的序列 ，物品 的大小 ，要求将这些物品装入单位容量1的箱子 中，使得每个箱子中的物品大小之和不超过1，并使所使用的箱子数目 最小。-Classic one-dimensional bin-packing problem (Bin Packing Problem) means that a given sequence of items, item size,
dividablepackage
- 此程序是使用Java编写的，实现了可分割的0/1背包问题。程序主要是是使用了经典的贪心算法，能够很好的解决此问题。-This procedure is to use Java prepared to achieve that can be separated from 0/1 knapsack problem. Procedure is mainly the use of a classic greedy algorithm that
005
- 05关于中国邮递员问题的最优完全子图算法-05 on the Chinese postman problem completely subgraph optimal algorithm
yichuansuanfajichu2
- 关于遗传算法的理论以及应用，包括车间调度，函数优化，求最短路径问题等-On genetic algorithm theory and applications, including job shop scheduling, function optimization, seeking the shortest path problem
soj_report
- 集合了SOJ（四川大学ACM在线评测系统）众多经典题目的详细解题报告，对ACM初学者提高解题能力十分有益。-Collection of the SOJ (Sichuan University, ACM online evaluation system) many classic topics detailed problem-solving report, ACM beginners improve very useful proble
wangluochonggou
- 配电网重构是一个多目标、多时段、多组合、多约束的非线性优化问题。该问题的复杂性，决定了难以用单纯的数学方法得到满意的解。尝试用改进的遗传算法进行配电网络重构，建立评价函数，寻求该评价函数最优解-Distribution network reconfiguration is a multi-objective, multi-slot, multi-portfolio, multi-constrained nonlinear optimiz
GCPanneal2
- 图论研究中的图着色问题的matlab程序，非常好用啊！-Study of Graph Theory Graph Coloring Problem of matlab program, very easy to use ah!
mtsp_ga
- 由matlab解决多旅行商问题，并且包括矩阵计算等功能-From matlab to solve multi-traveling salesman problem, and includes features such as matrix calculation
2
- 用回溯解背包问题 假设有n件物品，定义一个结构体a[]来存储，结构体有两个成员weight和value(weight表示重量，value表示价值)先定义一个数组col[]表示每个物品当前状态（为1表示被选，为0表示未被选），其初值全为1，从下标为0开始遍历，当前所选物品总重和总价值分别设为tw和tv（初值均为0），背包的限重设为limit，若第i个物品满足tw+a[i].weight<=limit且col[i]==1 就将a[i]
hopfield
- 基于Hopfield神经网络解决旅行商问题，学习模式识别的朋友可以参考-Based on the Hopfield neural network to solve traveling salesman problem, pattern recognition learning can refer to a friend
beibao
- 背包问题运用贪婪算法的matlab 程序实现-Use of greedy algorithm knapsack problem of matlab program
GAvrp
- 该算法经运行，无任何问题，可用于解决遗传算法求解车辆路线问题-The algorithm by running without any problems, can be used for genetic algorithm to solve Vehicle Routing Problem
ucos-dining-philosopher
- ucos-dining-philosopher.rar ucos下的哲学家就餐问题（dining philosopher problems)，采用信号量机制解决，有截图和感悟。dos界面文字演示（另有图形界面）。-ucos-dining-philosopher.rarucos under the dining philosophers problem (dining philosopher problems), using sema