Constructing difference families through an optimization approach: Six new BIBDs

DOI<261::AID-JCD4>3.0.CO;2-U 10.1002/1520-6610(2000)8:4<261::AID-JCD4>3.0.CO;2-UzbMath0954.05005OpenAlexW1977676868MaRDI QIDQ4500696

Luis B. Morales

Publication date: 29 January 2001

Full work available at URL: https://doi.org/10.1002/1520-6610(2000)8:4<261::aid-jcd4>3.0.co;2-u

zbMATH Keywords

combinatorial optimizationtabu searchbalanced incomplete block designdifference family

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial optimization (90C27) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Related Items

Balanced incomplete block designs with block size 9. II. ⋮ Cyclic \((v;r,s;\lambda)\) difference families with two base blocks and \(v \leq 50\) ⋮ A mathematical programming approach to the construction of BIBDs ⋮ Genetic algorithms for the construction of Hadamard matrices with two circulant cores ⋮ Constructing 1-rotational NRDFs through an optimization approach: new (46,9,8), (51,10,9) and (55,9,8)-NRBDs ⋮ Existence question for difference families and construction of some new families

Cites Work

• Unnamed Item
• On sets of three mols with holes
• A family of resolvable regular graph designs
• Scheduling a Bridge Club (A Case Study in Discrete Optimization)
• Tabu Search—Part I
• Scheduling a Bridge Club Using a Genetic Algorithm
• Scheduling a Bridge Club by Tabu Search
• ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS

This page was built for publication: Constructing difference families through an optimization approach: Six new BIBDs