Integer and Constraint programming methods for mutually Orthogonal Latin Squares
This thesis examines the Orthogonal Latin Squares (OLS) problem from the viewpoint of Integer and Constraint programming. An Integer Programming (IP) model is proposed and the associated polytope is analysed. We identify several families of strong valid inequalities, namely inequalities arising from...
| Main Author: | |
|---|---|
| Published: |
London School of Economics and Political Science (University of London)
2003
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.401693 |