In Search of Balance: The Challenge of Generating Balanced Latin Rectangles

  title={In Search of Balance: The Challenge of Generating Balanced Latin Rectangles},
  author={Mateo D{\'i}az and Ronan Le Bras and Carla P. Gomes},
Spatially Balanced Latin Squares are combinatorial structures of great importance for experimental design. From a computational perspective they present a challenging problem and there is a need for efficient methods to generate them. Motivated by a real-world application, we consider a natural extension to this problem, balanced Latin Rectangles. Balanced Latin Rectangles appear to be even more defiant than balanced Latin Squares, to such an extent that perfect balance may not be feasible for… 



The Challenge of Generating Spatially Balanced Scientific Experiment Designs

The development of the theory and construction of combinatorial designs originated with the work of Euler on Latin squares, and several interesting research questions posed by Euler with respect to Latin squares were only solved in 1959.

Streamlining Local Search for Spatially Balanced Latin Squares

This work uses so-called spatially balanced Latin squares to show how streamlining can also be very effective for local search, and believes that streamlined local search is a general technique suitable for solving a wide range of hard combinatorial design problems.

From Streamlined Combinatorial Search to Efficient Constructive Procedures

This work proposes an approach that integrates specialized combinatorial search, using so-called streamlining, with a human computation component, and discovers two complementary efficient constructions for generatingSo-called Spatially Balanced Latin squares of any order N, such that 2N+1 is prime.

Handbook of Constraint Programming

Symmetry Breaking in Constraint Programming

This work describes a method for symmetry breaking during search (SBDS) in constraint programming that guarantees to return a unique solution from each set of symmetrically equivalent ones, which is the one found first by the variable and value ordering heuristics.

Model Counting: A New Strategy for Obtaining Good Bounds

This work presents a new approach to model counting that is based on adding a carefully chosen number of so-called streamlining constraints to the input formula in order to cut down the size of its solution space in a controlled manner.

Symmetry Breaking

This work presents an approach that detects symmetric choice points during the search and enables the user to find solutions for complex problems with minimal effort spent on modeling.

Counting CSP Solutions Using Generalized XOR Constraints

This work presents a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision, and applies an XOR or parity constraint based method introduced previously for Boolean satisfiability problems.

Short XORs for Model Counting: From Theory to Practice

Experimental evidence is presented that for structured problem domains, very short XOR constraints can lead to probabilistic variance as low as large XOR constraint constraints, and thus provide the same correctness guarantees.

Low-density Parity Constraints for Hashing-Based Discrete Integration

This work proposes the use of low-density parity constraints to make inference more tractable in practice and shows that such sparse constraints belong to a new class of hash functions that are called Average Universal, which continue to provide provable accuracy guarantees.