The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program

DOI10.1112/S1461157016000085zbMath1350.90024arXiv2104.11006OpenAlexW3153801425MaRDI QIDQ5739901

David M. Arquette, Dursun A. Bulutoglu

Publication date: 6 July 2016

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

LP relaxation permutation symmetry group

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items (2)

Finding the dimension of a non-empty orthogonal array polytope ⋮ Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays

Uses Software

• R

Cites Work

• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
• A large index theorem for orthogonal arrays, with bounds
• Small covering designs by branch-and-cut
• Exploiting orbits in symmetric ILP
• Symmetric ILP: Coloring and small integers
• Classification of orthogonal arrays by integer programming
• On multi-index assignment polytopes
• Symmetry in Integer Linear Programming

This page was built for publication: The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program