On approximating a geometric prize-collecting traveling salesman problem with time windows (Q4675490)

From MaRDI portal
Revision as of 08:04, 22 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article; zbMATH DE number 2165452
Language Label Description Also known as
English
On approximating a geometric prize-collecting traveling salesman problem with time windows
scientific article; zbMATH DE number 2165452

    Statements

    On approximating a geometric prize-collecting traveling salesman problem with time windows (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2005
    0 references
    scheduling problem
    0 references
    traveling salesman
    0 references
    locations
    0 references
    dynamic programming algorithm
    0 references

    Identifiers