Abstract

Three classes of necessary conditions for completing partial latin squares are studied. These condition classes are derived via network flow theory, bipartite graph matching theory and by relating the completion problem to triply stochastic matrices. The latter formulation suggest an integer programming model of the completion problem which is convenient for analyzing the relative strength of the three condition classes. It is shown that these classes are nested and examples are given to demonstrate that this nesting is proper.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.