An efficiency-based path-scanning heuristic for the capacitated arc routing problem (Q1634089)

From MaRDI portal
Revision as of 23:46, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficiency-based path-scanning heuristic for the capacitated arc routing problem
scientific article

    Statements

    title
    An efficiency-based path-scanning heuristic for the capacitated arc routing problem (English)
    0 references
    author
    Rafael Kendy Arakaki
    0 references
    Fábio Luiz Usberti
    0 references
    publication date
    17 December 2018
    0 references
    zbMATH Keywords
    capacitated arc routing problem
    0 references
    constructive heuristic
    0 references
    path-scanning
    0 references
    describes a project that uses
    LEMON
    0 references
    VRP
    0 references
    cites work
    Q5271456
    0 references
    Q5271460
    0 references
    Q5271463
    0 references
    Q5271457
    0 references
    Q5271454
    0 references
    Vehicle Routing
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C35
    0 references
    90B06
    0 references
    90C59
    0 references
    zbMATH DE Number
    6994283
    0 references
    OpenAlex ID
    W2903469954
    0 references
    Wikidata QID
    Q128861304
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1634089&oldid=38673573"
    Powered by MediaWiki