| 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 |
| 会议录名称 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| 页码 | 293-298 |
| 会议日期 | 43978 |
| 会议地点 | Beijing, China |
| 出版地 | Germany |
| ISSN | 3029743 |
| ISBN | 9783540725879 |
| 部门归属 | (1) School of Software, Dalian University of Technology, Dalian 116621, China; (2) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China |
| 摘要 | The black and white traveling salesman problem (BWTSP) is a new class of NP-hard problem arising from work on airline scheduling and telecommunication fiber networks. The existing Ghiani LP for the undirected BWTSP contains an exponential number of constr |
| 关键词 | Computational Complexity Constraint Theory Fiber Optic Networks Polynomials Scheduling Traveling Salesman Problem |
| 语种 | 英语 |
| 内容类型 | 会议论文 |
| URI标识 | 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]. Germany,2007:293-298. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| using gavish-grave l（170KB） | 开放获取 | -- | 请求全文 | |||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论