Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039)

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
Lower and upper bounds for the mixed capacitated arc routing problem
scientific article

    Statements

    Lower and upper bounds for the mixed capacitated arc routing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2006
    0 references
    capacitated arc routing problem
    0 references
    mixed graph
    0 references
    lower bound
    0 references
    cutting plane
    0 references
    heuristic
    0 references
    memetic algorithm
    0 references
    waste collection
    0 references

    Identifiers

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