A Lagrangean Heuristic For The Degree Constrained Minimal Spanning Tree Problem
نویسندگان
چکیده
منابع مشابه
Cross Decomposition of the Degree-Constrained Minimum Spanning Tree problem
As computer communication networks become a prevalent part in our daily life, the importance of efficient design of those networks becomes more evident. One of the critical issues in the network design process is the topological design problem involved in establishing a centralized data communication network with best performance and low costs. It can be recognized as a degree-constrained minim...
متن کاملBenchmark Problem Generators and Results for the Multiobjective Degree-Constrained Minimum Spanning Tree Problem
Finding a minimum-weight spanning tree (MST) in a graph is a classic problem in operational research (OR) with important applications in network design. In this paper , we consider the degree-constrained mul-tiobjective MST problem, which is NP-hard. We present several diierent parameterized problem generators for producing MST instances with diierent problem features, including any number of o...
متن کاملA Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
The rooted delay-constrained minimum spanning tree (RDCMST) problem is an NP-hard [3] combinatorial optimization problem. The objective is to find a minimum cost spanning tree in a given graph with cost and delay values assigned to each edge. Additionally, a delay-bound is given limiting the maximum delay allowed for each path between a specified root vertex and any other vertex in the graph. T...
متن کاملA Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting networks where quality of service constraints are of concern. We present a construction heuristic based on Kruskal’s algorithm for finding a minimum cost spanning tree which eliminates some drawbacks of existing heuristic metho...
متن کاملThe Directed Minimum-Degree Spanning Tree Problem
Consider a directed graph G = (V,E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is the smallest among all such spanning trees. The problem is known to be NP-hard. A quasipolynomial time approximation algorithm for this problem is presented. The algorithm finds a spanning tree whose maximal degree is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Review of Business Information Systems (RBIS)
سال: 2010
ISSN: 2157-9547,1534-665X
DOI: 10.19030/rbis.v14i3.493