On the Euclidean TSP with a permuted van der Veen matrix

DOI10.1016/J.IPL.2004.05.011MaRDI QIDQ2390323zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmstraveling salesman problempyramidally solvable casevan der Veen matrix

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3898613 (Why is no real title available?)
• scientific article; zbMATH DE number 4027206 (Why is no real title available?)
• scientific article; zbMATH DE number 2064414 (Why is no real title available?)
• A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
• The traveling salesman problem and its variations
• Three easy special cases of the euclidean travelling salesman problem
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

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)