We will discuss mechanisms for dealing with integer programs that contain a great deal of symmetry. The methods use information encoded in the symmetry group of the integer program to guide the branching decision and prune nodes of the search tree. We will discuss orbital branching, isomorphism pruning, and new flexible variants of isomorphism pruning. Some of these methods have been recently incorporated into commercial IP software. We will conclude with a brief discussion of powerful computing platforms known as computational grids and instances of using these platforms for solving symmetric integer programs.