An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6.
From MaRDI portal
Publication:703240
DOI10.1016/J.ORL.2003.10.010zbMATH Open1052.05018OpenAlexW2072107453MaRDI QIDQ703240FDOQ703240
Authors: 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
Recommendations
Linear programming (90C05) Applications of mathematical programming (90C90) Orthogonal arrays, Latin squares, Room squares (05B15)
Cites Work
- Title not available (Why is that?)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Title not available (Why is that?)
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- Title not available (Why is that?)
- On Latin squares and the facial structure of related polytopes
- Searching for mutually orthogonal Latin squares via integer and constraint programming
- A short proof of the nonexistence of a pair of orthogonal Latin squares of order six
- The Search for a Finite Projective Plane of Order 10
Cited In (3)
This page was built for publication: An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703240)