Finding the dimension of a non-empty orthogonal array polytope

DOI10.1016/J.DISOPT.2022.100727OpenAlexW2971578754MaRDI QIDQ2172088

Dursun A. Bulutoglu

Publication date: 15 September 2022

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

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

zbMATH Keywords

ANOVAmutually orthogonal Latin squares\(J\)-characteristicsassignment polytopeirreducible rational representation

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Combinatorics in computer science (68R05) Ordinary representations and characters (20C15) Analysis of variance and covariance (ANOVA) (62J10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the orthogonal Latin squares polytope
• Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
• Orthogonal arrays. Theory and applications
• A large index theorem for orthogonal arrays, with bounds
• On Latin squares and the facial structure of related polytopes
• Facets of the three-index assignment polytope
• Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
• Results for two-level fractional factorial designs of resolution IV or more
• Symmetric ILP: Coloring and small integers
• Classification of orthogonal arrays by integer programming
• On multi-index assignment polytopes
• Enumeration of MOLS of small order
• Plane Answers to Complex Questions
• On the Assignment Polytope
• Tensor Analysis of ANOVA Decomposition
• A Branch & Cut algorithm for a four-index assignment problem
• Computing Irreducible Representations of Finite Groups
• Integer Programming for Classifying Orthogonal Arrays
• The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program

This page was built for publication: Finding the dimension of a non-empty orthogonal array polytope