{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T17:48:21Z","timestamp":1723657701380},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1016\/j.orl.2004.04.003","type":"journal-article","created":{"date-parts":[[2004,6,22]],"date-time":"2004-06-22T10:23:17Z","timestamp":1087899797000},"page":"71-76","source":"Crossref","is-referenced-by-count":13,"title":["On the complexity of the k-customer vehicle routing problem"],"prefix":"10.1016","volume":"33","author":[{"given":"Refael","family":"Hassin","sequence":"first","affiliation":[]},{"given":"Shlomi","family":"Rubinstein","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2004.04.003_BIB1","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/j.orl.2004.04.003_BIB2","doi-asserted-by":"crossref","unstructured":"C. Bazgan, R. Hassin, J. Monnot, Differential approximations for some routing problems, in: R. Petreschi, G. Persiano, R. Silvestri (Eds.), Algorithms and Complexity, Fifth Italian Conference CIAC, Lecture Notes in Computer Science, Vol. 2653, Springer, Berlin, 2003, pp. 277\u2013288.","DOI":"10.1007\/3-540-44849-7_31"},{"key":"10.1016\/j.orl.2004.04.003_BIB3","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.10.4.527","article-title":"Bounds and heuristics for capacitated routing problems","volume":"10","author":"Haimovich","year":"1985","journal-title":"Math. Oper. Res"},{"key":"10.1016\/j.orl.2004.04.003_BIB4","series-title":"Vehicle Routing Methods and Studies","first-page":"47","article-title":"Analysis of heuristics for vehicle routing problems","author":"Haimovich","year":"1988"},{"key":"10.1016\/j.orl.2004.04.003_BIB5","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/j.orl.2004.04.003_BIB6","doi-asserted-by":"crossref","unstructured":"D.G. Kirkpatrick, P. Hell, On the completeness of a generalized matching problem, Proceedings of the 10th ACM Symposium on Theory and Computing, 1978, pp. 240\u2013245.","DOI":"10.1145\/800133.804353"},{"key":"10.1016\/j.orl.2004.04.003_BIB7","doi-asserted-by":"crossref","first-page":"2147","DOI":"10.1016\/S0304-3975(02)00577-7","article-title":"On the k-path partition of graphs","volume":"290","author":"Steiner","year":"2003","journal-title":"Theor. Comput. Sci"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704000513?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704000513?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T14:50:32Z","timestamp":1549464632000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637704000513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["S0167637704000513"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2004.04.003","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}