{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T13:43:11Z","timestamp":1784900591138,"version":"3.55.0"},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,11,1]],"date-time":"2004-11-01T00:00:00Z","timestamp":1099267200000},"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":[[2004,11]]},"DOI":"10.1016\/s0377-2217(03)00377-1","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T01:10:28Z","timestamp":1063329028000},"page":"793-795","source":"Crossref","is-referenced-by-count":135,"title":["A note on the lifted Miller\u2013Tucker\u2013Zemlin subtour elimination constraints for the capacitated vehicle routing problem"],"prefix":"10.1016","volume":"158","author":[{"given":"Imdat","family":"Kara","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tolga","family":"Bektas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00377-1_BIB1","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/S0166-218X(01)00351-1","article-title":"Models, relaxations and exact approaches for the capacitated vehicle routing problem","volume":"123","author":"Toth","year":"2002","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(03)00377-1_BIB2","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/0377-2217(85)90284-X","article-title":"Integer programming formulations of vehicle routing problems","volume":"20","author":"Kulkarni","year":"1985","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00377-1_BIB3","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulations and traveling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(03)00377-1_BIB4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","article-title":"Improvements and extensions to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints","volume":"10","author":"Desrochers","year":"1991","journal-title":"Operations Research Letters"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703003771?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703003771?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T03:23:43Z","timestamp":1551065023000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703003771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,11]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,11]]}},"alternative-id":["S0377221703003771"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00377-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,11]]}}}