On the Euclidean TSP with a permuted van der Veen matrix

DOI10.1016/J.IPL.2004.05.011zbMATH Open1171.90505OpenAlexW2050788965MaRDI QIDQ2390323FDOQ2390323

Authors: Rainer E. Burkard, Vladimir G. Deineko 

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.05.011

Recommendations

• An asymmetric analog of van der Veen conditions and the traveling salesman problem. II
• On the recognition of permuted Supnick and incomplete Monge matrices
• Three easy special cases of the euclidean travelling salesman problem
• An asymmetric analogue of van der Veen conditions and the traveling salesman problem
• Small and large TSP: Two polynomially solvable cases of the traveling salesman problem

zbMATH Keywords

algorithmstraveling salesman problempyramidally solvable casevan der Veen matrix

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Cites Work

• The traveling salesman problem and its variations
• Title not available (Why is that?)
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Title not available (Why is that?)
• A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
• Three easy special cases of the euclidean travelling salesman problem
• Title not available (Why is that?)

Cited In (1)

• Pyramidal tours and multiple objectives

This page was built for publication: On the Euclidean TSP with a permuted van der Veen matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390323)