A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem (Q4656683)

From MaRDI portal
Revision as of 00:34, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2144425
Language Label Description Also known as
English
A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
scientific article; zbMATH DE number 2144425

    Statements

    A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem (English)
    0 references
    0 references
    14 March 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimisation
    0 references
    greedy method
    0 references
    heuristics
    0 references
    set covering problem
    0 references
    0 references