Related necessary conditions for completing partial latin squares |
| |
| Authors: | Rick Giles T Oyama L.E Trotter |
| |
| Affiliation: | 1. Department of Mathematics, University of Kentucky, Lexington, Kentucky USA;2. Institute for Operations Research, Bonn University, Bonn, West Germany;3. School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New YorkUSA;4. Institute for Operations Research, Bonn University, Bonn, West Germany |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
