A hybrid heuristic for the diameter constrained minimum spanning tree problem
From MaRDI portal
Publication:2268933
Recommendations
- Greedy heuristics for the diameter-constrained minimum spanning tree problem
- Greedy heuristics for the bounded diameter minimum 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
- scientific article; zbMATH DE number 1439455
- A polyhedral study of the diameter constrained minimum spanning tree problem
- Solving diameter-constrained minimum spanning tree problems by constraint programming
Cites work
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
- A probabilistic heuristic for a computationally difficult set covering problem
- Developments of variable neighborhood search
- Heuristics for the mirrored traveling tournament problem
- 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 2050708 (Why is no real title available?)
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Semi-greedy heuristics: An empirical study
- Variable neighborhood search: Principles and applications
Cited in
(17)- A polyhedral study of the diameter constrained minimum spanning tree problem
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- Hybrid constructive heuristics for the critical node problem
- New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
- Solving diameter-constrained minimum spanning tree problems by constraint programming
- Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
- A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications
- An average case analysis of the minimum spanning tree heuristic for the power assignment problem
- An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
- Delay-constrained minimum shortest path trees and related problems
- Revisiting search methods for the bounded-diameter minimum spanning tree problem
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- 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: A hybrid heuristic 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 Q2268933)
