Symmetry Groups for Linear Programming Relaxations of Orthogonal Array Problems.

摘要

Integer linear programs arise in many situations, and solving such problems can be computationally demanding. One way to solve them more e ciently is by exploiting the symmetry within their formulation. This paper proves that the symmetry group for the linear programming relaxation of 2-level orthogonal array problems of strength 2 is a particular semidirect product.