On the completability of incomplete orthogonal Latin rectangles (Q267209)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the completability of incomplete orthogonal Latin rectangles |
scientific article; zbMATH DE number 6566512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the completability of incomplete orthogonal Latin rectangles |
scientific article; zbMATH DE number 6566512 |
Statements
On the completability of incomplete orthogonal Latin rectangles (English)
0 references
8 April 2016
0 references
2-row Latin rectangle
0 references
orthogonality
0 references
completability
0 references
circuit
0 references
polyhedral combinatorics
0 references
lifted circuit inequality
0 references
0 references
0.8114640712738037
0 references
0.8057309985160828
0 references
0.8031103610992432
0 references
0.8022603392601013
0 references
0.7975081205368042
0 references
