An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6.

DOI10.1016/j.orl.2003.10.010zbMath1052.05018OpenAlexW2072107453MaRDI QIDQ703240

D. Kharzeev

Publication date: 11 January 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2003.10.010

zbMATH Keywords

Linear programmingOrthogonal Latin squares

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (2)

On the orthogonal Latin squares polytope ⋮ A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short proof of the nonexistence of a pair of orthogonal Latin squares of order six
• On Latin squares and the facial structure of related polytopes
• Searching for mutually orthogonal Latin squares via integer and constraint programming
• Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• The Search for a Finite Projective Plane of Order 10

This page was built for publication: An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6.