The Capacitated Arc Routing Problem: Lower bounds (Q4022732)

From MaRDI portal
Revision as of 22:01, 23 October 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
The Capacitated Arc Routing Problem: Lower bounds
scientific article

    Statements

    The Capacitated Arc Routing Problem: Lower bounds (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    Chinese postman
    0 references
    capacitated arc routing problem
    0 references
    minimum total cost
    0 references
    lower bounds
    0 references
    minimum cost perfect matching
    0 references
    vehicle capacity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references