In this paper, some of the main known results relative to the generalized minimum spanning
tree problem are surveyed. The principal feature of this problem is related to the fact that the …

Several different ways exist for approaching hard optimization problems. Mathematical
programming techniques, including (integer) linear programming based methods, and …

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

Matheuristics are heuristic algorithms based on mathematical tools such as the ones
provided by mathematical programming, that are structurally general enough to be applied …

In this paper, we address the prize-collecting generalized minimum spanning tree problem
(PC-GMSTP) which aims to find a minimum spanning tree to connect a network of clusters …

In this paper, we are addressing the generalized minimum spanning tree problem, denoted
by GMSTP, which is a variant of the classical minimum spanning tree (MST) problem. The …

Combinatorial optimization is a fascinating topic. Combinatorial optimization problems arise
in a wide variety of important fields such as transportation, telecommunications, computer …

Over the last years, so-called hybrid optimization approaches have become increasingly
popular for addressing hard optimization problems. In fact, when looking at leading …

This paper presents a greedy randomized adaptive search procedure (GRASP) coupled
with path relinking (PR) to solve the problem of clustering n nodes in a graph into p clusters …