Skip to main content

Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming - CP 2002 (CP 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2470))

  • 1055 Accesses

Abstract

We consider the problem of Mutually Orthogonal Latin Squares and propose two algorithms which integrate Integer Programming (IP) and Constraint Programming (CP). Their behaviour is examined and compared to traditional CP and IP algorithms. The results assess the quality of inference achieved by the CP and IP, mainly in terms of early identification of infeasible subproblems. It is clearly illustrated that the integration of CP and IP is beneficial and that one hybrid algorithm exhibits the best performance as the problem size grows. An approach for reducing the search by excluding isomorphic cases is also presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Appa G., Magos D., Mourtos I., Janssen J. C. M.: On the Orthogonal Latin Squares polytope. Submitted to Discrete Mathematics (2001). (URL: http://www.cdam.lse.ac.uk/Reports/reports2001.html)

  2. Bockmayr A., Casper T.: Branch and infer: a unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing, 10 (1998) 187–200.

    Article  Google Scholar 

  3. Chandru V., Hooker J. N.: Optimization methods for logical inference. J.Wiley (1999).

    Google Scholar 

  4. Dantzig G. B.: Linear Programming and extensions. Princeton Univ. Press (1963).

    Google Scholar 

  5. Dénes J., Keedwell A. D.: Latin squares and their applications. Acad. Press (1974).

    Google Scholar 

  6. Freuder E. C., Wallace R. J. (ed.): Constraint Programming and Large Scale Discrete Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 57, Amer. Math. Soc (1998).

    Google Scholar 

  7. Gomes C., Shmoys D.: The Promise of LP to Boost CSP Techniques for Combinatorial Problems, CP-AI-OR’02, 291-305, Le Croisic, France (2002).

    Google Scholar 

  8. Hooker J. N., Osorio M. A.: Mixed logical/linear programming. Discrete Applied Mathematics, 9697 (1994) 395–442.

    MathSciNet  Google Scholar 

  9. Hooker J. N.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. J.Wiley (2000).

    Google Scholar 

  10. Laywine C. F., Mullen G. L.: Discrete Mathematics using Latin squares. J.Wiley (1998).

    Google Scholar 

  11. Magos D., Miliotis P.: An algorithm for the planar three-index assignment problem. European Journal of Operational Research 77 (1994) 141–153.

    Article  MATH  Google Scholar 

  12. Nemhauser G. L., Wolsey L. A.: Integer and Combinatorial Optimization. J.Wiley (1988).

    Google Scholar 

  13. Regin J. C.: A filtering algorithm for constraints of difference in CSPs. Proceedings of National Conference on Artificial Intelligence (1994), 362–367.

    Google Scholar 

  14. Savelsbergh M. W. P.: Preprocessing and Probing for Mixed Integer Programming Problems. ORSA J. on Computing, 6 (1994) 445–454.

    Article  MathSciNet  MATH  Google Scholar 

  15. Tsang E.: Foundations of Constraint Satisfaction, Acad. Press (1993).

    Google Scholar 

  16. Dash Associates: XPRESS-MP Version 12, Reference Manual (2001).

    Google Scholar 

  17. Zhang H., Hsiang J.: Solving open quasigroup problems by propositional reasoning, Proc. of International Computer Symposium, Hsinchu, Taiwan (1994).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Appa, G., Mourtos, I., Magos, D. (2002). Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-46135-3_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44120-5

  • Online ISBN: 978-3-540-46135-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics