Greedy heuristics for the diameter-constrained minimum spanning tree problem

DOI10.1007/S10958-009-9611-ZMaRDI QIDQ844529zbMATH OpenOpenAlexWikidataFDO

Authors Cristina Requejo, Eulália Santos

Publication date 19 January 2010

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-009-9611-z

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Greedy heuristics for the bounded diameter minimum spanning tree problem
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
• scientific article; zbMATH DE number 5036665
• scientific article; zbMATH DE number 1439455
• Heuristic search for the generalized minimum spanning tree problem
• The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm

Cites work

• scientific article; zbMATH DE number 1629846 (Why is no real title available?)
• scientific article; zbMATH DE number 91018 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 731844 (Why is no real title available?)
• scientific article; zbMATH DE number 1161326 (Why is no real title available?)
• scientific article; zbMATH DE number 1439494 (Why is no real title available?)
• A New Class of Algorithms for Multipoint Network Optimization
• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
• A textbook of graph theory
• An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
• Multicommodity flow models for spanning trees with hop constraints
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Random-tree Diameter and the Diameter-constrained MST

Cited in

(12)

• scientific article; zbMATH DE number 5036665 (Why is no real title available?)
• Solving diameter-constrained minimum spanning tree problems by constraint programming
• A greedy heuristic for a minimum-weight forest problem
• An average case analysis of the minimum spanning tree heuristic for the power assignment problem
• Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
• New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
• The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm
• Greedy heuristics for the bounded diameter minimum spanning tree problem
• An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
• VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
• A hybrid heuristic for the diameter constrained minimum spanning tree problem

This page was built for publication: Greedy heuristics for the diameter-constrained minimum spanning tree problem

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