Pages that link to "Item:Q2496074"
From MaRDI portal
The following pages link to Searching for mutually orthogonal Latin squares via integer and constraint programming (Q2496074):
Displaying 8 items.
- Generating and improving orthogonal designs by using mixed integer programming (Q420882) (← links)
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem (Q525111) (← links)
- An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6. (Q703240) (← links)
- On the orthogonal Latin squares polytope (Q819807) (← links)
- Clique facets of the axial and planar assignment polytopes (Q1040085) (← links)
- A Branch & Cut algorithm for a four-index assignment problem (Q4661104) (← links)
- Integer Programming for Classifying Orthogonal Arrays (Q5374250) (← links)
- (Q5494214) (← links)