{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T02:49:10Z","timestamp":1777603750381,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T00:00:00Z","timestamp":1347926400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10288-012-0212-1","type":"journal-article","created":{"date-parts":[[2012,9,17]],"date-time":"2012-09-17T01:26:14Z","timestamp":1347845174000},"page":"57-73","source":"Crossref","is-referenced-by-count":45,"title":["Variable neighborhood search for the travelling deliveryman problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Nenad","family":"Mladenovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dragan","family":"Uro\u0161evi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sa\u00efd","family":"Hanafi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,18]]},"reference":[{"key":"212_CR1","doi-asserted-by":"crossref","unstructured":"Abeledo H, Fukasawa R, Pessoa A, Uchoa E (2010) The time dependent traveling salesman problem: polyhedra and algorithm. Optim Online ( http:\/\/www.optimization-online.org\/DB_HTML\/2010\/12\/2872.html )","DOI":"10.1007\/978-3-642-13193-6_18"},{"key":"212_CR2","doi-asserted-by":"crossref","unstructured":"Blum A, Chalasani P, Coppersmish D, Pulleyblank B, Raguavan P, Sudan M (1994) The minumum latency problem. In: Proceedings of 26th annual ACM symposium on theory of computting, Montreal","DOI":"10.1145\/195058.195125"},{"key":"212_CR3","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10732-007-9046-y","volume":"14","author":"J Brimberg","year":"2008","unstructured":"Brimberg J, Mladenovi\u0107 N, Uro\u0161evi\u0107 D (2008) Local and variable neighborhood search for the $$k$$ -cardinality subgraph problem. J Heuristics 14:501\u2013517","journal-title":"J Heuristics"},{"key":"212_CR4","doi-asserted-by":"crossref","first-page":"2885","DOI":"10.1016\/j.cor.2008.12.020","volume":"36","author":"J Brimberg","year":"2009","unstructured":"Brimberg J, Mladenovi\u0107 N, Uro\u0161evi\u0107 D, Ngai E (2009) Variable neighborhood search for the heaviest $$k$$ -subgraph. Comput Oper Res 36:2885\u20132891","journal-title":"Comput Oper Res"},{"issue":"2","key":"212_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.2298\/YJOR1102157C","volume":"21","author":"E Carrizosa","year":"2011","unstructured":"Carrizosa E, Mladenovi\u0107 N, Todosijevi\u0107 R (2011) Sum-of-square clustering on networks. Yugosl J Oper Res 21(2):157\u2013161","journal-title":"Yugosl J Oper Res"},{"issue":"6","key":"212_CR6","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1287\/opre.41.6.1055","volume":"41","author":"M Fischetti","year":"1993","unstructured":"Fischetti M, Laporte G, Martello S (1993) The delivery man problem and cumulative matroids. Oper Res 41(6):1055\u20131064","journal-title":"Oper Res"},{"key":"212_CR7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10288-008-0089-1","volume":"6","author":"P Hansen","year":"2008","unstructured":"Hansen P, Mldenovi\u0107 N, Moreno-P\u00e9rez JA (2008) Variable neighbourhood search: methods and applications. 4OR 6:319\u2013360","journal-title":"4OR"},{"key":"212_CR8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen P, Mladenovi\u0107 N, Moreno P\u00e9rez JA (2010) Variable neighbourhood search: algorithms and applications. Ann Oper Res 175:367\u2013407","journal-title":"Ann Oper Res"},{"key":"212_CR9","unstructured":"Ibm, ILOG CPLEX Optimizer. http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer"},{"key":"212_CR10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ejor.2010.02.022","volume":"206","author":"A Ili\u0107","year":"2010","unstructured":"Ili\u0107 A, Uro\u0161evi\u0107 D, Brimberg J, Mladenovi\u0107 N (2010) Variable neighborhood search for solving the uncapacitated single allocation $$p$$ -hub median problem. Eur J Oper Res 206:289\u2013300","journal-title":"Eur J Oper Res"},{"key":"212_CR11","unstructured":"Johnson DS, McGeoch LA (1996) The travelling salesman problem: a case study in local optimization. In: Aarts EHL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, New York"},{"key":"212_CR12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.2298\/YJOR1002229M","volume":"20","author":"B Markoski","year":"2011","unstructured":"Markoski B, Hotomski P, Malba\u0161ki D, Obradovi\u0107 D (2011) Dijkstra\u2019s interpretation of the approach to solving a problem of program correctness. Yugosl J Oper Res 20:229\u2013236","journal-title":"Yugosl J Oper Res"},{"key":"212_CR13","doi-asserted-by":"crossref","first-page":"3223","DOI":"10.1016\/j.dam.2008.05.009","volume":"156","author":"I M\u00e9ndez-D\u00edaz","year":"2008","unstructured":"M\u00e9ndez-D\u00edaz I, Zabala P, Lucena A (2008) A new formulation for the traveling deliveryman problem. Discret Appl Math 156:3223\u20133237","journal-title":"Discret Appl Math"},{"key":"212_CR14","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097\u20131100","journal-title":"Comput Oper Res"},{"key":"212_CR15","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.ejor.2012.01.036","volume":"220","author":"N Mladenovi\u0107","year":"2012","unstructured":"Mladenovi\u0107 N, Uro\u0161evi\u0107 D, Hanafi S, Ili\u0107 A (2012) A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Eur J Oper Res 220:270\u2013285","journal-title":"Eur J Oper Res"},{"key":"212_CR16","doi-asserted-by":"crossref","unstructured":"Mladenovi\u0107 N, Uro\u0161evi\u0107 D, Todosijevi\u0107 R. An efficient GVNS for solving traveling salesman problem with time windows. Yugosl J Oper Res. doi: 10.2298\/YJOR120530015M","DOI":"10.2298\/YJOR120530015M"},{"issue":"2","key":"212_CR17","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10288-011-0153-0","volume":"9","author":"A Salehipour","year":"2011","unstructured":"Salehipour A, S\u00f6rensen K, Goos P, Brysy O (2011) Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem. 4OR-Q J Oper Res 9(2):189\u2013209","journal-title":"4OR-Q J Oper Res"},{"issue":"6","key":"212_CR18","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.ipl.2004.09.009","volume":"92","author":"BY Wu","year":"2004","unstructured":"Wu BY, Huang Z, Zhan F (2004) Exact algorithms for the minimum latency problem. Inf Process Lett 92(6):303\u2013309","journal-title":"Inf Process Lett"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-012-0212-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-012-0212-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-012-0212-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T20:18:30Z","timestamp":1562185110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-012-0212-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,18]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["212"],"URL":"https:\/\/doi.org\/10.1007\/s10288-012-0212-1","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,18]]}}}