Minimal spanning trees and partial sorting

DOI10.1016/0167-6377(82)90010-4zbMath0488.90071OpenAlexW2053210693MaRDI QIDQ1166430

J. J. Brennan

Publication date: 1982

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(82)90010-4

zbMATH Keywords

traveling salesman problemcomparison of algorithmsminimal spanning treesHeld-Karp boundpartial sorting algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items

An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem ⋮ Computational experience with minimum spanning tree algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Implementing vehicle routing algorithms
• Finding Minimum Spanning Trees
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Network reliability analysis: Part I