ISSN:
1436-4646
Keywords:
Key words: Arc Routing Problems – Undirected Rural Postman Problem – branch-and-cut – polyhedral analysis – facets
;
Mathematics Subject Classification (1991): 05c45
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract. The well-known Undirected Rural Postman Problem is considered and a binary linear problem using new dominance relations is presented. Polyhedral properties are investigated and a branch-and-cut algorithm is developed. Extensive computational results indicate that the algorithm is capable of solving much larger instances than previously reported.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/s101070050007
Permalink