Minimal spanning trees and partial sorting

DOI10.1016/0167-6377(82)90010-4MaRDI QIDQ1166430zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3584897 (Why is no real title available?)
• scientific article; zbMATH DE number 3230614 (Why is no real title available?)
• scientific article; zbMATH DE number 3249566 (Why is no real title available?)
• A note on two problems in connexion with graphs
• Finding Minimum Spanning Trees
• Implementing vehicle routing algorithms
• Network reliability analysis: Part I
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The Traveling-Salesman Problem and Minimum Spanning Trees

Cited in

(2)

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

This page was built for publication: Minimal spanning trees and partial sorting

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