A new algorithm for the 2-period Balanced Traveling Salesman Problem in Euclidean graphs
Download full text from publisher
More about this item
Keywordsperiod routing problem; period travelling salesman problem; logistic; heuristic algorithms;
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
NEP fieldsThis paper has been announced in the following NEP Reports:
- NEP-ALL-2008-11-25 (All new papers)
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:vnm:wpaper:173. 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: (Marco LiCalzi). General contact details of provider: http://edirc.repec.org/data/dmvenit.html .
We have no references for this item. You can help adding them by using this form .