Finding the dimension of a non-empty orthogonal array polytope

DOI10.1016/J.DISOPT.2022.100727MaRDI QIDQ2172088zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Hilbert bases for orthogonal arrays
• Integer programming for classifying orthogonal arrays
• On the orthogonal Latin squares polytope
• The LP relaxation orthogonal array polytope and its permutation symmetries
• The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program

Cites work

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

Cited in

(1)

• Finding the dimension of a non-empty orthogonal array polytope

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172088)