A strongly polynomial algorithm for solving two-sided linear systems in max-algebra

From MaRDI portal
Publication:2489939

DOI10.1016/j.dam.2005.09.008zbMath1090.68119OpenAlexW2157261308MaRDI QIDQ2489939

Karel Zimmermann, Peter Butkovic

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.09.008




Related Items

TROPICAL POLYHEDRA ARE EQUIVALENT TO MEAN PAYOFF GAMESA uniform synchronization problem over max-plus algebraAE solutions to two-sided interval linear systems over max-plus algebraA note on a paper by E. Khorram and A. GhodousianIdempotent and tropical mathematics; complexity of algorithms and interval analysisOptimization problems under (max, min)-linear equations and/or inequality constraintsLog-Barrier Interior Point Methods Are Not Strongly PolynomialUnnamed ItemUnnamed ItemAbstract tropical linear programmingOn the greatest solutions to weakly linear systems of fuzzy relation inequalities and equationsOn the solution of a two-sided vector equation in tropical algebraComplexity of solving tropical linear systemsWeak dual residuations applied to tropical linear equationsComplete solution of tropical vector inequalities using matrix sparsification.What Tropical Geometry Tells Us about the Complexity of Linear ProgrammingAn algorithm to describe the solution set of any tropical linear system \(A \odot x = B \odot x\)On max-min linear inequalities and coalitional resource games with sharable resourcesHard problems in max-algebra, control theory, hypergraphs and other areasQuantitative simulations by matricesExponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebraAn algorithm for solving two-sided interval system of max-plus linear equations



Cites Work


This page was built for publication: A strongly polynomial algorithm for solving two-sided linear systems in max-algebra