搜索资源列表
SAWEnum
- 一个高效的自回避行走路径枚举程序。运用了多线程分配分支任务，可以port到多核cpu上加速运算。
task
- 该程序用于计算任务分配问题，任务分配问题也是运筹学中一个较难的问题。-procedures used in the calculation of the distribution of tasks, task allocation problem is tacticians had a more difficult problem.
MaximumMatching
- 用匈牙利算法实现的任务分配程序，对随机生成的矩阵求出最大匹配-Hungarian algorithm with task allocation procedures, randomly generated matrix of the maximum matching obtained
fugai
- 找最小距离 并且最小的方差 和任务分配 以及综合最小-Find the minimum distance and the minimum variance and task allocation
Backtracking-batch-job-scheduling
- 运用回溯法实现批任务分配，使其工作花费最少。-The use of the backtracking implementation batch task allocation, make it work to spend at least.
Assignment-problems-(SIAM--2009)
- 任务分配问题是组合优化里面的一类基本问题。本书系统讲解了该问题从1920年代的萌芽阶段到近代的理论、算法、以及实现的发展。章节之间具备较大独立性，方便读者不按照顺序研读。-This book provides a comprehensive treatment of assignment problems their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and prac