Three easy special cases of the euclidean travelling salesman problem

DOI10.1051/ro/1997310403431zbMath0888.90141OpenAlexW2413690630MaRDI QIDQ4372111

Gerhard J. Woeginger, Jack A. A. van der Veen, Rüdiger Rudolf, Vladimir G. Deǐneko

Publication date: 8 June 1998

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105155

zbMATH Keywords

travelling salesman problemdistance matrixKalmanson conditionsDemidenko conditionspolynomial time recognition algorithmsSupnick conditions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (5)

On the traveling salesman problem with a relaxed Monge matrix ⋮ On the Euclidean TSP with a permuted van der Veen matrix ⋮ Perspectives of Monge properties in optimization ⋮ New special cases of the quadratic assignment problem with diagonally structured coefficient matrices ⋮ A New Tractable Case of the QAP with a Robinson Matrix

This page was built for publication: Three easy special cases of the euclidean travelling salesman problem