{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:29:21Z","timestamp":1675211361906},"reference-count":10,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0305-0548(02)00042-4","type":"journal-article","created":{"date-parts":[[2002,12,30]],"date-time":"2002-12-30T13:18:07Z","timestamp":1041254287000},"page":"861-875","source":"Crossref","is-referenced-by-count":2,"title":["A cross-border transportation system under supply and demand constraints"],"prefix":"10.1016","volume":"30","author":[{"given":"K.K.","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"10","key":"10.1016\/S0305-0548(02)00042-4_BIB1","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1057\/jors.1995.167","article-title":"A heuristic for vehicle routing and depot staffing","volume":"46","author":"Bohoris","year":"1995","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"10.1016\/S0305-0548(02)00042-4_BIB2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1057\/jors.1983.11","article-title":"Vehicle fleet composition","volume":"34","author":"Etezadi","year":"1983","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"10.1016\/S0305-0548(02)00042-4_BIB3","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","article-title":"Optimal solution of vehicle routing problems using minimum K-trees","volume":"42","author":"Marshall","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00042-4_BIB4","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"issue":"5","key":"10.1016\/S0305-0548(02)00042-4_BIB5","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1057\/jors.1994.86","article-title":"A stochastic bottleneck transportation problem","volume":"45","author":"Geetha","year":"1994","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(02)00042-4_BIB6","unstructured":"Bruce L. Golden, editor. Vehicle routing 2000: advances in time-windows, optimality, fast bounds and multi-depot routing. Syracuse, New York: American Sciences Press, 1993."},{"key":"10.1016\/S0305-0548(02)00042-4_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1287\/trsc.24.1.25","article-title":"A multimode multiproduct network assignment model for strategic planning of freight flows","volume":"24","author":"Guelat","year":"1990","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(02)00042-4_BIB8","series-title":"Complex of computer computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0305-0548(02)00042-4_BIB9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0191-2615(92)90038-X","article-title":"A combined trip distribution and assignment model for multiple user classes","volume":"26B","author":"Lam","year":"1992","journal-title":"Transportation Res. Part-B, Methodological"},{"issue":"6","key":"10.1016\/S0305-0548(02)00042-4_BIB10","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1287\/opre.43.6.995","article-title":"Decomposition algorithms for analyzing tansient phenomena in multiclass queueing networks in air transportation","volume":"43","author":"Peterson","year":"1995","journal-title":"Operations Research"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000424?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000424?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T23:21:12Z","timestamp":1554765672000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802000424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0305054802000424"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00042-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}