Matroid Intersection and its application to a Multiple Depot, Multiple TSP
This 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
|Date of creation:||01 May 2006|
|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
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.
When requesting a correction, please mention this item's handle: RePEc:cdl:itsrrp:qt9sj6585p. See general information about how to correct material in RePEc.
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.