An Algorithm for the Bottleneck Traveling Salesman Problem (Q3328310)

From MaRDI portal
Revision as of 22:43, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An Algorithm for the Bottleneck Traveling Salesman Problem
scientific article

    Statements

    An Algorithm for the Bottleneck Traveling Salesman Problem (English)
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    bottleneck traveling salesman problem
    0 references
    directed Hamiltonian circuit
    0 references
    lower bounds
    0 references
    Bottleneck Assignment
    0 references
    Bottleneck Arborescence
    0 references
    breadth- first branch and bound algorithm
    0 references
    heuristic search
    0 references
    test problems
    0 references
    computational result
    0 references

    Identifiers

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