Branch-and-bound is a well-established tool for solving binary programs. If symmetries are present, however, even instances of moderate size may be hard to solve. For this reason, several techniques to handle symmetries have been developed. This thesis reviews existing symmetry handling techniques and develops a problem specific approach to handle symmetries in a graph coloring problem. Afterwards, in the main part of the thesis, two families of 0/1-polytopes are introduced that allow for deriving symmetry handling inequalities for arbitrary applications: symretopes and symresacks. In an extensive polyhedral study, facet defining inequalities and integer programming formulations of symretopes and symresacks are derived that can be used to completely handle symmetries in branch-and-bound. In particular, the derived inequalities are numerically very stable because all their coefficients are either 0 or U+00B11. Moreover, this thesis shows how problem structure can be incorporated into symresacks to find stronger cutting planes in certain applications. The developed techniques have been implemented using the integer programming framework SCIP. An extensive numerical study using benchmarking instances as well as instances that arise in applications demonstrates the effectiveness and competitiveness of the developed techniques.weiterlesen