Pages that link to "Item:Q4661104"
From MaRDI portal
The following pages link to A Branch & Cut algorithm for a four-index assignment problem (Q4661104):
Displaying 4 items.
- Facets of the axial three-index assignment polytope (Q908296) (← links)
- Finding the dimension of a non-empty orthogonal array polytope (Q2172088) (← links)
- Classification of orthogonal arrays by integer programming (Q2475747) (← links)
- Searching for mutually orthogonal Latin squares via integer and constraint programming (Q2496074) (← links)