Department of
Computer Science
695 Park Ave.
NY, NY 10021

 

Susan L. Epstein

The CUNY Graduate School, Department of Computer Science and

 Hunter College, Department of Computer Science

 

 

 

 

 

     Home 
     Publications 
     Collaborators 
     Courses 
     Contact

 

 

 

 

 

QUASI-GROUP PROBLEMS (CSP)

 

A quasigroup (or Latin square) problem of order n seeks to place n different symbols in an n ´ n table such that each symbol occurs exactly once in each  row and exactly once in each column. A quasigroup with holes has p% of its entries (the “non-holes”) already specified. A balanced quasigroup with holes distributes those entries evenly across the rows and columns of the table. A quasigroup problem here is balanced, with p% holes, and is described here as <n, p>.

 

PROBLEM CLASS # PROBLEMS VISITED NODES CONSTRAINT CHECKS RECCOMMENDED ADVISORS
4-4
100
16.00
48.00
  
4-5
100
 16.00 50.04  
4-6
100
 16.00 53.76  
4-7
100
 16.00 57.70  
4-8
100
 16.00 65.03  
4-9
100
 16.00 81.76  
4-10
100
 16.00 102.33  
4-11
100
 16.00 128.15  
4-12
100
 16.00 167.45  
4-13
100
 16.00 254.38  
4-14
100
 16.02 378.46  
5-7
100
 25.00 104.08  
5-12
100
 25.00 157.66  
5-14
100
 25.00 207.72  
5-15
100
 25.06 290.96  
5-16
100
 25.23 375.04  
5-17
100
 25.20 465.07  
5-18
100
 25.20 465.07  
5-20
100
 25.17 730.82  
5-22
100
 25.03 1231.27  
5-23
100
 25.01 1526.24  
10-46
100
 100.48 2376.23  
10-53
100
 115.72 4907.63  
10-67
100
 1646.44 137825.00  
10-74
100
 868.66 77343.74  
10-81
100
 474.29 53756.24  
10-89
100
 143.65 45790.18  
10-96
100
 104.66 64019.47  
         
         
         

[top of the page]

Home