A hybrid heuristic for the diameter constrained minimum spanning tree problem
- 22 May 2009
- journal article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 46 (3) , 363-381
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner treesNetworks, 2004
- Encoding Bounded-Diameter Spanning Trees with Permutations and with Random KeysLecture Notes in Computer Science, 2004
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner treesNetworks, 2003
- Multicasting in a linear lightwave network2002
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- Computing a Diameter-Constrained Minimum Spanning Tree in ParallelLecture Notes in Computer Science, 2000
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- A probabilistic heuristic for a computationally difficult set covering problemOperations Research Letters, 1989
- Minimax Location of a Facility in an Undirected Tree GraphTransportation Science, 1973
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957