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

DOI10.1057/PALGRAVE.JORS.2601655MaRDI QIDQ4661104zbMATH OpenOpenAlexFDO

Authors

Publication date 4 April 2005

Published in The 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

Branch \& Cutinteger programminglinear programmingorthogonal Latin squares

Mathematics Subject Classification ID

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

Recommendations

• On the orthogonal Latin squares polytope
• An algorithm for the planar three-index assignment problem
• Classification of orthogonal arrays by integer programming
• Searching for mutually orthogonal Latin squares via integer and constraint programming
• An Algorithm for the Three-Index Assignment Problem

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4661104)