{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T19:10:17Z","timestamp":1722625817758},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2013,3,26]],"date-time":"2013-03-26T00:00:00Z","timestamp":1364256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s00500-013-1027-5","type":"journal-article","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T11:34:40Z","timestamp":1364211280000},"page":"1767-1785","source":"Crossref","is-referenced-by-count":6,"title":["Universal algorithms for solving the matrix Bellman equations over semirings"],"prefix":"10.1007","volume":"17","author":[{"given":"G. L.","family":"Litvinov","sequence":"first","affiliation":[]},{"given":"A. Ya.","family":"Rodionov","sequence":"additional","affiliation":[]},{"given":"S. N.","family":"Sergeev","sequence":"additional","affiliation":[]},{"given":"A. N.","family":"Sobolevski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,26]]},"reference":[{"key":"1027_CR1","volume-title":"Introduction to interval computations","author":"G. Alefeld","year":"1983","unstructured":"Alefeld G, Herzberger J (1983) Introduction to interval computations. Academic Press, New York"},{"key":"1027_CR2","unstructured":"Baccelli FL, Cohen G, Olsder GJ, Quadrat JP (1992) Synchronization and linearity: an algebra for discrete event systems. Wiley, Hoboken"},{"key":"1027_CR3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1093\/imamat\/15.2.161","volume":"15","author":"R.C. Backhouse","year":"1975","unstructured":"Backhouse RC, Carr\u00e9 BA (1975) Regular algebra applied to path-finding problems. J Inst Math Appl 15:161\u2013186","journal-title":"J Inst Math Appl"},{"key":"1027_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02260368","volume":"12","author":"W. Barth","year":"1974","unstructured":"Barth W, Nuding E (1974) Optimale L\u00f6sung von Intervalgleichungsystemen. Comput Lett 12:117\u2013125","journal-title":"Computing"},{"key":"1027_CR5","doi-asserted-by":"crossref","unstructured":"Butkovi\u010d P (2010) Max-linear systems: theory and algorithms. Springer, Berlin","DOI":"10.1007\/978-1-84996-299-5"},{"key":"1027_CR6","unstructured":"Butkovi\u010d P, Schneider H, Sergeev S (2011) Z-matrix equations in max algebra, nonnegative linear algebra and other semirings. http:\/\/www.arxiv.org\/abs\/1110.4564"},{"key":"1027_CR7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1093\/imamat\/7.3.273","volume":"7","author":"B.A. Carr\u00e9","year":"1971","unstructured":"Carr\u00e9 BA (1971) An algebra for network routing problems. J Inst Math Appl 7:273\u2013294","journal-title":"J. of the Inst. of Maths. and Applics"},{"key":"1027_CR8","volume-title":"Graphs and Networks","author":"B.A. Carr\u00e9","year":"1979","unstructured":"Carr\u00e9 BA (1979) Graphs and networks. Oxford University Press, Oxford"},{"issue":"1\u20133","key":"1027_CR9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0024-3795(01)00405-0","volume":"340","author":"K. Cechl\u00e1rov\u00e1","year":"2002","unstructured":"Cechl\u00e1rov\u00e1 K, Cuninghame-Green RA (2002) Interval systems of max-separable linear equations. Linear Alg Appl 340(1\u20133):215\u2013224","journal-title":"Linear Alg Appl"},{"key":"1027_CR10","volume-title":"Minimax Algebra, volume 166 of Lecture Notes in Economics and Mathematical Systems","author":"R.A. Cuninghame-Green","year":"1979","unstructured":"Cuninghame-Green RA (1979) Minimax algebra, volume 166 of lecture notes in economics and mathematical systems. Springer, Berlin"},{"key":"1027_CR11","unstructured":"Faddeev DK, Faddeeva VN (2002) Computational methods of linear algebra. Lan\u2019, St. Petersburg. 3rd ed., in Russian"},{"key":"1027_CR12","volume-title":"Linear optimization problems with inexact data","author":"M. Fiedler","year":"2006","unstructured":"Fiedler M, Nedoma J, Ram\u00edk J, Rohn J, Zimmermann K (2006) Linear optimization problems with inexact data. Springer, New York"},{"key":"1027_CR13","doi-asserted-by":"crossref","unstructured":"Golan J (2000) Semirings and their applications. Kluwer, Dordrecht","DOI":"10.1007\/978-94-015-9333-5"},{"key":"1027_CR14","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1989","unstructured":"Golub GH, van Loan C (1989) Matrix computations. John Hopkins University Press, Baltimore and London"},{"key":"1027_CR15","doi-asserted-by":"crossref","unstructured":"Gondran M (1975) Path algebra and algorithms. In: Roy B (ed), Combinatorial programming: methods and applications, Reidel, Dordrecht, pp 137\u2013148","DOI":"10.1007\/978-94-011-7557-9_6"},{"key":"1027_CR16","unstructured":"Gondran M, Minoux M (1979) Graphes et\u00a0algorithmes. \u00c9ditions Eylrolles, Paris"},{"key":"1027_CR17","unstructured":"Gondran M, Minoux M (2010) Graphs, dioids and semirings. Springer, New York a.o."},{"key":"1027_CR18","volume-title":"Idempotency","year":"1998","unstructured":"Gunawardena J (eds) (1998) Idempotency. Cambridge University Press, Cambridge"},{"key":"1027_CR19","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1016\/j.laa.2009.03.039","volume":"431","author":"L. Hardouin","year":"2009","unstructured":"Hardouin L, Cottenceau B, Lhommeau M, Le Corronc E (2009) Interval systems over idempotent semiring. Linear Alg Appl 431:855\u2013862","journal-title":"Linear Alg Appl"},{"key":"1027_CR20","doi-asserted-by":"crossref","unstructured":"Kolokoltsov VN, Maslov VP (1997) Idempotent analysis and its applications. Kluwer, Dordrecht","DOI":"10.1007\/978-94-015-8901-7"},{"key":"1027_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2793-7","volume-title":"Computational complexity and feasibility of data processing and interval computations","author":"V. Kreinovich","year":"1998","unstructured":"Kreinovich V, Lakeev A, Rohn J, Kahl P (1998) Computational complexity and feasibility of data processing and interval computations. Kluwer, Dordrecht"},{"issue":"1","key":"1027_CR22","first-page":"23","volume":"39","author":"N.K. Krivulin","year":"2006","unstructured":"Krivulin NK (2006) Solution of generalized linear vector equations in idempotent linear algebra. Vestnik St.Petersburg Univ Math 39(1):23\u201336","journal-title":"Vestnik St.Petersburg University Mathematics"},{"key":"1027_CR23","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(77)90056-1","volume":"4","author":"D.J. Lehmann","year":"1977","unstructured":"Lehmann DJ (1977) Algebraic structures for transitive closure. Theor Comp Sci 4:59\u201376","journal-title":"Theoret. Comp. Sci."},{"key":"1027_CR24","doi-asserted-by":"crossref","unstructured":"Litvinov GL (2007) The Maslov dequantization, idempotent and tropical mathematics: a brief introduction. J Math Sci 141(4):1417\u20131428. http:\/\/www.arxiv.org\/abs\/math.GM\/0507014","DOI":"10.1007\/s10958-007-0049-x"},{"key":"1027_CR25","doi-asserted-by":"crossref","first-page":"1210","DOI":"10.1070\/RM1996v051n06ABEH003011","volume":"51","author":"G.L. Litvinov","year":"1996","unstructured":"Litvinov GL, Maslov VP (1996) Idempotent mathematics: correspondence principle and applications. Russ Math Surv 51:1210\u20131211","journal-title":"Russ Math Surv"},{"key":"1027_CR26","unstructured":"Litvinov GL, Maslov VP (1998) The correspondence principle for idempotent calculus and some computer applications. In: Gunawardena J (ed) Idempotency, Cambridge University Press, Cambridge, pp 420\u2013443. http:\/\/www.arxiv.org\/abs\/math.GM\/0101021"},{"key":"1027_CR30","doi-asserted-by":"crossref","unstructured":"Litvinov GL, Maslova EV (2000) Universal numerical algorithms and their software implementation. Progr Comput Softw 26(5):275\u2013280. http:\/\/www.arxiv.org\/abs\/math.SC\/0102114Z","DOI":"10.1007\/BF02759321"},{"key":"1027_CR33","unstructured":"Litvinov GL, Sobolevski\u012d AN (2000) Exact interval solutions of the discrete bellman equation and polynomial complexity in interval idempotent linear algebra. Dokl Math 62(2):199\u2013201. http:\/\/www.arxiv.org\/abs\/math.LA\/0101041"},{"key":"1027_CR34","unstructured":"Litvinov GL, Sobolevski\u012d AN (2001) Idempotent interval analysis and optimization problems. Reliab Comput 7(5):353\u2013377. http:\/\/www.arxiv.org\/abs\/math.SC\/0101080"},{"key":"1027_CR35","unstructured":"Litvinov GL, Maslov VP, Rodionov AYa (2000) A unifying approach to software and hardware design for scientific calculations and idempotent mathematics. International Sophus Lie Centre, Moscow. http:\/\/www.arxiv.org\/abs\/math.SC\/0101069"},{"key":"1027_CR29","doi-asserted-by":"crossref","unstructured":"Litvinov GL, Maslov VP, Shpiz GB (2001) Idempotent functional analysis. An algebraic approach. Math Notes 69(5):696\u2013729. http:\/\/www.arxiv.org\/abs\/math.FA\/0009128","DOI":"10.1023\/A:1010266012029"},{"key":"1027_CR31","unstructured":"Litvinov GL, Rodionov AYa, Tchourkin AV (2008) Approximate rational arithmetics and arbitrary precision computations for universal algorithms. Int J Pure Appl Math 45(2):193\u2013204. http:\/\/www.arxiv.org\/abs\/math.NA\/0101152"},{"key":"1027_CR28","doi-asserted-by":"crossref","unstructured":"Litvinov GL, Maslov VP, Rodionov AYa, Sobolevski\u012d AN (2011) Universal algorithms, mathematics of semirings and parallel computations. Lect Notes Comput Sci Eng 75:63\u201389. http:\/\/www.arxiv.org\/abs\/1005.1252","DOI":"10.1007\/978-3-642-14941-2_4"},{"key":"1027_CR36","volume-title":"Object oriented software: a practical guide","author":"M. Lorenz","year":"1993","unstructured":"Lorenz M (1993) Object oriented software: a practical guide. Prentice Hall Books, Englewood Cliffs, N.J."},{"issue":"1","key":"1027_CR37","first-page":"29","volume":"42","author":"V.P. Maslov","year":"1987","unstructured":"Maslov VP (1987a) A new approach to generalized solutions of nonlinear systems. Soviet Math Dokl 42(1):29\u201333","journal-title":"Soviet Math. Dokl."},{"issue":"3","key":"1027_CR38","first-page":"39","volume":"42","author":"V.P. Maslov","year":"1987","unstructured":"Maslov VP (1987b) On a new superposition principle for optimization process. Uspekhi Math Nauk [Russian Math Surveys] 42(3):39\u201348","journal-title":"Uspekhi Math Nauk [Russian Math. Surveys]"},{"key":"1027_CR39","unstructured":"Mikhalkin G (2006) Tropical geometry and its applications. In: Proc ICM 2:827\u2013852. http:\/\/www.arxiv.org\/abs\/math.AG\/0601041"},{"key":"1027_CR40","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970906","volume-title":"Methods and applications of interval analysis. SIAM Studies in Applied Mathematics","author":"R.E. Moore","year":"1979","unstructured":"Moore RE (1979) Methods and applications of interval analysis. SIAM Studies in Applied Mathematics. SIAM, Philadelphia"},{"key":"1027_CR41","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.laa.2005.02.011","volume":"403","author":"H. My\u0161kova","year":"2005","unstructured":"My\u0161kova H (2005) Interval systems of max-separable linear equations. Linear Alg Appl 403:263\u2013272","journal-title":"Linear Alg. Appl."},{"key":"1027_CR42","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.laa.2005.11.008","volume":"416","author":"H. My\u0161kova","year":"2006","unstructured":"My\u0161kova H (2006) Control solvability of interval systems of max-separable linear equations. Linear Alg Appl 416:215\u2013223","journal-title":"Linear Alg. Appl."},{"key":"1027_CR43","volume-title":"Interval methods for systems of equations","author":"A. Neumaier","year":"1990","unstructured":"Neumaier A (1990) Interval methods for systems of equations. Cambridge University Press, Cambridge"},{"key":"1027_CR44","unstructured":"Pohl I. (1997) Object-Oriented Programming Using C++\u00a0, 2nd ed. Addison-Wesley, Reading"},{"key":"1027_CR45","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02253318","volume":"34","author":"G. Rote","year":"1985","unstructured":"Rote G (1985) A systolic array algorithm for the algebraic path problem. Comput Lett 34:191\u2013219","journal-title":"Computing"},{"key":"1027_CR46","unstructured":"Sedgewick R (2002) Algorithms in C++\u00a0. Part 5: graph algorithms, 3rd ed. Addison-Wesley, Reading"},{"key":"1027_CR47","unstructured":"Sergeev S (2011) Universal algorithms for generalized discrete matrix Bellman equations with symmetric Toeplitz matrix. Tambov University Reports, ser. Natural and Technical Sciences 16(6):1751\u20131758. http:\/\/www.arxiv.org\/abs\/math\/0612309"},{"key":"1027_CR48","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BFb0017135","volume":"324","author":"I. Simon","year":"1988","unstructured":"Simon I (1988) Recognizable sets with multiplicities in the tropical semiring. Lect Notes Comput Sci 324:107\u2013120","journal-title":"Lect Notes Comput Sci"},{"key":"1027_CR49","first-page":"431","volume":"60","author":"A.N. Sobolevski\u012d","year":"1999","unstructured":"Sobolevski\u012d AN (1999) Interval arithmetic and linear algebra over idempotent semirings. Dokl Math 60:431\u2013433","journal-title":"Dokl Math"},{"key":"1027_CR50","volume-title":"The standard template library","author":"A. Stepanov","year":"1994","unstructured":"Stepanov A, Lee M (1994) The standard template library. Hewlett-Packard, Palo Alto"},{"key":"1027_CR51","unstructured":"Tchourkin AV, Sergeev SN (2007) Program demonstrating how universal algorithms solve discrete Bellman equation over various semirings. In: Litvinov G, Maslov V, Sergeev S (eds) Idempotent and tropical mathematics and problems of mathematical physics (Volume II), Moscow. French-Russian Laboratory J.V. Poncelet. http:\/\/www.arxiv.org\/abs\/0709.4119"},{"key":"1027_CR52","doi-asserted-by":"crossref","unstructured":"Viro O (2001) Dequantization of real algebraic geometry on logarithmic paper. In: 3rd European Congress of Mathematics: Barcelona, July 10\u201314, 2000. Birkh\u00e4user, Basel, pp 135. http:\/\/www.arxiv.org\/abs\/math\/0005163","DOI":"10.1007\/978-3-0348-8268-2_8"},{"key":"1027_CR53","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11537-008-0832-6","volume":"3","author":"O. Viro","year":"2008","unstructured":"Viro O (2008) From the sixteenth hilbert problem to tropical geometry. Jpn J Math 3:1\u201330","journal-title":"Jpn J Math"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1027-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-013-1027-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1027-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T09:56:29Z","timestamp":1644659789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-013-1027-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,26]]},"references-count":51,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["1027"],"URL":"https:\/\/doi.org\/10.1007\/s00500-013-1027-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,26]]}}}