{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T10:44:13Z","timestamp":1708339453547},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1016\/0167-6377(92)90069-f","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"89-95","source":"Crossref","is-referenced-by-count":16,"title":["Traveling salesman problem under categorization"],"prefix":"10.1016","volume":"12","author":[{"given":"Abraham P","family":"Punnen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90069-F_BIB1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0305-0548(86)90060-2","article-title":"Bottleneck assignment problem under categorization","volume":"13","author":"Aggarwal","year":"1986","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/0167-6377(92)90069-F_BIB2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","article-title":"Linear time algorithms for NP-hard problems restricted to partial k-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0167-6377(92)90069-F_BIB3","series-title":"Proceedings of 26th IEEE Symposium on Foundations of Computer Science","first-page":"117","article-title":"Why certain subgraph computations require only linear time","author":"Bern","year":"1985"},{"key":"10.1016\/0167-6377(92)90069-F_BIB4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02591867","article-title":"Halin graphs and traveling salesman problem","volume":"26","author":"Cornuejols","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90069-F_BIB5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0095-8956(74)90091-4","article-title":"The square of every two connected graph is Hamiltonian","volume":"16","author":"Fleischer","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0167-6377(92)90069-F_BIB6","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0167-6377(92)90069-F_BIB7","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/322077.322086","article-title":"The bottleneck traveling salesman problem: Algorithms and probabilistic analysis","volume":"25","author":"Garfinkel","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0167-6377(92)90069-F_BIB8","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0377-2217(89)90473-6","article-title":"Group centre and group median of a network","volume":"38","author":"Gupta","year":"1989","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0167-6377(92)90069-F_BIB9","first-page":"177","article-title":"Minmax linear programs with grouped variables","volume":"26","author":"Gupta","year":"1989","journal-title":"Opsearch"},{"key":"10.1016\/0167-6377(92)90069-F_BIB10","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1002\/1520-6750(198906)36:3<311::AID-NAV3220360308>3.0.CO;2-L","article-title":"A modified GUB algorithm for solving linear minmax problems","volume":"36","author":"Kuno","year":"1989","journal-title":"Naval Res. Logist."},{"key":"10.1016\/0167-6377(92)90069-F_BIB11","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"Lawler","year":"1985"},{"key":"10.1016\/0167-6377(92)90069-F_BIB12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0167-6377(84)90077-4","article-title":"Guaranteed performance heuristics for the bottleneck travelling salesman problem","volume":"2","author":"Parker","year":"1984","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(92)90069-F_BIB13","article-title":"A characterization and efficient reliability computation of \u0394\u2212Y reducible networks","author":"Politof","year":"1983"},{"key":"10.1016\/0167-6377(92)90069-F_BIB14","article-title":"An efficient algorithm for producing a Hamiltonian cycle in the square of a biconnected graph","author":"Rardin","year":"1983"},{"key":"10.1016\/0167-6377(92)90069-F_BIB15","series-title":"Presented at CORS\/ORSA\/TIMS meeting","article-title":"Minimum weight perfect bipartite matching and spanning trees under categorization","author":"Richey","year":"1989"},{"key":"10.1016\/0167-6377(92)90069-F_BIB16","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1057\/jors.1981.99","article-title":"Some generalizations of the time minimizing assignment problem","volume":"32","author":"Seshan","year":"1981","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0167-6377(92)90069-F_BIB17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0166-218X(87)90031-X","article-title":"Steiner problem in Halin networks","volume":"17","author":"Winter","year":"1987","journal-title":"Discrete Appl. Math."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290069F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290069F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:50:39Z","timestamp":1552888239000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779290069F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["016763779290069F"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90069-f","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}