A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone (Q5138267)

From MaRDI portal
Revision as of 02:04, 17 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7281715
Language Label Description Also known as
English
A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
scientific article; zbMATH DE number 7281715

    Statements

    A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone (English)
    0 references
    0 references
    0 references
    0 references
    3 December 2020
    0 references
    970 transportation
    0 references
    vehicle routing
    0 references
    490 networks-graphs
    0 references
    traveling salesman
    0 references
    630 programming
    0 references
    integer
    0 references
    algorithms
    0 references
    branch and bound
    0 references

    Identifiers