{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:14:36Z","timestamp":1752984876563},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,4,29]],"date-time":"2006-04-29T00:00:00Z","timestamp":1146268800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2006,7]]},"DOI":"10.1007\/s00186-005-0053-1","type":"journal-article","created":{"date-parts":[[2006,4,28]],"date-time":"2006-04-28T10:56:30Z","timestamp":1146221790000},"page":"543-551","source":"Crossref","is-referenced-by-count":7,"title":["Computing an Eigenvector of a Monge Matrix in Max-Plus Algebra"],"prefix":"10.1007","volume":"63","author":[{"given":"Martin","family":"Gavalec","sequence":"first","affiliation":[]},{"given":"J\u00e1n","family":"Plavka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,4,29]]},"reference":[{"key":"53_CR1","first-page":"401","volume":"12","author":"VS Aizenshtat","year":"1968","unstructured":"Aizenshtat VS, Kravchuk DN (1968) Algorithms for finding extreme of a linear form on the set of all cycles in special cases. Dokl. Akad. Nauk BSSR 12:401\u2013404. (in Russian)","journal-title":"Dokl. Akad. Nauk BSSR"},{"key":"53_CR2","first-page":"80","volume":"4","author":"VS Aizenshtat","year":"1978","unstructured":"Aizenshtat VS, Maksimovich EP (1978) Special cases of traveling salesman problems (in Russian). Kibernetika 4:80\u201383","journal-title":"Kibernetika"},{"key":"53_CR3","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/BF01069839","volume":"14","author":"VS Aizenshtat","year":"1979","unstructured":"Aizenshtat VS, Maksimovich EP (1979) Special cases of traveling salesman problems (English translation). Cybernetics 14:565\u2013569","journal-title":"Cybernetics"},{"key":"53_CR4","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/S0036144596297514","volume":"40","author":"RE Burkard","year":"1998","unstructured":"Burkard RE, Deineko VG, van Dal R, van der Veen J, Woeginger GJ (1998) Well-solvable special cases of the TSP: a survey. SIAM Rev 40: 496\u2013546","journal-title":"SIAM Rev"},{"key":"53_CR5","first-page":"95","volume":"70","author":"RE Burkard","year":"1996","unstructured":"Burkard RE, Klinz B, Rudolf R (1996) Perspectives of Monge properties in Optimization, Discrete Appl. Math. 70:95\u2013161","journal-title":"Math."},{"key":"53_CR6","volume-title":"Minimax Algebra, lecture notes in economics and mathematical Systems, vol 166","author":"RA Cuninghame-Green","year":"1979","unstructured":"Cuninghame-Green RA (1979) Minimax Algebra, lecture notes in economics and mathematical Systems, vol 166. Springer, Berlin Heidelberg New York"},{"key":"53_CR7","unstructured":"Deineko VG, Filonenko VL (1979) On the reconstruction of specially structured matrices, Aktualnyje Problemy EVM, programmirovanije (Russian). Dnepropetrovsk, DGU, 1979"},{"key":"53_CR8","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/S0166-218X(02)00395-5","volume":"127","author":"M Gavalec","year":"2003","unstructured":"Gavalec M, Plavka J (2003) An O(n 2) algorithm for maximum cycle mean of Monge matrices in max-algebra. Discrete Appl Math 127:651\u2013656","journal-title":"Discrete Appl Math"},{"key":"53_CR9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"RM Karp","year":"1978","unstructured":"Karp RM (1978) A characterization of the minimum cycle mean in a digraph. Discrete Math 23:309\u2013311","journal-title":"Discrete Math"},{"key":"53_CR10","volume-title":"Combinatorial optimization: networks and matroids","author":"EL Lawler","year":"1976","unstructured":"Lawler EL (1976) Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York"},{"key":"53_CR11","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1016\/0196-6774(88)90032-6","volume":"9","author":"R Wilber","year":"1988","unstructured":"Wilber R (1988) The concave least-weight subsequence problem revisited. J Algorithms 9: 418\u2013425","journal-title":"J Algorithms"},{"key":"53_CR12","volume-title":"Linear and combinatorial Optimization in Ordered algebraic structures","author":"U Zimmermann","year":"1981","unstructured":"Zimmermann U (1981) Linear and combinatorial Optimization in Ordered algebraic structures. North Holland, Amsterdam"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-005-0053-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-005-0053-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-005-0053-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T10:33:23Z","timestamp":1558607603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-005-0053-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4,29]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["53"],"URL":"https:\/\/doi.org\/10.1007\/s00186-005-0053-1","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4,29]]}}}