The \(x\)-and-\(y\)-axes travelling salesman problem (Q2253351): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Euclidean TSP between two nested convex obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of TSP based approaches for flowshop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient special case algorithms for the n-line planar traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convex-hull-and-line traveling salesman problem: A solvable case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Convex-hull-and-k-line Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the necklace condition for shortest tours and optimal factors in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymmetric analog of van der Veen conditions and the traveling salesman problem. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective traveling salesperson problem on Halin graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean traveling salesman problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The n-line traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for a constrained traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small and large TSP: Two polynomially solvable cases of the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pyramidal tours and the traveling salesman problem / rank
 
Normal rank

Latest revision as of 20:02, 8 July 2024

scientific article
Language Label Description Also known as
English
The \(x\)-and-\(y\)-axes travelling salesman problem
scientific article

    Statements

    The \(x\)-and-\(y\)-axes travelling salesman problem (English)
    0 references
    27 July 2014
    0 references
    0 references
    combinatorial optimization
    0 references
    polynomial-time algorithm
    0 references
    computational complexity
    0 references
    Euclidean travelling salesman problem
    0 references
    0 references
    0 references
    0 references
    0 references