New upper bounds for the football pool problem for 6, 7, and 8 matches (Q2277164): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: More coverings by rook domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: The football pool problem for 7 and 8 matches / rank
 
Normal rank
Property / cites work
 
Property / cites work: The football pool problem for 5 matches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The football pool problem for 6 matches: A new upper bound obtained by simulated annealing / rank
 
Normal rank

Latest revision as of 16:12, 21 June 2024

scientific article
Language Label Description Also known as
English
New upper bounds for the football pool problem for 6, 7, and 8 matches
scientific article

    Statements

    New upper bounds for the football pool problem for 6, 7, and 8 matches (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    upper bounds
    0 references
    Hamming distance
    0 references
    approximation algorithm
    0 references
    simulated annealing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references