scispace - formally typeset
Journal ArticleDOI

Linear Integer Programming Approach to Construction of Balanced Incomplete Block Designs

TLDR
This article proposes a linear integer programming-based algorithm to construct balanced incomplete block designs and demonstrates that the proposed algorithm is competitive with the existing algorithms.
Abstract
This article proposes a linear integer programming-based algorithm to construct balanced incomplete block designs. Working of the algorithm is illustrated with the help of an example. The algorithm is able to generate balanced incomplete block designs very fast in most of the cases. The performance of the proposed algorithm is compared with other algorithms proposed in the literature. It is demonstrated that the proposed algorithm is competitive with the existing algorithms.

read more

Citations
More filters
Proceedings ArticleDOI

Condor: Better Topologies Through Declarative Design

TL;DR: Condor allows architects to express their requirements as constraints via a Topology Description Language (TDL), rather than having to directly specify network structures, and uses constraint-based synthesis to rapidly generate candidate topologies, which can be analyzed against multiple criteria.
Journal ArticleDOI

Balanced treatment incomplete block designs through integer programming

TL;DR: In this paper, a linear integer programming approach is used to construct balanced treatment incomplete block (BTIB) designs using a linear programming approach and a list of efficient BTIB designs is provided.
Journal ArticleDOI

Efficient Incomplete Block Designs Through Linear Integer Programming

TL;DR: In this paper, a linear integer programming approach is presented to construct efficient binary incomplete block designs for any given number of treatments v, number of blocks b, with common block-size k, and with a nearly balanced concurrence matrix.
References
More filters
Book

Handbook of Combinatorial Designs

TL;DR: In this paper, the authors present a design theory of small-block designs of small order for the first time in the last half of the 20th century, starting from the design of the first block designs in the early 1950s.
Journal ArticleDOI

Balanced incomplete block designs and related designs

TL;DR: The read would be well advised to have knowledge of primWe roots and residua classes modultb primes, as well as of finite Gcllois ficlde5, necessary to understand the problems of inequality in this paper.
Book

Combinatorial Algorithms: Generation, Enumeration, and Search

TL;DR: Theoretical Development A Reduced Basis Algorithm Solving Systems of Integer Equations The Merkle-Hellman Knapsack System Bibliography Algorithm Index Problem Index Index.