Algorithms for Highly Symmetric Linear and Integer Programs
Optimization and Control
2015-07-31 v2 Metric Geometry
Abstract
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.
Cite
@article{arxiv.1012.4941,
title = {Algorithms for Highly Symmetric Linear and Integer Programs},
author = {Richard Bödi and Katrin Herr and Michael Joswig},
journal= {arXiv preprint arXiv:1012.4941},
year = {2015}
}
Comments
21 pages, 1 figure; some references and further comments added, title slightly changed