New algorithms for solving tropical linear systems

The problem of solving tropical linear systems, a natural problem of tropical mathematics, has already proved to be very interesting from the algorithmic point of view: it is known to be in $NP\cap coNP$, but no polynomial time algorithm is known, although counterexamples for existing pseudopolynomial algorithms are (and must be) very complex.
In this work, the study of algorithms for solving tropical linear systems is continued. First, a new reformulation of Grigoriev's algorithm is presented, which brings it closer to the algorithm of Akian, Gaubert, and Guterman; this makes it possible to formulate a whole family of new algorithms, and, for some algorithms in this family, none of the known superpolynomial counterexamples work. Second, a family of algorithms for solving overdetermined tropical systems is presented.
Also, an explicit algorithm is exhibited that can solve a tropical linear system determined by an $(m\times n)$-matrix with maximal element $M$ in time $\Theta\left(\binom mn\mathrm{poly}\left(m,n,\log M\right)\right)$, and this time matches the complexity of the best of previously known algorithms for feasibility testing.