Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees (Q1577774)

From MaRDI portal
Revision as of 07:53, 29 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127526486, #quickstatements; #temporary_batch_1722235777118)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
scientific article

    Statements

    Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2000
    0 references
    arc-routing
    0 references
    capacited minimum spanning tree problem
    0 references
    tabu search
    0 references

    Identifiers