Proven optimally-balanced Latin rectangles with SAT (bibtex)
by ,
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.), 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.Note: to appear
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},
  note      = {to appear},
  keywords  ={reveal,strides}, 
}
Powered by bibtexbrowser