none5Integer Linear Programming models are presented for two generalizations of the well know Minimum Spanning Tree Problem: the "Cost Constrained Minimum Label Spanning Tree Problem" and the "Label Constrained Minimum Spanning Tree Problem". The two considered problems are NP-Hard. Metaheuristic algorithms are proposed for their solution. Computational results on benchmark instances from the literature show the effectiveness of the proposed approaches.noneM. Salari; Z. Naji-Azimi; B. Golden; S. Raghavan; P. TothM. Salari; Z. Naji-Azimi; B. Golden; S. Raghavan; P. Tot
We present a study on heuristic solution approaches to the minimum labelling Steiner tree problem, a...
AbstractIn this paper, least-cost minimum spanning tree (LC-MST) problem is defined as a method to c...
Two issues are discussed in depth in this dissertation--the optimization of nondifferentiable functi...
none5Integer Linear Programming models are presented for two generalizations of the well know Minimu...
We present exact mixed integer programming approaches including branch-and-cut and branch-and-cut-an...
The Minimum Label Spanning Tree (MLST) problem was introduced by Chang and Leu [2].In this problem, ...
Zsfassung in dt. SpracheDas Minimum Label Spanning Tree Problem ist ein kombinatorisches Optimierung...
In this work we introduce and study the strong generalized minimum label spanning tree (GMLST), a no...
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem se...
This report studies constructive heuristics for the minimum labelling spanning tree (MLST) problem....
Let G=(V,E) be a connected multigraph, whose edges are associated with labels specified by an intege...
In an undirected graph G we associate costs and weights to each edge. The weight-constrained minimum...
Given an undirected network with positive edge costs and a positive integer d > 2, the minimum-degre...
The minimal spanning tree problem is one of the oldest and most basic graph problems in theoretical ...
This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is...
We present a study on heuristic solution approaches to the minimum labelling Steiner tree problem, a...
AbstractIn this paper, least-cost minimum spanning tree (LC-MST) problem is defined as a method to c...
Two issues are discussed in depth in this dissertation--the optimization of nondifferentiable functi...
none5Integer Linear Programming models are presented for two generalizations of the well know Minimu...
We present exact mixed integer programming approaches including branch-and-cut and branch-and-cut-an...
The Minimum Label Spanning Tree (MLST) problem was introduced by Chang and Leu [2].In this problem, ...
Zsfassung in dt. SpracheDas Minimum Label Spanning Tree Problem ist ein kombinatorisches Optimierung...
In this work we introduce and study the strong generalized minimum label spanning tree (GMLST), a no...
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem se...
This report studies constructive heuristics for the minimum labelling spanning tree (MLST) problem....
Let G=(V,E) be a connected multigraph, whose edges are associated with labels specified by an intege...
In an undirected graph G we associate costs and weights to each edge. The weight-constrained minimum...
Given an undirected network with positive edge costs and a positive integer d > 2, the minimum-degre...
The minimal spanning tree problem is one of the oldest and most basic graph problems in theoretical ...
This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is...
We present a study on heuristic solution approaches to the minimum labelling Steiner tree problem, a...
AbstractIn this paper, least-cost minimum spanning tree (LC-MST) problem is defined as a method to c...
Two issues are discussed in depth in this dissertation--the optimization of nondifferentiable functi...
Add to ORKG