{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T06:03:45Z","timestamp":1775541825677,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"20","license":[{"start":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T00:00:00Z","timestamp":1722816000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T00:00:00Z","timestamp":1722816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s00500-024-09940-4","type":"journal-article","created":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T03:02:19Z","timestamp":1722826939000},"page":"12097-12112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On solution of tropical discrete best approximation problems"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3070-9355","authenticated-orcid":false,"given":"Nikolai","family":"Krivulin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,5]]},"reference":[{"issue":"12","key":"9940_CR1","doi-asserted-by":"publisher","first-page":"3261","DOI":"10.1016\/j.laa.2011.06.009","volume":"435","author":"M Akian","year":"2011","unstructured":"Akian M, Gaubert S, Ni\u0163ic\u0103 V, Singer I (2011) Best approximation in max-plus semimodules. Linear Algebra Appl 435(12):3261\u20133296. https:\/\/doi.org\/10.1016\/j.laa.2011.06.009","journal-title":"Linear Algebra Appl"},{"key":"9940_CR2","doi-asserted-by":"publisher","unstructured":"Anderberg MR (1973) Cluster analysis for applications. In: Probability and mathematical statistics. Academic Press, New York. https:\/\/doi.org\/10.1016\/C2013-0-06161-0","DOI":"10.1016\/C2013-0-06161-0"},{"key":"9940_CR3","doi-asserted-by":"publisher","unstructured":"Butkovi\u010d P (2010) Max-linear systems. In: Springer monographs in mathematics. Springer, London. https:\/\/doi.org\/10.1007\/978-1-84996-299-5","DOI":"10.1007\/978-1-84996-299-5"},{"key":"9940_CR4","doi-asserted-by":"crossref","unstructured":"Cameron SH (1966) Piece-wise linear approximation. Technical note CSTN-106, Computer Sciences Division, IIT Research Institute, Chicago, IL","DOI":"10.21236\/AD0647190"},{"key":"9940_CR5","doi-asserted-by":"publisher","first-page":"876862","DOI":"10.1155\/2015\/876862","volume":"2015","author":"E Camponogara","year":"2015","unstructured":"Camponogara E, Nazari LF (2015) Models and algorithms for optimal piecewise-linear function approximation. Math Probl Eng 2015:876862. https:\/\/doi.org\/10.1155\/2015\/876862","journal-title":"Math Probl Eng"},{"key":"9940_CR6","doi-asserted-by":"publisher","unstructured":"Celikyilmaz A, T\u00fcrksen IB (2009) Modeling uncertainty with fuzzy logic. In: Studies in fuzziness and soft computing, vol 240. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-540-89924-2","DOI":"10.1007\/978-3-540-89924-2"},{"key":"9940_CR7","unstructured":"Conn AR, Li Y (1988) The computational structure and characterization of nonlinear discrete Chebyshev problem. Technical report 88-956, Department of Computer Science, Cornell University, Ithaca, NY"},{"key":"9940_CR8","unstructured":"Dubois DJ, Prade HM (1980) Fuzzy sets and systems. In: Mathematics in science and engineering, vol 144. Academic Press, San Diego"},{"key":"9940_CR9","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/978-3-540-70575-8_57","volume-title":"Automata, languages and programming. Lecture notes in computer science","author":"J Esparza","year":"2008","unstructured":"Esparza J, Gawlitza T, Kiefer S, Seidl H (2008) Approximative methods for monotone systems of min\u2013max-polynomial equations. In: Aceto L, Damg\u00e5rd I, Goldberg LA, Halld\u00f3rsson MM, Ing\u00f3lfsd\u00f3ttir A, Walukiewicz I (eds) Automata, languages and programming. Lecture notes in computer science, vol 5125. Springer, Berlin, pp 698\u2013710. https:\/\/doi.org\/10.1007\/978-3-540-70575-8_57"},{"issue":"8","key":"9940_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/368637.368753","volume":"5","author":"B Gluss","year":"1962","unstructured":"Gluss B (1962) Further remarks on line segment curve-fitting using dynamic programming. Commun ACM 5(8):441\u2013443. https:\/\/doi.org\/10.1145\/368637.368753","journal-title":"Commun ACM"},{"key":"9940_CR11","doi-asserted-by":"publisher","unstructured":"Golan JS (2003) Semirings and affine equations over them. In: Mathematics and its applications, vol 556. Springer, Dordrecht. https:\/\/doi.org\/10.1007\/978-94-017-0383-3","DOI":"10.1007\/978-94-017-0383-3"},{"key":"9940_CR12","doi-asserted-by":"publisher","unstructured":"Gondran M, Minoux M (2008) Graphs, dioids and semirings. In: Operations research\/ computer science interfaces, vol 41. Springer, New York. https:\/\/doi.org\/10.1007\/978-0-387-75450-5","DOI":"10.1007\/978-0-387-75450-5"},{"key":"9940_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-319-99639-4_12","volume-title":"Computer algebra in scientific computing. Lecture notes in computer science","author":"D Grigoriev","year":"2018","unstructured":"Grigoriev D (2018) Tropical Newton\u2013Puiseux polynomials. In: Gerdt VP, Koepf W, Seiler WM, Vorozhtsov EV (eds) Computer algebra in scientific computing. Lecture notes in computer science, vol 11077. Springer, Cham, pp 177\u2013186. https:\/\/doi.org\/10.1007\/978-3-319-99639-4_12"},{"issue":"6","key":"9940_CR14","doi-asserted-by":"publisher","first-page":"2624","DOI":"10.1080\/00927872.2013.766827","volume":"42","author":"D Grigoriev","year":"2014","unstructured":"Grigoriev D, Shpilrain V (2014) Tropical cryptography. Commun Algebra 42(6):2624\u20132632. https:\/\/doi.org\/10.1080\/00927872.2013.766827","journal-title":"Commun Algebra"},{"issue":"10","key":"9940_CR15","doi-asserted-by":"publisher","first-page":"4224","DOI":"10.1080\/00927872.2019.1581213","volume":"47","author":"D Grigoriev","year":"2019","unstructured":"Grigoriev D, Shpilrain V (2019) Tropical cryptography II: extensions by homomorphisms. Commun Algebra 47(10):4224\u20134229. https:\/\/doi.org\/10.1080\/00927872.2019.1581213","journal-title":"Commun Algebra"},{"key":"9940_CR16","volume-title":"Max plus at work. Princeton series in applied mathematics","author":"B Heidergott","year":"2006","unstructured":"Heidergott B, Olsder GJ, van der Woude J (2006) Max plus at work. Princeton series in applied mathematics. Princeton Univ. Press, Princeton"},{"issue":"3","key":"9940_CR17","first-page":"159","volume":"9","author":"H Imai","year":"1986","unstructured":"Imai H, Iri M (1986) An optimal algorithm for approximating a piecewise linear function. J Inf Process 9(3):159\u2013162","journal-title":"J Inf Process"},{"key":"9940_CR18","doi-asserted-by":"publisher","unstructured":"Itenberg I, Mikhalkin G, Shustin E (2007) Tropical algebraic geometry. Oberwolfach seminars, vol 35. Birkh\u00e4user, Basel. https:\/\/doi.org\/10.1007\/978-3-7643-8310-7","DOI":"10.1007\/978-3-7643-8310-7"},{"issue":"3","key":"9940_CR19","first-page":"64","volume":"10","author":"NK Krivulin","year":"2009","unstructured":"Krivulin NK (2009) On solution of a class of linear vector equations in idempotent algebra. Vestnik Sankt-Peterburgskogo Universiteta Seriya 10(3):64\u201377 (in Russian)","journal-title":"Vestnik Sankt-Peterburgskogo Universiteta Seriya"},{"key":"9940_CR20","first-page":"244","volume-title":"Advances in computer science. Recent advances in computer engineering series","author":"N Krivulin","year":"2012","unstructured":"Krivulin N (2012) A solution of a tropical linear vector equation. In: Yenuri S (ed) Advances in computer science. Recent advances in computer engineering series, vol 5. WSEAS Press, Athens, pp 244\u2013249"},{"issue":"1","key":"9940_CR21","first-page":"14","volume":"7","author":"N Krivulin","year":"2013","unstructured":"Krivulin N (2013) Solution of linear equations and inequalities in idempotent vector spaces. Int J Appl Math Inform 7(1):14\u201323","journal-title":"Int J Appl Math Inform"},{"issue":"19","key":"9940_CR22","doi-asserted-by":"publisher","first-page":"2472","DOI":"10.3390\/math9192472","volume":"9","author":"N Krivulin","year":"2021","unstructured":"Krivulin N (2021) Algebraic solution of tropical polynomial optimization problems. Mathematics 9(19):2472. https:\/\/doi.org\/10.3390\/math9192472","journal-title":"Mathematics"},{"issue":"18","key":"9940_CR23","doi-asserted-by":"publisher","first-page":"3949","DOI":"10.3390\/math11183949","volume":"11","author":"N Krivulin","year":"2023","unstructured":"Krivulin N (2023) Algebraic solution of tropical best approximation problems. Mathematics 11(18):3949. https:\/\/doi.org\/10.3390\/math11183949","journal-title":"Mathematics"},{"key":"9940_CR24","unstructured":"Laplace PS (1832) M\u00e9canique C\u00e9leste. Volume 2. Hillard, Gray, Littl\u00e8, and Wilkins, Boston (Engl. transl. with comment. by N.\u00a0Bowditch)"},{"issue":"3","key":"9940_CR25","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF00129876","volume":"1","author":"D Li","year":"1992","unstructured":"Li D (1992) Morphological template decomposition with max-polynomials. J Math Imaging Vis 1(3):215\u2013221. https:\/\/doi.org\/10.1007\/BF00129876","journal-title":"J Math Imaging Vis"},{"key":"9940_CR26","doi-asserted-by":"publisher","unstructured":"Maclagan D, Sturmfels B (2015) Introduction to tropical geometry. In: Graduate studies in mathematics, vol 161. AMS, Providence. https:\/\/doi.org\/10.1090\/gsm\/161","DOI":"10.1090\/gsm\/161"},{"issue":"5","key":"9940_CR27","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1109\/JPROC.2021.3065238","volume":"109","author":"P Maragos","year":"2021","unstructured":"Maragos P, Charisopoulos V, Theodosis E (2021) Tropical geometry and machine learning. Proc IEEE 109(5):728\u2013755. https:\/\/doi.org\/10.1109\/JPROC.2021.3065238","journal-title":"Proc IEEE"},{"issue":"1","key":"9940_CR28","first-page":"79","volume":"68","author":"T Markwig","year":"2010","unstructured":"Markwig T (2010) A field of generalised Puiseux series for tropical geometry. Rend Sem Mat Univ Politec Torino 68(1):79\u201382","journal-title":"Rend Sem Mat Univ Politec Torino"},{"key":"9940_CR29","volume-title":"Fundamentals of approximation theory","author":"HN Mhaskar","year":"2000","unstructured":"Mhaskar HN, Pai DV (2000) Fundamentals of approximation theory. Narosa Publishing House, New Delhi"},{"issue":"2","key":"9940_CR30","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1093\/comjnl\/10.2.172","volume":"10","author":"MR Osborne","year":"1967","unstructured":"Osborne MR, Watson GA (1967) On the best linear Chebyshev approximation. Comput J 10(2):172\u2013177. https:\/\/doi.org\/10.1093\/comjnl\/10.2.172","journal-title":"Comput J"},{"key":"9940_CR31","unstructured":"Saadi O (2021) Zero-sum repeated games: accelerated algorithms and tropical best-approximation. PhD thesis, Institut Polytechnique de Paris"},{"key":"9940_CR32","doi-asserted-by":"publisher","DOI":"10.1201\/9780849333750","volume-title":"Neural networks for applied sciences and engineering","author":"S Samarasinghe","year":"2006","unstructured":"Samarasinghe S (2006) Neural networks for applied sciences and engineering. Auerbach Publ., New York. https:\/\/doi.org\/10.1201\/9780849333750"},{"key":"9940_CR33","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0079-7421(10)53006-8","volume-title":"The psychology of learning and motivation. Psychology of learning and motivation","author":"CD Schunn","year":"2010","unstructured":"Schunn CD (2010) From uncertainly exact to certainly vague: epistemic uncertainty and approximation in science and engineering problem solving. In: Ross BH (ed) The psychology of learning and motivation. Psychology of learning and motivation, vol 53. Academic Press, San Diego, pp 227\u2013252. https:\/\/doi.org\/10.1016\/S0079-7421(10)53006-8"},{"key":"9940_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/0-8176-4475-X","volume-title":"The history of approximation theory","author":"K-G Steffens","year":"2006","unstructured":"Steffens K-G (2006) The history of approximation theory. Birkh\u00e4user, Boston. https:\/\/doi.org\/10.1007\/0-8176-4475-X"},{"key":"9940_CR35","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1090\/S0025-5718-1961-0119390-6","volume":"15","author":"H Stone","year":"1961","unstructured":"Stone H (1961) Approximation of curves by line segments. Math Comput 15:40\u201347. https:\/\/doi.org\/10.1090\/S0025-5718-1961-0119390-6","journal-title":"Math Comput"},{"issue":"5","key":"9940_CR36","doi-asserted-by":"publisher","first-page":"2584","DOI":"10.1137\/090769077","volume":"32","author":"EK Szusz","year":"2010","unstructured":"Szusz EK, Willms AR (2010) A linear time algorithm for near minimax continuous piecewise linear representations of discrete data. SIAM J Sci Comput 32(5):2584\u20132602. https:\/\/doi.org\/10.1137\/090769077","journal-title":"SIAM J Sci Comput"},{"issue":"5","key":"9940_CR37","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1080\/02331930801954698","volume":"59","author":"A Tharwat","year":"2010","unstructured":"Tharwat A, Zimmermann K (2010) One class of separable optimization problems: solution method, application. Optimization 59(5):619\u2013625. https:\/\/doi.org\/10.1080\/02331930801954698","journal-title":"Optimization"},{"issue":"4","key":"9940_CR38","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/T-C.1974.223961","volume":"23","author":"I Tomek","year":"1974","unstructured":"Tomek I (1974) Two algorithms for piecewise-linear continuous approximation of functions of one variable. IEEE Trans Comput 23(4):445\u2013448. https:\/\/doi.org\/10.1109\/T-C.1974.223961","journal-title":"IEEE Trans Comput"},{"issue":"301","key":"9940_CR39","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward Jr","year":"1963","unstructured":"Ward JH Jr (1963) Hierarchical grouping to optimize an objective function. J Am Stat Assoc 58(301):236\u2013244. https:\/\/doi.org\/10.1080\/01621459.1963.10500845","journal-title":"J Am Stat Assoc"},{"issue":"3","key":"9940_CR40","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1145\/362052.362056","volume":"13","author":"GA Watson","year":"1970","unstructured":"Watson GA (1970) On an algorithm for nonlinear minimax approximation. Commun ACM 13(3):160\u2013162. https:\/\/doi.org\/10.1145\/362052.362056","journal-title":"Commun ACM"},{"key":"9940_CR41","unstructured":"Zhang L, Naitzat G, Lim L-H (2018) Tropical geometry of deep neural networks. In: Dy J, Krause A (eds) Proceedings of the 35th international conference on machine learning. Proceedings of machine learning research, vol 80, pp 5824\u2013 5832. PMLR, Cambridge, MA"},{"key":"9940_CR42","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S0304-0208(08)72967-0","volume-title":"Algebraic and combinatorial methods in operations research. North-Holland mathematics studies","author":"K Zimmermann","year":"1984","unstructured":"Zimmermann K (1984) On max-separable optimization problems. In: Burkard RE, Cuninghame-Green RA, Zimmermann U (eds) Algebraic and combinatorial methods in operations research. North-Holland mathematics studies, vol 95. North-Holland, Amsterdam, pp 357\u2013362. https:\/\/doi.org\/10.1016\/S0304-0208(08)72967-0"},{"issue":"1","key":"9940_CR43","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0304-3975(02)00231-1","volume":"293","author":"K Zimmermann","year":"2003","unstructured":"Zimmermann K (2003) Disjunctive optimization, max-separable problems and extremal algebras. Theoret Comput Sci 293(1):45\u201354. https:\/\/doi.org\/10.1016\/S0304-3975(02)00231-1","journal-title":"Theoret Comput Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09940-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-024-09940-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09940-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:08:08Z","timestamp":1729631288000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-024-09940-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,5]]},"references-count":43,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["9940"],"URL":"https:\/\/doi.org\/10.1007\/s00500-024-09940-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4228791\/v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,5]]},"assertion":[{"value":"17 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that he has no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by the author.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}