Universal algorithms for solving the matrix Bellman equations over semirings

@article{Litvinov2013UniversalAF,
  title={Universal algorithms for solving the matrix Bellman equations over semirings},
  author={G. Litvinov and A. Rodionov and S. Sergeev and A. Sobolevski},
  journal={Soft Computing},
  year={2013},
  volume={17},
  pages={1767-1785}
}
This paper is a survey on universal algorithms for solving the matrix Bellman equations over semirings and especially tropical and idempotent semirings. However, original algorithms are also presented. Some applications and software implementations are discussed. 
10 Citations
Path algebra algorithm for finding longest increasing subsequence
  • PDF
Ideal basis in constructions defined by directed graphs
  • PDF
Idempotent and tropical mathematics; complexity of algorithms and interval analysis
  • G. Litvinov
  • Computer Science, Mathematics
  • Comput. Math. Appl.
  • 2013
  • 4
  • PDF
Newtonian Program Analysis via Tensor Product
  • 10
  • PDF

References

SHOWING 1-10 OF 92 REFERENCES
Interval systems over idempotent semiring
  • 34
  • PDF
Universal numerical algorithms and their software implementation
  • 22
  • PDF
Z-matrix equations in max algebra, nonnegative linear algebra and other semirings
  • 9
  • Highly Influential
  • PDF
Interval methods for systems of equations
  • 2,274
  • Highly Influential
Idempotent Analysis and Its Applications
  • 377
  • Highly Influential
  • PDF
Regular Algebra Applied to Path-finding Problems
  • 162
Recognizable Sets with Multiplicities in the Tropical Semiring
  • 153
...
1
2
3
4
5
...