Approximation Algorithms for Orienteering and Discounted-Reward TSP (Q5386217)

From MaRDI portal
Revision as of 20:03, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5265808
Language Label Description Also known as
English
Approximation Algorithms for Orienteering and Discounted-Reward TSP
scientific article; zbMATH DE number 5265808

    Statements

    Approximation Algorithms for Orienteering and Discounted-Reward TSP (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 April 2008
    0 references
    approximation algorithms
    0 references
    traveling salesman problem
    0 references
    prize-collecting traveling salesman problem
    0 references
    orienteering
    0 references
    robot navigation
    0 references
    Markov decision processes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references