Classes of matrices for the traveling salesman problem

DOI10.1016/0024-3795(90)90387-RzbMath0727.90063MaRDI QIDQ804474

Richard H. Warren

Publication date: 1990

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

zbMATH Keywords

traveling salesmanHungarian algorithmdistance matrixtriangular block form

Mathematics Subject Classification ID

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

Related Items

On classes of normalized matrices ⋮ Tours for the traveling salesman ⋮ Revisiting the 0,1 assignment problem ⋮ Optimal arcs for the traveling salesman problem ⋮ Special cases of the traveling salesman problem

Cites Work

• Classes of matrices associated with the optimal assignment problem
• Computability and Noncomputability in Classical Analysis
• Depth-First Search and Linear Graph Algorithms
• Recursive Real Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item