The Capacitated Arc Routing Problem: Lower bounds (Q4022732)

From MaRDI portal
Revision as of 14:28, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
(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

    title
    The Capacitated Arc Routing Problem: Lower bounds (English)
    0 references
    author
    Enrique Benavent
    0 references
    Vicente Campos
    0 references
    Angel Corberán
    0 references
    Enrique Mota
    0 references
    published in
    Networks
    0 references
    publication date
    17 January 1993
    0 references
    zbMATH Keywords
    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

    Mathematics Subject Classification ID
    90C35
    0 references
    90B06
    0 references
    90C39
    0 references
    90-08
    0 references
    zbMATH DE Number
    98637
    0 references
    OpenAlex ID
    W2036924136
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4022732&oldid=31171752"
    Powered by MediaWiki