A mathematical programming approach to the construction of BIBDs (Q2995501): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4338936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4872040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There is no 2-(22, 8, 4) block design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4680350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3411976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Existence and Construction of Balanced Incomplete Block Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced incomplete block designs and related designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: There is no (46, 6, 1) block design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural network parallel computing for BIBD problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing difference families through an optimization approach: Six new BIBDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4424860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Designs / rank
 
Normal rank

Latest revision as of 00:26, 4 July 2024

scientific article
Language Label Description Also known as
English
A mathematical programming approach to the construction of BIBDs
scientific article

    Statements

    A mathematical programming approach to the construction of BIBDs (English)
    0 references
    0 references
    0 references
    21 April 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    BIBD
    0 references
    MIP problem
    0 references
    branch-and-bound method
    0 references
    tabu search
    0 references
    0 references