IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-0-387-32942-0_4.html
   My bibliography  Save this book chapter

Modelling for Feasibility - the Case of Mutually Orthogonal Latin Squares Problem

In: Handbook on Modelling for Discrete Optimization

Author

Listed:
  • Gautam Appa

    (London School of Economics)

  • Dimitris Magos

    (Technological Educational Institute of Athens)

  • Ioannis Mourtos

    (University of Patras)

  • Leonidas Pitsoulis

    (Aristotle University of Thessaloniki)

Abstract

In this chapter we present various equivalent formulations or models for the Mutually Orthogonal Latin Squares (MOLS) problem and its generalization. The most interesting feature of the problem is that for some parameters the problem may be infeasible. Our evaluation of different formulations is geared to tackling this feasibility problem. Starting from a Constraint Programming (CP) formulation which emanates naturally from the problem definition, we develop several Integer Programming (IP) formulations. We also discuss a hybrid CP-IP approach in both modelling and algorithmic terms. A non-linear programming formulation and an interesting modelling approach based on the intersection of matroids are also considered.

Suggested Citation

  • Gautam Appa & Dimitris Magos & Ioannis Mourtos & Leonidas Pitsoulis, 2006. "Modelling for Feasibility - the Case of Mutually Orthogonal Latin Squares Problem," International Series in Operations Research & Management Science, in: Gautam Appa & Leonidas Pitsoulis & H. Paul Williams (ed.), Handbook on Modelling for Discrete Optimization, chapter 0, pages 103-127, Springer.
    • Handle: RePEc:spr:isochp:978-0-387-32942-0_4
    DOI: 10.1007/0-387-32942-0_4
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:isochp:978-0-387-32942-0_4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.