Classes of matrices for the traveling salesman problem

DOI10.1016/0024-3795(90)90387-RzbMATH Open0727.90063MaRDI QIDQ804474FDOQ804474

Authors: Richard H. Warren 

Publication date: 1990

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

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

zbMATH Keywords

distance matrixtraveling salesmanHungarian algorithmtriangular block form

Mathematics Subject Classification ID

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

Cites Work

• Depth-First Search and Linear Graph Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computability and Noncomputability in Classical Analysis
• Title not available (Why is that?)
• Recursive Real Numbers
• Classes of matrices associated with the optimal assignment problem

Cited In (7)

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

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)