{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:36:46Z","timestamp":1778495806124,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,11,1]],"date-time":"1987-11-01T00:00:00Z","timestamp":562723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9390,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1987,11]]},"DOI":"10.1016\/0166-218x(87)90020-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"185-197","source":"Crossref","is-referenced-by-count":90,"title":["Generalized travelling salesman problem through n sets of nodes: the asymmetrical case"],"prefix":"10.1016","volume":"18","author":[{"given":"Gilbert","family":"Laporte","sequence":"first","affiliation":[]},{"given":"H\u00e9l\u00e8ne","family":"Mercure","sequence":"additional","affiliation":[]},{"given":"Yves","family":"Nobert","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(87)90020-5_BIB1","article-title":"The selective travelling salesman problem","author":"Bovet","year":"1983","journal-title":"Paper presented at the EURO VI Conference"},{"key":"10.1016\/0166-218X(87)90020-5_BIB2","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 Sci."},{"key":"10.1016\/0166-218X(87)90020-5_BIB3","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\/0166-218X(87)90020-5_BIB4","first-page":"43","article-title":"The record balancing problem: A dynamic programming solution of a generalized travelling salesman problem","volume":"B-2","author":"Henry-Labordere","year":"1969","journal-title":"RIRO"},{"key":"10.1016\/0166-218X(87)90020-5_BIB5","first-page":"61","article-title":"Generalized travelling salesman problem through n sets of nodes: an integer programming approach","volume":"21","author":"Laporte","year":"1983","journal-title":"Infor."},{"key":"10.1016\/0166-218X(87)90020-5_BIB6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1051\/ro\/1984180302031","article-title":"Optimal tour planning with specified nodes","volume":"18","author":"Laporte","year":"1984","journal-title":"RAIRO Rech. Op\u00e9r."},{"key":"10.1016\/0166-218X(87)90020-5_BIB7","first-page":"277","article-title":"Finding the shortest Hamiltonian circuit through n clusters: a Lagrangean relaxation approach","volume":"48","author":"Laporte","year":"1985","journal-title":"Cong. Mumer."},{"key":"10.1016\/0166-218X(87)90020-5_BIB8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","article-title":"Complexity of vehicle routing and scheduling problems","volume":"11","author":"Lenstra","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0166-218X(87)90020-5_BIB9","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"Computer solutions of the travelling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(87)90020-5_BIB10","series-title":"Private Communication","author":"Rousseau","year":"1985"},{"key":"10.1016\/0166-218X(87)90020-5_BIB11","first-page":"185","article-title":"Mathematical model of scheduling clients through welfare agencies","volume":"8","author":"Saksena","year":"1970","journal-title":"CORS J."},{"key":"10.1016\/0166-218X(87)90020-5_BIB12","first-page":"97","article-title":"Generalized travelling salesman problem through n sets of nodes","volume":"7","author":"Srivastava","year":"1969","journal-title":"CORS J."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900205?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900205?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:53:22Z","timestamp":1555134802000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,11]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,11]]}},"alternative-id":["0166218X87900205"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90020-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,11]]}}}