Before revision:  By this we mean that, instead of listing all solutions , we list, in an efficient way, directly only the equivalence classes or  one representative per class . Besides the need to then provide ana priori relation of equivalence between solutions, we place ourselves in the special context where the problem to be addressed , either after some preliminary polynomial time dynamic programming computation or directly from the start, leads to a decomposable tropical circuit .
After revision:  By this we mean that, instead of listing all solutions , we list, in an efficient way, directly only the equivalence classes or one representative per class . Besides the need to then provide ana priori (without generating all the solutions), although identified as a need in many areas, has been addressed only for very few specific cases. In this paper, we provide a general framework that solves this problem in polynomial delay for a wide variety of contexts, including optimization ones that can be addressed by dynamic programming algorithms, and for certain types of equivalence relations between solutions .