搜索：Assignment Problem
找到约 460 项符合「Assignment Problem」的查询结果
结果 460
按分类筛选
- 全部
- 技术资料 (80)
- matlab例程 (34)
- 人工智能/神经网络 (33)
- 数学计算 (30)
- 其他 (29)
- Java编程 (24)
- 数值算法/人工智能 (22)
- 其他书籍 (17)
- 数据结构 (17)
- 书籍 (17)
- 软件设计/软件工程 (10)
- 电源技术 (7)
- VC书籍 (7)
- 行业发展研究 (7)
- 并行计算 (7)
- 电子书籍 (6)
- 单片机开发 (6)
- Java书籍 (6)
- 单片机编程 (5)
- 可编程逻辑 (5)
- 文件格式 (5)
- 文章/文档 (5)
- 加密解密 (4)
- 教程资料 (4)
- 压缩解压 (4)
- Linux/Unix编程 (4)
- 论文 (4)
- 通讯/手机编程 (3)
- 软件工程 (3)
- 游戏 (3)
- 编译器/解释器 (3)
- 汇编语言 (3)
- 系统设计方案 (3)
- Linux/uClinux/Unix编程 (2)
- DSP编程 (2)
- 数据库系统 (2)
- 操作系统开发 (2)
- 书籍源码 (2)
- 模拟电子 (2)
- 驱动编程 (2)
- 教育系统应用 (2)
- C/C++语言编程 (1)
- 无线通信 (1)
- 其他文档 (1)
- 技术书籍 (1)
- 资料/手册 (1)
- 测试测量 (1)
- 工控技术 (1)
- 源码/资料 (1)
- Internet/网络编程 (1)
- 编辑器/阅读器 (1)
- 磁盘编程 (1)
- *行业应用 (1)
- 企业管理 (1)
- 传真(Fax)编程 (1)
- 多国语言处理 (1)
- 金融证券系统 (1)
- 技术管理 (1)
- 通讯编程文档 (1)
- 嵌入式/单片机编程 (1)
- 嵌入式Linux (1)
- J2ME (1)
- 其他行业 (1)
- 生物技术 (1)
- 交通/航空行业 (1)
- Jsp/Servlet (1)
- VIP专区 (1)
- 其他 (1)
https://www.eeworm.com/dl/665/441507.html
matlab例程
Integer prograamming problem in matlab
Integer prograamming problem in matlab
https://www.eeworm.com/dl/665/313199.html
matlab例程
TSP( Traveling Salesman Problem) is a typical NP complete problem ,genetic algorithm is the perfect
TSP( Traveling Salesman Problem) is a typical NP complete problem ,genetic algorithm is the perfect method for solving NP complete problem.
https://www.eeworm.com/dl/692/472240.html
行业发展研究
Linked list problem in C. It list down various link List problem and there solution
Linked list problem in C. It list down various link List problem and there solution
https://www.eeworm.com/dl/518/346409.html
数值算法/人工智能
用Kruskal算法构造最小生成树解决指派问题（assignment problem） 一家公司经理准备安排 名员工去完成 项任务
用Kruskal算法构造最小生成树解决指派问题（assignment problem）
一家公司经理准备安排 名员工去完成 项任务，每人一项。由于各员工的特点不同，不同的员工去完成同一项任务时所获得的回报是不同的。如何分配工作方案可以使总回报最大？ ...
https://www.eeworm.com/dl/652/255944.html
文章/文档
Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optim
Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities ...
https://www.eeworm.com/dl/650/125370.html
人工智能/神经网络
aco for TSP problem source code
aco for TSP problem source code
https://www.eeworm.com/dl/654/259582.html
数据结构
datastructure, algorithms in C++ problem soloution
datastructure, algorithms in C++
problem soloution
https://www.eeworm.com/dl/633/252552.html
Java编程
source codes to solve Hexpuzzle problem
source codes to solve Hexpuzzle problem
https://www.eeworm.com/dl/665/206590.html
matlab例程
traveling saleman problem的代码
traveling saleman problem的代码
https://www.eeworm.com/dl/633/272094.html
Java编程
solve readers-writers problem with RMI
solve readers-writers problem with RMI