New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem

DOI10.1287/IJOC.2014.0617MaRDI QIDQ2942691zbMATH OpenOpenAlexFDO

Authors Wolfgang Steitz

Publication date 11 September 2015

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2014.0617

zbMATH Keywords

backbonebounded-diameter minimum spanning tree problemconstruction heuristicsdiameteroptimizationspanning trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Greedy heuristics for the bounded diameter minimum spanning tree problem
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• Greedy heuristics for the diameter-constrained minimum spanning tree problem
• Approximating the degree-bounded minimum diameter spanning tree problem
• Approximating the degree-bounded minimum diameter spanning tree problem
• scientific article; zbMATH DE number 5036665

Cited in

(9)

• Finding bounded diameter minimum spanning tree in general graphs
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• Assessing the performance of bi-objective MST for Euclidean and non-Euclidean instances
• Stochastic bounded diameter minimum spanning tree problem
• Constructing minimal spanning/Steiner trees with bounded path length
• Greedy heuristics for the bounded diameter minimum spanning tree problem
• Revisiting search methods for the bounded-diameter minimum spanning tree problem
• List-based simulated annealing algorithm with novel encoding structure for the bounded diameter minimum spanning tree problem
• Greedy heuristics for the diameter-constrained minimum spanning tree problem

This page was built for publication: New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem

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