Exact solution of the generalized routing problem through graph transformations

M Blais and G Laporte ()
Additional contact information
M Blais: HEC Montréal
G Laporte: HEC Montréal

Journal of the Operational Research Society, 2003, vol. 54, issue 8, 906-910

Abstract: Abstract In the general routing problem, the aim is to determine a least cost traversal of a subset of edges, arcs and vertices of a graph. The problem can be transformed into an equivalent traveling salesman problem or rural postman problem and solved optimally. Computational results are reported.

Keywords: generalized routing problem; traveling salesman problem; rural postman problem; generalized traveling salesman problem (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601590 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:54:y:2003:i:8:d:10.1057_palgrave.jors.2601590

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601590

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().