Sometimes Travelling is Easy: The Master Tour Problem (Q4388980)

From MaRDI portal
Revision as of 10:38, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1150884
Language Label Description Also known as
English
Sometimes Travelling is Easy: The Master Tour Problem
scientific article; zbMATH DE number 1150884

    Statements

    Sometimes Travelling is Easy: The Master Tour Problem (English)
    0 references
    0 references
    0 references
    0 references
    11 May 1998
    0 references
    travelling salesman problem
    0 references
    Kalmanson condition
    0 references
    master tour
    0 references
    combinatorial optimization
    0 references
    polynomial time
    0 references

    Identifiers

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