with-∞ and∞) and provide a polynomial time algorithm for computing least solutions. For
systems of equations with addition and least upper bounds, this algorithm is a smooth
generalization of the Bellman-Ford algorithm for computing the single source shortest path
in presence of positive and negative edge weights. The method then is extended to deal
with more general forms of operations as well as minima with constants. For the latter, a …