The hop-constrained minimum spanning tree problem (HMSTP) is an NP-hard problem
arising in the design of centralized telecommunication networks with quality of service …

The wireless communication technologies are rapidly spreading to many new areas,
including the automation and the importance of the use of wireless technologies in the data …

We consider the Bounded Diameter Minimum Spanning Tree problem and describe four
neighbourhood searches for it. They are used as local improvement strategies within a …

Given a connected, weighted, undirected graph G and a bound D, the bounded diameter
minimum spanning tree problem seeks a spanning tree on G of minimum weight among the …

We propose a hybrid GRASP and ILS based heuristic for the diameter constrained minimum
spanning tree problem. The latter typically models network design applications where, under …

The bounded diameter minimum spanning tree problem is an NP-hard combinatorial
optimization problem with applications in various fields like communication network design …

Workover rigs are used in onshore basins but they are often in limited number and they may
not attend all the maintenance requests. We consider here the problem of scheduling the …

The diameter‐constrained minimum spanning tree problem consists in finding a minimum
spanning tree of a given graph, subject to the constraint that the maximum number of edges …

Given an undirected network with positive edge costs and a natural number p, the Hop-
Constrained Minimum Spanning Tree problem (HMST) is the problem of finding a spanning …

In this paper, we have studied the constrained version of the fuzzy minimum spanning tree
problem. Costs of all the edges are considered as fuzzy numbers. Using the m λ measure, a …