Chapter 2: The Complexity of Arc Routing Problems
Chapter 2: The Complexity of Arc Routing Problems
复制标题
第 2 章：圆弧路由问题的复杂性
DOI：
10.1137/1.9781611973679.ch2
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
und M. Weller
中科院分区：
文献类型：
--
作者：
R. van Bevern;R. Niedermeier;M. Sorge;und M. Weller
2.1CAPACITED▪简介本章致力于考察三个中心弧路由问题(及其相应的变体)的计算复杂性：中国邮递员，要求至少一次遍历图的所有边的最小代价之旅；农村邮递员，它推广了中国邮递员的意义，只需访问边的一个子集；以及CAPACITATED弧路由，代表本章中最一般的弧布线问题，允许一辆以上的车辆用于遍历边。
2.1 ▪ IntroductionThis chapter is devoted to surveying aspects of computational complexity for three central arc routing problems (and their corresponding variants):CHINESE POSTMAN, where one asks for a minimum-cost tour traversing all edges of a graph at least once;RURAL POSTMAN, which generalizes CHINESE POSTMAN in the sense thatonly a subsetof the edges has to be visited; andCAPACITATED ARC ROUTING, representing the most general arc routing problem in this chapter, allows more than one vehicle to be used to traverse the edges.