A hybrid heuristic for the diameter constrained minimum spanning tree problem

DOI10.1007/s10898-009-9430-2zbMath1187.90306OpenAlexW2072878203MaRDI 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

zbMATH Keywords

GRASPiterated local search

Mathematics Subject Classification ID

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

Related Items (6)

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 ⋮ Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms ⋮ Delay-constrained minimum shortest path trees and related problems ⋮ An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem ⋮ SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: A hybrid heuristic for the diameter constrained minimum spanning tree problem