{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:26:47Z","timestamp":1649176007610},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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 & Operations Research"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0305-0548(90)90034-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"113-117","source":"Crossref","is-referenced-by-count":1,"title":["Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem"],"prefix":"10.1016","volume":"17","author":[{"given":"Ton","family":"Volgenant","sequence":"first","affiliation":[]},{"given":"Roy","family":"Jonker","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(90)90034-5_BIB1","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(90)90034-5_BIB2","article-title":"Efficient branch and bound code for solving large-scale traveling salesmen problems to optimality","author":"Gavish","year":"1983"},{"key":"10.1016\/0305-0548(90)90034-5_BIB3","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":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(90)90034-5_BIB4","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1287\/mnsc.23.8.904","article-title":"On the use of fictitious bounds in tree search algorithms","volume":"23","author":"Bazaraa","year":"1977","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(90)90034-5_BIB5","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","article-title":"Branch-and-bound methods: a survey","volume":"14","author":"Lawler","year":"1966","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(90)90034-5_BIB6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01584338","article-title":"The traveling salesman problem: a duality approach","volume":"13","author":"Bazaraa","year":"1977","journal-title":"Mathemat. Proyramm."},{"key":"10.1016\/0305-0548(90)90034-5_BIB7","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1057\/jors.1987.177","article-title":"On some generalizations of the traveling salesman problem","volume":"38","author":"Volgenant","year":"1987","journal-title":"J. Opl Res. Soc."},{"key":"10.1016\/0305-0548(90)90034-5_BIB8","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1287\/opre.32.4.837","article-title":"Non-optimal edges for the symmetric traveling salesman problem","volume":"32","author":"Jonker","year":"1984","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(90)90034-5_BIB9","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1287\/opre.34.5.698","article-title":"An optimal solution method for large-scale multiple traveling salesmen problems","volume":"34","author":"Gavish","year":"1987","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(90)90034-5_BIB10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1287\/opre.36.1.163","article-title":"An improved transformation of the symmetric multiple traveling salesman problem","volume":"36","author":"Jonker","year":"1988","journal-title":"Opns Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054890900345?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054890900345?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:59:18Z","timestamp":1552913958000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054890900345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["0305054890900345"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(90)90034-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}