{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:14:47Z","timestamp":1773656087892,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":8539,"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":[[1990,3]]},"DOI":"10.1016\/0166-218x(90)90101-h","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"209-217","source":"Crossref","is-referenced-by-count":2,"title":["Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations"],"prefix":"10.1016","volume":"26","author":[{"given":"T.H.C.","family":"Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.W.S.","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.L.","family":"Thompson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90101-H_BIB1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/nav.3800220109","article-title":"An operator theory of parametric programming for the generalized transportation problem II: Rim, cost, and bound operators","volume":"22","author":"Balachandran","year":"1975","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(90)90101-H_BIB2","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":"Math. Programming"},{"key":"10.1016\/0166-218X(90)90101-H_BIB3","series-title":"The Traveling Salesman Problem","article-title":"Branch and bound methods","author":"Balas","year":"1985"},{"key":"10.1016\/0166-218X(90)90101-H_BIB4","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":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90101-H_BIB5","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","article-title":"Solving large-scale symmetric travelling salesman problems to optimality","volume":"26","author":"Crowder","year":"1980","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(90)90101-H_BIB6","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling salesman problem and minimum spanning trees Part II","volume":"1","author":"Held","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(90)90101-H_BIB7","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1287\/opre.32.4.837","article-title":"Nonoptimal edges for the symmetric traveling salesman problem","volume":"32","author":"Jonker","year":"1984","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90101-H_BIB8","series-title":"Algorithms for Network Programming","author":"Kennington","year":"1980"},{"key":"10.1016\/0166-218X(90)90101-H_BIB9","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","article-title":"An algorithm for the traveling salesman problem","volume":"11","author":"Little","year":"1963","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90101-H_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","article-title":"Optimization of a 532-city symmetric traveling salesman problem by branch and cut","volume":"6","author":"Padberg","year":"1987","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(90)90101-H_BIB11","series-title":"MSSR 382","article-title":"A comparison of two different Lagrangean relaxations of the traveling salesman problem","author":"Smith","year":"1975"},{"key":"10.1016\/0166-218X(90)90101-H_BIB12","first-page":"479","article-title":"A LIFO implicit enumeration search algorithm for the symmetric traveling salesman problem using Held and Karp's 1-tree relaxation","volume":"1","author":"Smith","year":"1977"},{"key":"10.1016\/0166-218X(90)90101-H_BIB13","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0377-2217(83)90161-3","article-title":"The symmetric traveling salesman problem and edge exchanges in minimal 1-trees","volume":"12","author":"Volgenant","year":"1983","journal-title":"European J. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090101H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090101H?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:56:42Z","timestamp":1555135002000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090101H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":13,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["0166218X9090101H"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90101-h","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}