This paper deals with exploiting symmetry for solving linear and integer
programming problems. Basic properties of linear representations of finite
groups can be used to reduce symmetric linear programming to solving linear
programs of lower dimension. Combining this approach with knowledge of the
geometry of feasible integer solutions yields an algorithm for solving highly
symmetric integer linear programs which only takes time which is linear in the
number of constraints and quadratic in the dimension.Comment: 21 pages, 1 figure; some references and further comments added, title
slightly change