Institutional Repository
| using gavish-grave lp to formulate the directed black and white traveling salesman problem | |
| Jiang He; Zhang XianChao; Li MingChu; Che HaoYang | |
| 2007 | |
| Conference Name | 7th International Conference on Computational Science, ICCS 2007 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 293-298 |
| Conference Date | 43978 |
| Conference Place | Beijing, China |
| Publish Place | Germany |
| ISSN | 3029743 |
| ISBN | 9783540725879 |
| Department | (1) School of Software, Dalian University of Technology, Dalian 116621, China; (2) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China |
| English Abstract | 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 |
| Keyword | Computational Complexity Constraint Theory Fiber Optic Networks Polynomials Scheduling Traveling Salesman Problem |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/10832 |
| Collection | 天基综合信息系统全国重点实验室 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| using gavish-grave l（170KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment