DocumentCode
2065761
Title
A new algorithm for solving the quasi group completion problem
Author
Srikumar, M.
fYear
2011
fDate
14-16 Sept. 2011
Firstpage
1
Lastpage
4
Abstract
Different search strategies, like Boolean satisfiability (SAT), constraint programming (CP), and integer programming (IP) have been developed to solve classes of combinatorial search problems like the quasi-group completion problem (QCP). This paper proposes a new effective algorithm developed for solving the classic QCP - the Latin-square completion problem. The method is demonstrated by solving some typical Latin-square completion problems and ways to improve upon the algorithm are discussed.
Keywords
computational complexity; search problems; Boolean satisfiability; Latin-square completion problem; NP-complete problem; combinatorial search problem; constraint programming; integer programming; quasi group completion problem; Artificial intelligence; Cognition; Filtering; Mathematics; Presses; Programming; Search problems; Latin-squares; Quasi-group completion problem; backtrack search procedure; combinatorial search;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on
Conference_Location
Xi´an
Print_ISBN
978-1-4577-0893-0
Type
conf
DOI
10.1109/ICSPCC.2011.6061650
Filename
6061650
Link To Document