Add to ORKGThe Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum Spanning Tree problem in which nodes are partitioned into clusters and the problem calls for a minimum cost tree spanning at least one node from each cluster. A different version of the problem, called E-GMST arises when exactly one node from each cluster has to be visited. Both GMST problem and E-GMST problem are NP-hard problems. In this paper, we model GMST problem and E-GMST problem as integer linear programs and study the facial structure of the corresponding polytopes
The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that cons...
In recent years, there has been an increased literature on so-called generalized network design prob...
We present an overview of the approximation theory in combinatorial optimization. As an applicatio...
The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum ...
This article presents a branch-and-cut algorithm for the Generalized Minimum Spanning Tree Problem (...
Given an undirected graph whose nodes are partitioned into a number of clusters, the Generalized Min...
We consider a generalization of the minimum spanning tree problem, called the generalized minimum sp...
This article describes eight formulations for the generalized minimum spanning tree problem (gmstp)....
Given a complete undirected graph with the nodes partitioned into m node sets called clusters, the G...
AbstractThe generalized steiner tree problem (GSTP) is a variant of the classical Steiner tree probl...
This article introduces the Generalized Minimum Branch Vertices problem. Given an undirected graph,...
We consider the at least version of the Generalized Minimum Spanning Tree Problem, denoted by L-GMST...
The Generalized Minimum Spanning Tree (GMST) problem requires spanning exactly one node from every c...
This paper is concerned with a special case of the Generalized Mini-mum Spanning Tree Problem. The G...
The generalized minimum spanning tree problem consists of finding a minimum cost spanning tree in an...
The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that cons...
In recent years, there has been an increased literature on so-called generalized network design prob...
We present an overview of the approximation theory in combinatorial optimization. As an applicatio...
The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum ...
This article presents a branch-and-cut algorithm for the Generalized Minimum Spanning Tree Problem (...
Given an undirected graph whose nodes are partitioned into a number of clusters, the Generalized Min...
We consider a generalization of the minimum spanning tree problem, called the generalized minimum sp...
This article describes eight formulations for the generalized minimum spanning tree problem (gmstp)....
Given a complete undirected graph with the nodes partitioned into m node sets called clusters, the G...
AbstractThe generalized steiner tree problem (GSTP) is a variant of the classical Steiner tree probl...
This article introduces the Generalized Minimum Branch Vertices problem. Given an undirected graph,...
We consider the at least version of the Generalized Minimum Spanning Tree Problem, denoted by L-GMST...
The Generalized Minimum Spanning Tree (GMST) problem requires spanning exactly one node from every c...
This paper is concerned with a special case of the Generalized Mini-mum Spanning Tree Problem. The G...
The generalized minimum spanning tree problem consists of finding a minimum cost spanning tree in an...
The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that cons...
In recent years, there has been an increased literature on so-called generalized network design prob...
We present an overview of the approximation theory in combinatorial optimization. As an applicatio...