Classes of matrices for the traveling salesman problem

DOI10.1016/0024-3795(90)90387-RMaRDI QIDQ804474zbMATH OpenFDO

Authors Richard H. Warren

Publication date 1990

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(90)90387-R

zbMATH Keywords

distance matrixHungarian algorithmtraveling salesmantriangular block form

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Combinatorial optimization (90C27)

Recommendations

• Optimal arcs for the traveling salesman problem
• On the traveling salesman problem with a relaxed Monge matrix
• Maximizing traveling salesman problem for special matrices
• Revisiting the 0,1 assignment problem
• Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood

Cites work

• Classes of matrices associated with the optimal assignment problem
• Computability and Noncomputability in Classical Analysis
• Depth-First Search and Linear Graph Algorithms
• scientific article; zbMATH DE number 3144516 (Why is no real title available?)
• scientific article; zbMATH DE number 4027206 (Why is no real title available?)
• scientific article; zbMATH DE number 3733647 (Why is no real title available?)
• Recursive Real Numbers

Cited in

(7)

• Tours for the traveling salesman
• Revisiting the 0,1 assignment problem
• Optimal arcs for the traveling salesman problem
• The travelling salesman problem on permuted Monge matrices
• Special cases of the traveling salesman problem
• On classes of normalized matrices
• THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES

This page was built for publication: Classes of matrices for the traveling salesman problem

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