Matroid Intersection and its application to a Multiple Depot, Multiple TSP
AbstractThis paper extends the Held-Karpâ€™s lower bound available for a single Travelling Salesman Problem to the following symmetric Multiple Depot, Multiple Travelling Salesman Problem (MDMTSP): Given k salesman that start at di
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Institute of Transportation Studies, UC Berkeley in its series Institute of Transportation Studies, Research Reports, Working Papers, Proceedings with number qt9sj6585p.
Date of creation: 01 May 2006
Date of revision:
Contact details of provider:
Postal: 109 McLaughlin Hall, Mail Code 1720, Berkeley, CA 94720-1720
Web page: http://www.escholarship.org/repec/its/
More information through EDIRC
Logistics; Modeling and Network Analysis; Traffic Operations;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Yang GuoXing, 1995. "Transformation of multidepot multisalesmen problem to the standard travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 81(3), pages 557-560, March.
- Kulkarni, R. V. & Bhave, P. R., 1985. "Integer programming formulations of vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 20(1), pages 58-67, April.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lisa Schiff).
If references are entirely missing, you can add them using this form.