On the traveling salesman problem with a relaxed Monge matrix

DOI10.1016/S0020-0190(98)00119-7zbMath1339.90275OpenAlexW1996007173MaRDI QIDQ293365

Rainer E. Burkard, Vladimir G. Deǐneko

Publication date: 9 June 2016

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001197?np=y

zbMATH Keywords

algorithmstraveling salesman problemMonge matrixEuclidean TSPpyramidally solvable case

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY ⋮ OR Utopia

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extreme Hamiltonian lines
• Perspectives of Monge properties in optimization
• On the recognition of permuted Supnick and incomplete Monge matrices
• Universal conditions for algebraic travelling salesman problems to be efficiently solvable
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
• Three easy special cases of the euclidean travelling salesman problem
• Edgeconvex Circuits and the Traveling Salesman Problem
• Extrema in Space-Time

This page was built for publication: On the traveling salesman problem with a relaxed Monge matrix