A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254)

From MaRDI portal
Revision as of 17:09, 15 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions
scientific article

    Statements

    A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (English)
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    quadratic travelling salesman problem
    0 references
    exact methods
    0 references
    combinatorial optimization
    0 references
    quadratic 0-1 programming
    0 references
    dynamic programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references