A mathematical programming approach to the construction of BIBDs

DOI10.1080/00207160.2010.492869zbMath1216.90062OpenAlexW2156400955MaRDI QIDQ2995501

Daisuke Yokoya, Takeo Yamada

Publication date: 21 April 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2010.492869

zbMATH Keywords

tabu searchBIBDbranch-and-bound methodMIP problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial aspects of block designs (05B05)

Related Items

Balanced treatment incomplete block designs through integer programming ⋮ Generating and improving orthogonal designs by using mixed integer programming ⋮ Optimal multi-level supersaturated designs through integer programming ⋮ Memetic collaborative approaches for finding balanced incomplete block designs ⋮ Linear Integer Programming Approach to Construction of Balanced Incomplete Block Designs

Uses Software

• Tabu search

Cites Work

• Balanced incomplete block designs and related designs
• There is no (46, 6, 1) block design
• The Existence and Construction of Balanced Incomplete Block Designs
• There is no 2-(22, 8, 4) block design
• Neural network parallel computing for BIBD problems
• Combinatorial Designs
• Constructing difference families through an optimization approach: Six new BIBDs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item