A Branch & Cut algorithm for a four-index assignment problem

DOI10.1057/palgrave.jors.2601655zbMath1095.90078OpenAlexW2071104696MaRDI QIDQ4661104

No author found.

Publication date: 4 April 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601655

zbMATH Keywords

linear programminginteger programmingorthogonal Latin squaresBranch \& Cut

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items (4)

Finding the dimension of a non-empty orthogonal array polytope ⋮ Facets of the axial three-index assignment polytope ⋮ Classification of orthogonal arrays by integer programming ⋮ Searching for mutually orthogonal Latin squares via integer and constraint programming

This page was built for publication: A Branch & Cut algorithm for a four-index assignment problem