Searching for mutually orthogonal Latin squares via integer and constraint programming (Q2496074)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5038011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Searching for mutually orthogonal Latin squares via integer and constraint programming |
scientific article; zbMATH DE number 5038011 |
Statements
Searching for mutually orthogonal Latin squares via integer and constraint programming (English)
0 references
30 June 2006
0 references
constraint satisfaction
0 references
integer programming
0 references
mutually orthogonal Latin squares
0 references
0 references
0 references
0 references
0.7322442531585693
0 references
0.7285692691802979
0 references
0.7283262610435486
0 references
0.7276462912559509
0 references
