Eliminating redundant solutions of some symmetric combinatorial integer programs

This work presents a way to eliminate redundant solutions (due to geometrical symmetries) of linear integer programs by adding appropriate inequalities to a given formulation. In some of the examples considered, this approach leads to an impressive reduction of the search tree of enumerative algorithms.