{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T09:54:44Z","timestamp":1648979684387},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"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":[[1999,12]]},"DOI":"10.1016\/s0377-2217(99)00133-2","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"314-325","source":"Crossref","is-referenced-by-count":9,"title":["Cluster based branching for the asymmetric traveling salesman problem"],"prefix":"10.1016","volume":"119","author":[{"given":"Jens","family":"Lysgaard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00133-2_BIB1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01584228","article-title":"A restricted Lagrangean approach to the traveling salesman problem","volume":"21","author":"Balas","year":"1981","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00133-2_BIB2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","article-title":"A lift-and-project cutting plane algorithm for mixed 0-1 programs","volume":"58","author":"Balas","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00133-2_BIB3","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1287\/opre.19.2.278","article-title":"Pathology of traveling-salesman subtour-elimination algorithms","volume":"19","author":"Bellmore","year":"1971","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00133-2_BIB4","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.26.7.736","article-title":"Some new branching and bounding criteria for the asymmetric travelling salesman problem","volume":"26","author":"Carpaneto","year":"1980","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00133-2_BIB5","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1287\/opre.20.5.1044","article-title":"Bounds for the travelling-salesman problem","volume":"20","author":"Christofides","year":"1972","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00133-2_BIB6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/opre.37.2.319","article-title":"An additive bounding procedure for combinatorial optimization problems","volume":"37","author":"Fischetti","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00133-2_BIB7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01585701","article-title":"An additive bounding procedure for the asymmetric traveling salesman problem","volume":"53","author":"Fischetti","year":"1992","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00133-2_BIB8","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.5.4.426","article-title":"An efficient algorithm for the min-sum arborescence problem on complete digraphs","volume":"5","author":"Fischetti","year":"1993","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(99)00133-2_BIB9","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.21.1.340","article-title":"On partitioning the feasible set in a branch-and-bound algorithm for the asymmetric traveling-salesman problem","volume":"21","author":"Garfinkel","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00133-2_BIB10","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","article-title":"A dynamic programming approach to sequencing problems","volume":"10","author":"Held","year":"1962","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00133-2_BIB11","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","article-title":"A patching algorithm for the nonsymmetric traveling-salesman problem","volume":"8","author":"Karp","year":"1979","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0377-2217(99)00133-2_BIB12","unstructured":"Lysgaard, J., 1996. Subtour elimination by artificial nodes for the asymmetric traveling salesman problem, Working paper B 96-1, Department of Management Science and Logistics, The Aarhus School of Business"},{"key":"10.1016\/S0377-2217(99)00133-2_BIB13","unstructured":"Or, I., 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking, Ph.D. thesis, Northwestern University, Evanston, IL"},{"key":"10.1016\/S0377-2217(99)00133-2_BIB14","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB \u2013 A Traveling Salesman Problem Library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA Journal of Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001332?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001332?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T23:51:49Z","timestamp":1555977109000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799001332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["S0377221799001332"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00133-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}