Books : Solving the hierarchical Chinese postman problem as a rural postman problem [An article from: European Journal of Operational Research]
In association with Amazon.com![: Solving the hierarchical Chinese postman problem as a rural postman problem [An article from: European Journal of Operational Research]](http://ecx.images-amazon.com/images/I/51G4P0G7AGL._SL160_.jpg)
Availability: Available for download now
Format: HTML
Label: Elsevier
Manufacturer: Elsevier
Publication Date: May 16, 2004
Publisher: Elsevier
Studio: Elsevier
Editorial Review:
Product Description:
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2004. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
In the undirected hierarchical Chinese postman problem (HCPP), the edges of a graph are partitioned into clusters and must be serviced while respecting a hierarchy, or precedence relation, between clusters. Two objectives are considered: a hierarchical objective and a makespan objective. In this article, a transformation of the HCPP into an equivalent rural postman problem (RPP) is presented. The HCPP is solved optimally, for both objectives, by applying an exact branch-and-cut RPP algorithm to the transformed problem. Two heuristics based on the RPP algorithm are also described and assessed computationally.
Browse for similar items by category:
