Abstract tropical linear programming
  In this paper we develop a combinatorial abstraction of tropical linear programming. This generalizes the search for a feasible point of a system of min-plus-inequalities. It is based on the polyhedral properties of triangulations of the product of two simplices and the combinatorics of the associated set of bipartite graphs with an additional sign information which we call a signed tropical matroid. We demonstrate the connections with the classical simplex method, mean payoff games and scheduling. 
Georg Loho
math.OC math.CO