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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: In Pursuit of the Traveling Salesman / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman. Computational solutions for RSP applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: New facets of the STS polytope generated from known facets of the ATS polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental analysis of heuristics for the bottleneck traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Angular-Metric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The precedence-constrained asymmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric quadratic traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the Asymmetric Quadratic Traveling Salesman Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximum Scatter Traveling Salesperson Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounding procedure for the asymmetric quadratic traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extended approach for lifting clique tree inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization and maximization versions of the quadratic travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halin graphs and the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem in graphs with 3-edge cutsets / rank
 
Normal rank

Latest revision as of 17:09, 15 July 2024

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