Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (Q958456)

From MaRDI portal
Revision as of 22:03, 7 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
scientific article

    Statements

    Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (English)
    0 references
    0 references
    0 references
    4 December 2008
    0 references
    traveling salesman problem
    0 references
    deadlines
    0 references
    heuristics
    0 references
    stochastic
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references