using gavish-grave lp to formulate the directed black and white traveling salesman problem
文献类型：会议论文
| 作者 | Jiang He ; Zhang XianChao ; Li MingChu ; Che HaoYang |
| 出版日期 | 2007 |
| 会议名称 | 7th International Conference on Computational Science, ICCS 2007 |
| 会议日期 | 43978 |
| 会议地点 | Beijing, China |
| 关键词 | Computational complexity Constraint theory Fiber optic networks Polynomials Scheduling Traveling salesman problem |
| 页码 | 293-298 |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 会议录出版地 | Germany |
| 语种 | 英语 |
| ISSN号 | 3029743 |
| ISBN号 | 9783540725879 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/10832]  |
| 专题 | 软件研究所_综合信息系统技术国家级重点实验室 _会议论文 |
| 推荐引用方式 GB/T 7714 | Jiang He,Zhang XianChao,Li MingChu,et al. using gavish-grave lp to formulate the directed black and white traveling salesman problem[C]. 见:7th International Conference on Computational Science, ICCS 2007. Beijing, China. 43978. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。