A hybrid heuristic for the diameter constrained minimum spanning tree problem
From MaRDI portal
Publication:2268933
DOI10.1007/s10898-009-9430-2zbMath1187.90306MaRDI QIDQ2268933
Abilio Lucena, Andréa Cynthia Santos, Celso Carneiro Ribeiro
Publication date: 15 March 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9430-2
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
Related Items
A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications, An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem, Delay-constrained minimum shortest path trees and related problems, Modeling and solving the bi-objective minimum diameter-cost spanning tree problem, Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms, SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
Uses Software
Cites Work
- Heuristics for the mirrored traveling tournament problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Semi-greedy heuristics: An empirical study
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- Variable neighborhood search: Principles and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
