Proven optimally-balanced Latin rectangles with SAT

Ramaswamy, Vaidyanathan Peruvemba; Szeider, Stefan

doi:10.4230/LIPICS.CP.2023.48

by Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider

Reference:

Proven optimally-balanced Latin rectangles with SATVaidyanathan Peruvemba Ramaswamy, Stefan SzeiderProceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap, ed.), volume 280 of LIPIcs, pages 48:1–48:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Bibtex Entry:

@string{lipics="LIPIcs"}
@InProceedings{VaidyanathanSzeider23,
  author    = {Vaidyanathan Peruvemba Ramaswamy and Stefan Szeider},
  title        = {Proven optimally-balanced Latin rectangles with {SAT}},
    booktitle = {Proceedings of CP 2023, the 29th International
                  Conference on Principles and Practice of Constraint
                  Programming},
  year      = {2023},
  editor    = {Roland Yap},
  series    = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume       = {280},
  pages        = {48:1--48:10},
  url          = {https://doi.org/10.4230/LIPIcs.CP.2023.48},
  doi          = {10.4230/LIPICS.CP.2023.48},
  keywords  ={reveal,strides}, 
}