搜索资源列表
huishufa
- 用分支限界法求界旅行商问题，用Ｃ＋＋语言编程实现-Using branch and bound method profession traveling salesman problem, using C Language Programming
producer_consummer
- 应用临界区解决操作系统生产者消费者问题源码，实验实现环境 Visual Studio 2005。-Application of the critical areas to solve the producer consumer problem of the operating system source code, experimental realization of the environment Visual Studio 200
GA_for_Knapsack_Problem
- 遗传算法用于求解多目标背包问题，学包括基本的选择、杂交、变异等遗传算子.-Genetic algorithm for solving multi-objective knapsack problem, learning the basic choice, hybridization, mutation and other genetic operators.
percepron
- 1.感知器对于线型可分问题的收敛性证明 2.用感知器对线型可分得问题进行分类 1)分三类的问题 2)一组10维数据的分类 3．用感知器对线型不可分的问题进行分类及 不能正确分类的原因证明 说明： 1.运行程序不仅能得到分类的结果，还能够得到网络性能分析的结果 2.matlab7.0下实现-1. Perceptron problem for linear convergence can be proved
java-tsp-1.3-src
- Traveling Salesman Problem Java Genetic Algorithm Solution, Hope all enjoy it.
01knapsack
- 01背包问题的C++源程序，写的比较简单-01 knapsack problem C++ Source code, written in relatively simple
jobshop
- 车间调度问题主程序,需要进行自主参数设计-Shop scheduling problem the main program, the need for self-Parameter Design
tsp
- 用C语言实现旅行商问题。该算法简单精悍，效率也不低，是实现TSP问题的很好的算法。-Using C language realize traveling salesman problem. The algorithm is simple and lean, efficiency is not low, the problem is to achieve a good TSP algorithms.
Josephus
- 用循环链表实现的约瑟夫问题。uuhorse-By cyclic Joseph realized the problem list. uuhorse
GP
- PSO算法实现的图分割问题的matlab源码。原创-PSO algorithm for the graph partitioning problem matlab source. Original
yj6
- 离散二次线性系统最优控制问题的MAtlab 原程序代码-Discrete linear systems with quadratic optimal control problem of the original Matlab code
Josephus
- Josephus 排列问题定义如下：假设n 个竞赛者排成一个环形。给定一个正整数m，从某 个指定的第1 个人开始，沿环计数，每遇到第m 个人就让其出列，且计数继续进行下去。这 个过程一直进行到所有的人都出列为止。最后出列者为优胜者。每个人出列的次序定义了整 数1，2，…，n 的一个排列。这个排列称为一个(n,m)Josephus 排列。-Josephus with the problem are defined as fol
K-MEANS
- 基于MATLAB的k-means算法 较好的解决了图像分类聚类的问题-MATLAB based on the k-means algorithm better solved the problem of image classification clustering
ruby_allocation3
- 用遗传算法求物流配送中心解选址问题．有运行结果-Using genetic algorithms for the logistics distribution center location problem solution. Results have
qingwa
- 解0/1背包问题-Solutions of 0/1 knapsack problem
GA_To_Solv187162442005
- 遗传算法解决机组组合问题的源代码，代码运行平台为Tc 3.0 ，对研究遗传算法解决大型组合优化问题的朋友较有参考意义。-Genetic algorithm solution to unit commitment problem
Quasi-Newton
- Quasi-Newton算法的demo程序，主要用于最优化算法的设计与最优化问题的求解-Quasi-Newton algorithm demo program, mainly used in optimization algorithm design and optimization problem solving
lsq
- 打靶法求微分方程边值问题，这是数学上的求取方程问题的边值的方法 -Shooting method for boundary value problems for differential equations, which is to strike a mathematical equation of the boundary value problem approach
LINGO1
- lingo 多旅行商问题的求解代码 每人限制运货为50-multi-lingo code for solving the traveling salesman problem restricted shipments of 50 per person
JSPGA
- 车间作业调度问题遗传算法Matlab源码 -Job-shop scheduling problem genetic algorithm source Matlab