Chapter 2: The complexity of arc routing problems
Arc routing: Problems, methods, and applications, 2015•SIAM
2.1▪ Introduction This 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 that only a
subset of the edges has to be visited; and CAPACITATED ARC ROUTING, representing the
most general arc routing problem in this chapter, allows more than one vehicle to be used to …
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 that only a
subset of the edges has to be visited; and CAPACITATED ARC ROUTING, representing the
most general arc routing problem in this chapter, allows more than one vehicle to be used to …
2.1 ▪ Introduction
This 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 that only a subset of the edges has to be visited; and
- CAPACITATED ARC ROUTING, representing the most general arc routing problem in this chapter, allows more than one vehicle to be used to traverse the edges.
Society for Industrial and Applied Mathematics以上显示的是最相近的搜索结果。 查看全部搜索结果