Searching for Mutually Orthogonal Latin Squares via integer and constraint programming [An article from: European Journal of Operational Research] | ![Searching for Mutually Orthogonal Latin Squares via integer and constraint programming [An article from: European Journal of Operational Research]](http://ecx.images-amazon.com/images/I/51G4P0G7AGL._SL160_.jpg)
 enlarge | Authors: G. Appa, D. Magos, I. Mourtos
Publisher: Elsevier
Category: Book
Buy New: $7.95
Format: Html
Media: Digital
Pages: 11
Publication Date: September 1, 2006
Availability: Available for download now
| |
| Editorial Reviews:
Product Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
This paper applies algorithms integrating Integer Programming (IP) and Constraint Programming (CP) to the Mutually Orthogonal Latin Squares (MOLS) problem. We investigate the behaviour of these algorithms against traditional IP and CP schemes. Computational results are obtained with respect to various aspects of the algorithms, using instances of the 2 MOLS and 3 MOLS problems. The benefits of integrating IP with CP on this feasibility problem are clearly exhibited, especially in large problem instances.
|
|
|
