Shortest path tour problem with time windows (Q2282521)

From MaRDI portal
Revision as of 23:49, 13 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127304057, #quickstatements; #temporary_batch_1723585310344)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Shortest path tour problem with time windows
scientific article

    Statements

    title
    Shortest path tour problem with time windows (English)
    0 references
    author
    Daniele Ferone
    0 references
    Paola Festa
    0 references
    Francesca Guerriero
    0 references
    publication date
    8 January 2020
    0 references
    zbMATH Keywords
    networks
    0 references
    shortest path tour problem
    0 references
    resource-constrained shortest path problem
    0 references
    time windows constraints
    0 references

    Identifiers

    zbMATH DE Number
    7148583
    0 references
    OpenAlex ID
    W2971760385
    0 references
    Wikidata QID
    Q127304057
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2282521&oldid=37586073"
    Powered by MediaWiki