A reactive tabu search algorithm with variable clustering for the unicost sec Covering problem (Q1000167)

From MaRDI portal
Revision as of 15:44, 10 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A reactive tabu search algorithm with variable clustering for the unicost sec Covering problem
scientific article

    Statements

    A reactive tabu search algorithm with variable clustering for the unicost sec Covering problem (English)
    0 references
    0 references
    0 references
    0 references
    5 February 2009
    0 references
    0 references