{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T11:24:49Z","timestamp":1706268289558},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1016\/j.ejor.2012.01.035","type":"journal-article","created":{"date-parts":[[2012,1,25]],"date-time":"2012-01-25T19:52:46Z","timestamp":1327521166000},"page":"295-304","source":"Crossref","is-referenced-by-count":22,"title":["The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach"],"prefix":"10.1016","volume":"220","author":[{"given":"Zizhen","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Hu","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Wenbin","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Lim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2012.01.035_b0005","series-title":"The Traveling Salesman Problem: A Computational Study","author":"Applegate","year":"2006"},{"issue":"5","key":"10.1016\/j.ejor.2012.01.035_b0010","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1137\/07068151X","article-title":"A faster, better approximation algorithm for the minimum latency problem","volume":"37","author":"Archer","year":"2008","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"10.1016\/j.ejor.2012.01.035_b0015","doi-asserted-by":"crossref","first-page":"1317","DOI":"10.1137\/S0097539701399654","article-title":"Approximation schemes for minimum latency problems","volume":"32","author":"Arora","year":"2003","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2012.01.035_b0020","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.ejor.2009.06.034","article-title":"An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles","volume":"202","author":"Azi","year":"2010","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2012.01.035_b0025","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1002\/net.3230230202","article-title":"The traveling salesman problem with cumulative costs","volume":"23","author":"Bianco","year":"1993","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2012.01.035_b0030","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M., 1994. The minimum latency problem. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC\u201994), Montr\u00e9al, Qu\u00e9bec, Canada, pp. 163\u2013171.","DOI":"10.1145\/195058.195125"},{"key":"10.1016\/j.ejor.2012.01.035_b0035","first-page":"69","article-title":"Design and implementation of vehicle routing optimization system based on toll-by-weight","volume":"17","author":"Chen","year":"2007","journal-title":"Manufacture Information Engineering of China"},{"issue":"2","key":"10.1016\/j.ejor.2012.01.035_b0040","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.43.2.367","article-title":"An optimal algorithm for the traveling salesman problem with time windows","volume":"43","author":"Dumas","year":"1995","journal-title":"Operations Research"},{"issue":"6","key":"10.1016\/j.ejor.2012.01.035_b0045","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1287\/opre.41.6.1055","article-title":"The delivery man problem and cumulative matroids","volume":"41","author":"Fischetti","year":"1993","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2012.01.035_b0050","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0167-6377(88)90025-9","article-title":"A new dominance procedure for combinatorial optimization problems","volume":"7","author":"Fischetti","year":"1988","journal-title":"Operations Research Letters"},{"issue":"3","key":"10.1016\/j.ejor.2012.01.035_b0055","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1016\/j.ejor.2007.04.045","article-title":"Solving the car sequencing problem via branch & bound","volume":"191","author":"Fliedner","year":"2008","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2012.01.035_b0060","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/net.10031","article-title":"A note on the traveling repairman problem","volume":"40","author":"Garc\u00eda","year":"2002","journal-title":"Networks"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2012.01.035_b0065","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01585867","article-title":"An improved approximation ratio for the minimum latency problem","volume":"82","author":"Goemans","year":"1998","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2012.01.035_b0070","series-title":"Graph Theory and Its Applications","year":"2005"},{"key":"10.1016\/j.ejor.2012.01.035_b0075","series-title":"The Traveling Salesman Problem and Its Variations","year":"2002"},{"key":"10.1016\/j.ejor.2012.01.035_b0080","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","article-title":"On representatives of subsets","volume":"10","author":"Hall","year":"1935","journal-title":"Journal of the London Mathematical Society"},{"key":"10.1016\/j.ejor.2012.01.035_b0085","series-title":"Inequalities","author":"Hardy","year":"1988"},{"issue":"17","key":"10.1016\/j.ejor.2012.01.035_b0090","doi-asserted-by":"crossref","first-page":"3223","DOI":"10.1016\/j.dam.2008.05.009","article-title":"A new formulation for the traveling deliveryman problem","volume":"156","author":"M\u00e9ndez-D\u00edaz","year":"2008","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"10.1016\/j.ejor.2012.01.035_b0095","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1287\/opre.45.3.365","article-title":"Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints","volume":"45","author":"Mingozzi","year":"1997","journal-title":"Operations Research"},{"issue":"1\u20134","key":"10.1016\/j.ejor.2012.01.035_b0100","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02097807","article-title":"The delivery man problem on a tree network","volume":"18","author":"Minieka","year":"1989","journal-title":"Annals of Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2012.01.035_b0105","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB \u2014 traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/j.ejor.2012.01.035_b0110","unstructured":"Salehipour, A., S\u00f6rensen, K., Goos, P., Br\u00e4ysy, O., 2008. An efficient GRASP+VND metaheuristic for the traveling repairman problem. Working Papers, University of Antwerp, Faculty of Applied Economics. URL "},{"key":"10.1016\/j.ejor.2012.01.035_b0115","series-title":"Opportunities and Challenges for Next-Generation Applied Intelligence","first-page":"311","article-title":"A capacitated vehicle routing problem with toll-by-weight rule","volume":"vol. 214","author":"Shen","year":"2009"},{"key":"10.1016\/j.ejor.2012.01.035_b0120","series-title":"The Vehicle Routing Problem","year":"2002"},{"key":"10.1016\/j.ejor.2012.01.035_b0125","unstructured":"Wikipedia, 2011. Expressways of China. "},{"issue":"6","key":"10.1016\/j.ejor.2012.01.035_b0130","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.ipl.2004.09.009","article-title":"Exact algorithms for the minimum latency problem","volume":"92","author":"Wu","year":"2004","journal-title":"Information Processing Letters"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712000707?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712000707?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T22:23:26Z","timestamp":1543271006000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221712000707"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["S0377221712000707"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2012.01.035","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}