Searching for mutually orthogonal Latin squares via integer and constraint programming

DOI10.1016/J.EJOR.2005.01.048MaRDI QIDQ2496074zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 30 June 2006

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2005.01.048

zbMATH Keywords

constraint satisfactioninteger programmingmutually orthogonal Latin squares

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 5064933
• Constraint programming and operations research
• An example of integrating constraint programming and mathematical programming
• Integrating operations research in constraint programming
• Constraint and integer programming in OPL

Cites work

• A Branch & Cut algorithm for a four-index assignment problem
• A class of facet producing graphs for vertex packing polyhedra
• Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
• Constraint programming and large scale discrete optimization. DIMACS workshop, DIMACS Center, Princeton, NJ, USA, September 14--17, 1998
• Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
• Global optimization using special ordered sets
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 16256 (Why is no real title available?)
• scientific article; zbMATH DE number 1324220 (Why is no real title available?)
• scientific article; zbMATH DE number 2084699 (Why is no real title available?)
• scientific article; zbMATH DE number 1455120 (Why is no real title available?)
• scientific article; zbMATH DE number 1550909 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• Maximal partial spreads in PG(3,4) and maximal sets of mutually orthogonal Latin squares of order 16
• Mixed logical-linear programming
• Mutually orthogonal Latin squares: A brief survey of constructions
• On the facial structure of set packing polyhedra
• On the orthogonal Latin squares polytope
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Principles and Practice of Constraint Programming – CP 2004
• The Search for a Finite Projective Plane of Order 10

Cited in

(10)

• Clique facets of the axial and planar assignment polytopes
• Generating and improving orthogonal designs by using mixed integer programming
• A Branch & Cut algorithm for a four-index assignment problem
• Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
• Integer programming for classifying orthogonal arrays
• scientific article; zbMATH DE number 5064933 (Why is no real title available?)
• Myrvold's results on orthogonal triples of 10 10 Latin squares: a SAT investigation
• Enumerating extended self-orthogonal diagonal Latin squares of order up to 10
• An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6.
• On the orthogonal Latin squares polytope

This page was built for publication: Searching for mutually orthogonal Latin squares via integer and constraint programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496074)