A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041)

From MaRDI portal
Revision as of 16:48, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
scientific article

    Statements

    A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (English)
    0 references
    0 references
    0 references
    30 June 2006
    0 references
    arc routing
    0 references
    Chinese postman problem
    0 references
    tabu search
    0 references
    min-max optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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