搜索资源列表
setcover
- presents the heuristic solution of set covering problem-presents the heuristic solution of set covering problem.....
barber
- 睡眠理发师问题C++解法,使用信号量,理发座位数可选,理发师只有一个-Using semaphore to solve barbers problem,there’s one barber,infinite customer,and a few waiting position,the number of waiting position is depend on the user. 3 semaphores are inv
byljc
- 本书共分5章。第1章介绍了博弈论的基本概念和几个典型的例子。第2章和第3章分别介绍了完全信息下的静态博弈和动态博弈；第4章和第5章则介绍了不完全信息下的静态博弈和动态博弈。-This book introduces one of the most powerful tools of modern economics to a wide audience: those who will later construct or consume
Producer-Consumer_Problem
- producer-concumer problem with buffering and threads
producercustomer
- 多线程编程示例,解决生产者消费者问题.水平有限,仅供初学者参考.-Multi-threaded programming examples to solve the producer consumer problem. Is limited, only for advanced users.
2
- 采用速度-位置模型，把优化问题空间转化为随机粒子空间，通过反复迭代寻找最优解，可用于基于pso移动机器人地图创建-Use of speed- location model, the optimization problem space into a random particle space, through repeated iterations to find the optimal solution can be used for
research
- The robot path planning problem is a very challenging problem in robotics. The main goal of this problem is to construct a collision-free path from a starting position to an end or destination position. However, this
Coloring_a_graph_using_split_decomposition
- A solution for Graph Coloring problem Coloring a graph using split decomposition
Josephusproblem
- Josephus problem 的实现程序-the realization of the Josephus problem
vrp
- 进化算法及其在全局优化和VRP中的应用的毕业论文-Evolutionary Algorithm and Its Application in GlobalOptimization and Vehicle Routing Problem
barber
- 进程调度中经典的理发师问题，在Ubuntu8.04下编译通过-Process Scheduling in the classic barber problem in Ubuntu8.04 compiled by
1234
- 2010最新的用分枝界限法解决最大多样性问题的SCI论文。-This article begins with a review of previously proposed integer formulations for the maximum diversity problem (MDP). This problem consists of selecting a subset of elements from a larger
geneticalgorithmandsimulatedannealingalgorithm
- 建立了多约束条件车辆路径问题的数学模型和求解流程先采用最近插入法生成初始解然后基于遗传算法和模拟退火算法改进初始解-The establishment of a multi-vehicle routing problem with constraint model and solution process first insertion generated by the recent initial solution and based
b
- 一种求解Job-Shop调度问题的 混合自适应变异粒子群算法 -Solving Job-Shop scheduling problem by hybrid particle swarm optimization with adaptive mutation
TSPBranchAndBound
- TSP TRAVEL SALES MAN PROBLEM SOLVING
Project-Scheduling-Problem
- project scheduling problem
TSP
- 利用遗传算法求解旅行商问题 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling salesman problem using genetic algorithm travelin
munkres
- 数学指派问题的经典求解算法 可以用于图像处理，做位姿估计时 特征对应点的匹配 - MUNKRES Munkres (Hungarian) Algorithm for Linear Assignment Problem.
Bag
- jcreator下写的背包问题，适合JAVA入门。给定背包的容量，在输入的物品中，求出符合条件的解，如果不存在解，则输出不存在-jcreator written under the knapsack problem, for JAVA entry. Given knapsack capacity, in input items, find qualified solution, if there is no solution, the
TS_TSP
- 禁忌搜索算法求解车辆路径问题 很好的程序-Tabu search algorithm for vehicle routing problem with a very good program