{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T18:12:55Z","timestamp":1694628775930},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Methods of Operations Research"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1007\/bf01680370","type":"journal-article","created":{"date-parts":[[2006,7,7]],"date-time":"2006-07-07T22:15:02Z","timestamp":1152310502000},"page":"169-181","source":"Crossref","is-referenced-by-count":3,"title":["Maximum travelling salesman problem"],"prefix":"10.1007","volume":"43","author":[{"given":"Vladimir","family":"Kotov","sequence":"first","affiliation":[]},{"given":"Michail","family":"Kovalev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01680370_CR1","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1002\/net.3230090406","volume":"9","author":"T Jenkyns","year":"1979","unstructured":"Jenkyns T (1979) Greedy travelling salesman's problem Networks. 9:363\u2013373","journal-title":"Networks"},{"key":"BF01680370_CR2","first-page":"1035","volume":"N4","author":"MM Kovalev","year":"1981","unstructured":"Kovalev MM, Kotov VM (1981) An analysis of greedy solution for travelling salesman problem. USSR Comput Math and Math Phys N4:1035\u20131038","journal-title":"USSR Comput Math and Math Phys"},{"key":"BF01680370_CR3","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1287\/opre.27.4.799","volume":"4","author":"M Fisher","year":"1979","unstructured":"Fisher M, Nemhauser G, Wolsey L (1979) An analysis of approximations for finding a maximum weight Hamiltonian circuit. Oper Res 4:799\u2013809","journal-title":"Oper Res"},{"key":"BF01680370_CR4","first-page":"2403","volume":"82","author":"MM Kovalev","year":"1982","unstructured":"Kovalev MM, Kotov VM (1982) Suboptimal algorithms for solving travelling salesman problem. VINITI N 2403-82:31","journal-title":"VINITI N"},{"key":"BF01680370_CR5","first-page":"45","volume":"N4","author":"MM Kovalev","year":"1984","unstructured":"Kovalev MM, Kotov VM (1984) An analysis of algorithms for constructing Hamiltonian circuit with maximum weight (russ) Izv AN BSSR. N4:45\u201350","journal-title":"Izv AN BSSR."},{"key":"BF01680370_CR6","first-page":"55","volume":"26","author":"A Kostochka","year":"1985","unstructured":"Kostochka A, Serdukov A (1985) Polynomial algorithms with worst-case performances 3\/4 and 5\/6 for maximum travelling salesman problem (russ). Controlled System (Novosibirsk) 26:55\u2013598","journal-title":"Controlled System (Novosibirsk)"},{"issue":"1","key":"BF01680370_CR7","first-page":"44","volume":"3","author":"MM Kovalev","year":"1986","unstructured":"Kovalev MM, Kotov VM (1986) Worst-case performances of series of heuristics (russ.). Izv Byelorussian Univ 3(1):44\u201348","journal-title":"Izv Byelorussian Univ"},{"key":"BF01680370_CR8","first-page":"79","volume":"27","author":"A Serdukov","year":"1987","unstructured":"Serdukov A (1987) An asymptotically exact algorithm for maximum travelling salesman problem in the Euclidean space (russ). Controlled System (Novosibirsk) 27:79\u201387","journal-title":"Controlled System (Novosibirsk)"},{"key":"BF01680370_CR9","unstructured":"Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report, GSIA, Carnegie-Mellon University"},{"key":"BF01680370_CR10","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"D Rozenkrantz","year":"1977","unstructured":"Rozenkrantz D, Stearns R, Lewis P (1977) An analysis of several heuristics for the travelling salesman problem. SIAM J Comput 6:563\u2013581","journal-title":"SIAM J Comput"},{"key":"BF01680370_CR11","first-page":"80","volume":"25","author":"A Serdukov","year":"1984","unstructured":"Serdukov A (1984) An algorithm with performance for maximum traveling salesman problem (russ). Controlled System (Novosibirsk) 25:80\u201386","journal-title":"Controlled System (Novosibirsk)"},{"key":"BF01680370_CR12","unstructured":"Kovalev M, Kotov V (1985) Series of greedy algorithms (russ). Diskrete Optimierung Jena Universitat 93\u2013103"},{"key":"BF01680370_CR13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230120103","volume":"12","author":"A Friese","year":"1982","unstructured":"Friese A, Galbiaty G, Maffioli F (1982) On the worst-case performance of some algorithms for asymmetric travelling salesman problem. Networks 12:23\u201339","journal-title":"Networks"},{"key":"BF01680370_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"C Papadimitriou","year":"1993","unstructured":"Papadimitriou C, Yannakakis M (1993) The travelling salesman problem with distances one and two. Math of Oper Res 18:1\u201311","journal-title":"Math of Oper Res"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01680370.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF01680370\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01680370","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01680370.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T22:04:14Z","timestamp":1652565854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF01680370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["BF01680370"],"URL":"https:\/\/doi.org\/10.1007\/bf01680370","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}