IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v173y2006i2p519-530.html
   My bibliography  Save this article

Searching for Mutually Orthogonal Latin Squares via integer and constraint programming

Author

Listed:
  • Appa, G.
  • Magos, D.
  • Mourtos, I.

Abstract

No abstract is available for this item.

Suggested Citation

  • Appa, G. & Magos, D. & Mourtos, I., 2006. "Searching for Mutually Orthogonal Latin Squares via integer and constraint programming," European Journal of Operational Research, Elsevier, vol. 173(2), pages 519-530, September.
    • Handle: RePEc:eee:ejores:v:173:y:2006:i:2:p:519-530
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00198-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. G Appa & D Magos & I Mourtos, 2004. "A Branch & Cut algorithm for a four-index assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 298-307, March.
    2. Alexander Bockmayr & Thomas Kasper, 1998. "Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 10(3), pages 287-300, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vieira Jr., Hélcio & Sanchez, Susan & Kienitz, Karl Heinz & Belderrain, Mischel Carmen Neyra, 2011. "Generating and improving orthogonal designs by using mixed integer programming," European Journal of Operational Research, Elsevier, vol. 215(3), pages 629-638, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vipul Jain & Ignacio E. Grossmann, 2001. "Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 258-276, November.
    2. David Pisinger & Mikkel Sigurd, 2007. "Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 36-51, February.
    3. Tsoukias, Alexis, 2008. "From decision theory to decision aiding methodology," European Journal of Operational Research, Elsevier, vol. 187(1), pages 138-161, May.
    4. John N. Hooker, 2002. "Logic, Optimization, and Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 295-321, November.
    5. Tallys Yunes & Ionuţ D. Aron & J. N. Hooker, 2010. "An Integrated Solver for Optimization Problems," Operations Research, INFORMS, vol. 58(2), pages 342-356, April.
    6. Yannis Pavlis & Will Recker, 2009. "A Mathematical Logic Approach for the Transformation of the Linear Conditional Piecewise Functions of Dispersion-and-Store and Cell Transmission Traffic Flow Models into Linear Mixed-Integer Form," Transportation Science, INFORMS, vol. 43(1), pages 98-116, February.
    7. Pascal Van Hentenryck, 2002. "Constraint and Integer Programming in OPL," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 345-372, November.
    8. Brailsford, Sally C. & Potts, Chris N. & Smith, Barbara M., 1999. "Constraint satisfaction problems: Algorithms and applications," European Journal of Operational Research, Elsevier, vol. 119(3), pages 557-581, December.
    9. L. Foulds & B. Toklu & J. Wilson, 2009. "Modelling either-or relations in integer programming," Annals of Operations Research, Springer, vol. 166(1), pages 203-222, February.
    10. Michela Milano & Greger Ottosson & Philippe Refalo & Erlendur S. Thorsteinsson, 2002. "The Role of Integer Programming Techniques in Constraint Programming's Global Constraints," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 387-402, November.
    11. Zhang, Abraham & Luo, Hao & Huang, George Q., 2013. "A bi-objective model for supply chain design of dispersed manufacturing in China," International Journal of Production Economics, Elsevier, vol. 146(1), pages 48-58.
    12. G Zhu & J F Bard & G Yu, 2005. "Disruption management for resource-constrained project scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 365-381, April.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:173:y:2006:i:2:p:519-530. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.