Library Header Image
LSE Research Online LSE Library Services

A branch and cut algorithm for a four-index assignment problem

Appa, Gautam, Magos, D. and Mourtos, Ioannis (2004) A branch and cut algorithm for a four-index assignment problem. Journal of the Operational Research Society, 55 (3). pp. 298-307. ISSN 0160-5682

Full text not available from this repository.
Identification Number: 10.1057/palgrave.jors.2601655


In this paper, we examine the orthogonal Latin squares (OLS) problem from an integer programming perspective. The OLS problem has a long history and its significance arises from both theoretical aspects and practical applications. The problem is formulated as a four-index assignment problem whose solutions correspond to OLS. This relationship is exploited by various routines (preliminary variable fixing, branching, etc) of the Branch & Cut algorithm we present. Clique, odd-hole and antiweb inequalities implement the 'Cut' component of the algorithm. For each cut type a polynomial-time separation algorithm is implemented. Extensive computational analysis examines multiple aspects concerning the design of our algorithm. The results illustrate clearly the improvement achieved over simple Branch & Bound.

Item Type: Article
Official URL:
Additional Information: © 2004 Operational Research Society
Divisions: Management
Subjects: Q Science > QA Mathematics
Date Deposited: 08 Sep 2008 13:31
Last Modified: 16 May 2024 00:14

Actions (login required)

View Item View Item