Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays

DOI10.1016/j.disopt.2019.01.001zbMath1474.90276arXiv2104.10517OpenAlexW3156683980WikidataQ128502355 ScholiaQ128502355MaRDI QIDQ2419587

Dursun A. Bulutoglu, Andrew J. Geyer, Kenneth J. Ryan

Publication date: 14 June 2019

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.10517

zbMATH Keywords

orthogonal projection matrixedge colored graphformulation symmetry groupLP relaxation symmetry groupOD-equivalencevertex colored

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Uniform semi-Latin squares and their pairwise-variance aberrations ⋮ Finding the dimension of a non-empty orthogonal array polytope ⋮ Unnamed Item

Uses Software

• GAP
• Matlab
• nauty
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
• Group-theoretic algorithms and graph isomorphism
• Hadamard equivalence via graph isomorphism
• A large index theorem for orthogonal arrays, with bounds
• Pruning by isomorphism in branch-and-cut
• Small covering designs by branch-and-cut
• Exploiting orbits in symmetric ILP
• Algorithms for highly symmetric linear and integer programs
• Practical graph isomorphism. II.
• Symmetric ILP: Coloring and small integers
• Classification of orthogonal arrays by integer programming
• Enumeration of MOLS of small order
• Computing symmetry groups of polyhedra
• The LP Relaxation Orthogonal Array Polytope and its Permutation Symmetries
• Constraint Orbital Branching
• Symmetry in Integer Linear Programming
• Isomorph-Free Exhaustive Generation
• Integer Programming for Classifying Orthogonal Arrays
• The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program