Search and delivery man problems: when are depth-first paths optimal? (Q2184055)

From MaRDI portal
Revision as of 01:15, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Search and delivery man problems: when are depth-first paths optimal?
scientific article

    Statements

    title
    Search and delivery man problems: when are depth-first paths optimal? (English)
    0 references
    author
    Steven Alpern
    0 references
    Thomas F. Lidbetter
    0 references
    publication date
    27 May 2020
    0 references
    zbMATH Keywords
    networks
    0 references
    depth-first search
    0 references
    delivery man problem
    0 references
    trees
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B40
    0 references
    91A43
    0 references
    91A24
    0 references
    90C35
    0 references
    zbMATH DE Number
    7205697
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2184055&oldid=14706036"
    Powered by MediaWiki