{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T16:05:47Z","timestamp":1775145947977,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"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":10000,"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":[[1986,3]]},"DOI":"10.1016\/0166-218x(86)90087-9","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"259-276","source":"Crossref","is-referenced-by-count":44,"title":["The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm"],"prefix":"10.1016","volume":"13","author":[{"given":"A","family":"Iqbal Ali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeff L","family":"Kennington","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(86)90087-9_BIB1","article-title":"Two node-routing problems","author":"Ali","year":"1980"},{"key":"10.1016\/0166-218X(86)90087-9_BIB2","article-title":"The m-travelling salesmen problem","author":"Ali","year":"1980"},{"key":"10.1016\/0166-218X(86)90087-9_BIB3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01584338","article-title":"The travelling salesmen problem: A duality approach","volume":"13","author":"Bazaraa","year":"1977","journal-title":"Math. Programmings"},{"key":"10.1016\/0166-218X(86)90087-9_BIB4","series-title":"Nonlinear Programming: Theory and Algorithms","author":"Bazaraa","year":"1979"},{"issue":"3","key":"10.1016\/0166-218X(86)90087-9_BIB5","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1145\/321832.321847","article-title":"Transformation of multi-salesmen problem to the standard travelling salesmen problem","volume":"21","author":"Bellmore","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(86)90087-9_BIB6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","article-title":"Matroids and the greedy algorithm","volume":"1","author":"Edmonds","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(86)90087-9_BIB7","series-title":"Presented at the Joint National TIMS\/ORSA Meeting","article-title":"Optimal and sub-optimal solution methods for the multiple travelling salesman problem","author":"Gavish","year":"1980"},{"issue":"1","key":"10.1016\/0166-218X(86)90087-9_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1013001","article-title":"Duality in nonlinear programming: A simplified applications-oriented development","volume":"13","author":"Geoffrion","year":"1971","journal-title":"SIAM Review"},{"issue":"9","key":"10.1016\/0166-218X(86)90087-9_BIB9","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1287\/mnsc.18.9.465","article-title":"Integer programming algorithms: A framework and state-of-the-art survey","volume":"18","author":"Geoffrion","year":"1972","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(86)90087-9_BIB10","first-page":"92","article-title":"Lagrangean relaxation for integer programming","volume":"2","author":"Geoffrion","year":"1979","journal-title":"Math. Programming Study"},{"key":"10.1016\/0166-218X(86)90087-9_BIB11","first-page":"425","article-title":"Finding minimum spanning trees with a fixed number of links at a node","volume":"12","author":"Glover","year":"1974"},{"key":"10.1016\/0166-218X(86)90087-9_BIB12","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The travelling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(86)90087-9_BIB13","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The travelling salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(86)90087-9_BIB14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(86)90087-9_BIB15","article-title":"A Lagrangean relaxation approach to the generalized fixed charge multicommodity network flow problem","author":"Helgason","year":"1979"},{"key":"10.1016\/0166-218X(86)90087-9_BIB16","series-title":"Algorithms for Network Programming","author":"Kennington","year":"1980"},{"key":"10.1016\/0166-218X(86)90087-9_BIB17","series-title":"Presented at Joint National Meeting of TIMS\/ORSA","article-title":"Branch-and-bound methods with strogner than optimal bounds","author":"Marsten","year":"1980"},{"key":"10.1016\/0166-218X(86)90087-9_BIB18","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulation of travelling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(86)90087-9_BIB19","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1287\/mnsc.19.7.790","article-title":"Computational experience with an m-salesman travelling salesman algorithm","volume":"19","author":"Svetska","year":"1973","journal-title":"Management Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X86900879?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X86900879?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:56:31Z","timestamp":1553946991000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X86900879"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":19,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["0166218X86900879"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(86)90087-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}