{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T09:28:40Z","timestamp":1672306120422},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,3,7]],"date-time":"2008-03-07T00:00:00Z","timestamp":1204848000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s11590-008-0079-4","type":"journal-article","created":{"date-parts":[[2008,3,6]],"date-time":"2008-03-06T10:16:44Z","timestamp":1204798604000},"page":"535-541","source":"Crossref","is-referenced-by-count":2,"title":["On single courier problem"],"prefix":"10.1007","volume":"2","author":[{"given":"Malay","family":"Bhattacharyya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anup Kumar","family":"Bandyopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,3,7]]},"reference":[{"key":"79_CR1","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman & Co., New York (1979)"},{"issue":"3","key":"79_CR2","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1145\/321832.321847","volume":"21","author":"M. Bellmore","year":"1974","unstructured":"Bellmore, M., Hong, S.: Transformation of multisalesmen problem to the standard traveling salesman problem. J. Assoc. Comput. Mach. 21(3), 500\u2013504 (1974)","journal-title":"J. Assoc. Comput. Mach."},{"key":"79_CR3","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M. Bellmore","year":"1968","unstructured":"Bellmore, M., Nemhauser, G.L.: The traveling salesman problem: a survey. Oper. Res. 16, 538\u2013558 (1968)","journal-title":"Oper. Res."},{"key":"79_CR4","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"Held, M., Karp, R.M.: The traveling salesman problem and minimum spanning tree. Part II. Math. Program. 1, 6\u201325 (1971)","journal-title":"Math. Program."},{"key":"79_CR5","first-page":"495","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21, 495\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"79_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10107-003-0438-y","volume":"97","author":"S. Arora","year":"2003","unstructured":"Arora, S.: Approximation schemes for NP-hard geometric optimization problems: a survey. Math. Program. 97, 43\u201369 (2003)","journal-title":"Math. Program."},{"key":"79_CR7","unstructured":"Feremans, C., Grigoriev, A.: Approximation schemes for the generalized geometric problems with geographic clustering. In: 21st European Workshop on Computational Geometry, Eindhoven, pp. 9\u201311 (2005)"},{"key":"79_CR8","unstructured":"Fugenschuh, A., Homfeld, H., Huck, A., Martin, A.: Locomotive and wagon scheduling in freight transport. In: 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (2006)"},{"key":"79_CR9","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s00291-005-0207-9","volume":"27","author":"V. Gintner","year":"2005","unstructured":"Gintner, V., Kliewer, N., Suhl, L.: Solving large multi-depot multi-vehicle-type bus scheduling problems in practice. OR Spectr. 27, 507\u2013523 (2005)","journal-title":"OR Spectr."},{"key":"79_CR10","first-page":"415","volume":"79","author":"M. Bussieck","year":"1997","unstructured":"Bussieck, M., Winter, T., Zimmermann, U.: Discrete optimization in public rail transport. Math. Program. 79, 415\u2013444 (1997)","journal-title":"Math. Program."},{"key":"79_CR11","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1287\/trsc.1050.0115","volume":"39","author":"R. Ahuja","year":"2002","unstructured":"Ahuja, R., Liu, J., Orlin, J., Sharma, D., Shughart, L.: Solving real-life locomotive scheduling problems. Transport. Sci. 39, 503\u2013517 (2002)","journal-title":"Transport. Sci."},{"key":"79_CR12","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: On a linear-programming, combinatorial approach to the traveling salesman problem. JORSA 7, 1 (1959)","DOI":"10.1287\/opre.7.1.58"},{"key":"79_CR13","unstructured":"Hong, S.: Linear programming approach for the traveling salesman problem. Ph.D. Dissertation, The Johns Hopkins University (1972)"},{"key":"79_CR14","unstructured":"Sengoku, H., Yoshihara, I.: A fast TSP solver using GA on JAVA, AROB III 98 Japan, 19\u201321 January 1998, pp. 283\u2013288"},{"key":"79_CR15","unstructured":"Yamamura, M., Ono, T., Kobayashi, S.: Character-preserving genetic algorithms for traveling salesman problem. J. Jpn. Soc. Artif. Intell. 7(6) (1992)"},{"key":"79_CR16","unstructured":"Tanenbaum, A.S.: Computer networks, 4th edn. Pearson Education, Third Indian Reprint (2004)"},{"key":"79_CR17","unstructured":"Balas, E.: New classes of efficiently solvable generalized traveling salesman problems, management science research report #MSRR-611, Graduate School of Industrial Administration, Carnegie Mellon University (1995)"},{"key":"79_CR18","unstructured":"Du, D., Pardalos, P.M. (eds.): Handbook of Combinatorial Optimization, Kluwer Academic Publishers, (5 Volumes) Volumes 1, 2, 3 (1998), Supplement Volume A (1999), Supplement Volume B (2001)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-008-0079-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-008-0079-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-008-0079-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:15:02Z","timestamp":1559574902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-008-0079-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,7]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["79"],"URL":"https:\/\/doi.org\/10.1007\/s11590-008-0079-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,7]]}}}