{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:06Z","timestamp":1759637586316},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":7198,"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":[[1993,11]]},"DOI":"10.1016\/0166-218x(93)90152-e","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"57-75","source":"Crossref","is-referenced-by-count":8,"title":["An O(n) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices"],"prefix":"10.1016","volume":"47","author":[{"given":"Jack A.A.","family":"van der Veen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90152-E_BIB1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0166-218X(91)90024-Q","article-title":"Efficiently solvable special cases of bottleneck traveling salesman problems","volume":"32","author":"Burkard","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(93)90152-E_BIB2","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1080\/02331939108843720","article-title":"Universal conditions for algebraic traveling salesman problems to be efficiently solvable","volume":"22","author":"Burkard","year":"1991","journal-title":"Optimization"},{"key":"10.1016\/0166-218X(93)90152-E_BIB3","first-page":"29","article-title":"The traveling salesman problem with asymmetric matrices","volume":"1","author":"Demidenko","year":"1979","journal-title":"Isv. Akad. Nauk BSSR Ser. Fiz.-Mat. Nauk"},{"key":"10.1016\/0166-218X(93)90152-E_BIB4","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","article-title":"Sequencing a one state variable machine: a solvable case of the traveling salesman problem","volume":"12","author":"Gilmore","year":"1964","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(93)90152-E_BIB5","series-title":"The Traveling Salesman Problem","first-page":"87","article-title":"Well-solved special cases","author":"Gilmore","year":"1985"},{"key":"10.1016\/0166-218X(93)90152-E_BIB6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0196-6774(88)90031-4","article-title":"Algorithms for two bottleneck optimization problems","volume":"9","author":"Gabow","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(93)90152-E_BIB7","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1287\/opre.36.1.18","article-title":"The nozzle guide vane problem","volume":"36","author":"Plante","year":"1988","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(93)90152-E_BIB8","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1287\/opre.35.5.772","article-title":"The product matrix traveling salesman problem: an application and solution heuristic","volume":"35","author":"Plante","year":"1987","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(93)90152-E_BIB9","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1287\/opre.31.3.507","article-title":"Order picking in a rectangular warehouse: a solvable case of the traveling salesman problem","volume":"31","author":"Ratliff","year":"1983","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(93)90152-E_BIB10_1","first-page":"533","article-title":"On the complexity of minimizing a linear form on a set of cyclic permutations","volume":"253","author":"Sarvanov","year":"1980","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0166-218X(93)90152-E_BIB10_2","first-page":"118","article-title":"On the complexity of minimizing a linear form on a set of cyclic permutations","volume":"22","author":"Sarvanov","year":"1980","journal-title":"Soviet Math. Dokl."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390152E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390152E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:26:20Z","timestamp":1555136780000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390152E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["0166218X9390152E"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90152-e","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}