Add to ORKGCover title. "November, 1998."Includes bibliographical references (p. 24-25).by Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma
AbstractGiven an undirected graph with weights associated with its edges, the degree-constrained min...
In this thesis we focus on the Capacitated Minimum Spanning Tree (CMST), an extension of the minimum...
Telsiz duyarga ağlar (TDA) üzerinde bulunan düğümlerin sahip oldukları enerji kaynakları genellikle ...
In this paper a survey on existing algorithms for the capacitated minimum spanning tree problem (CMS...
This work addresses the multi-level capacitated minimum spanning tree (MLCMST) problem. It consists...
Abstract—The capacitated minimum spanning tree (CMST) problem is one of the most fundamental and sig...
This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is...
Given an undirected graph whose edges are labeled or colored, edge weights indicating the cost of an...
In the generalized version of the classical Minimum Spanning Tree problem, the nodes of a graph are ...
This paper focuses on the capacitated minimum spanning tree(CMST)problem.Given a central processor a...
We propose algorithms to compute tight lower boundsand high quality upper bounds (UBs) for the multi...
We present a study on heuristic solution approaches to the minimum labelling Steiner tree problem, a...
We study the polyhedral structure of two related core combinatorial problems: the subtree cardinalit...
We propose algorithms to compute tight lower bounds and high quality upper bounds (UBs) for the mult...
This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu ...
AbstractGiven an undirected graph with weights associated with its edges, the degree-constrained min...
In this thesis we focus on the Capacitated Minimum Spanning Tree (CMST), an extension of the minimum...
Telsiz duyarga ağlar (TDA) üzerinde bulunan düğümlerin sahip oldukları enerji kaynakları genellikle ...
In this paper a survey on existing algorithms for the capacitated minimum spanning tree problem (CMS...
This work addresses the multi-level capacitated minimum spanning tree (MLCMST) problem. It consists...
Abstract—The capacitated minimum spanning tree (CMST) problem is one of the most fundamental and sig...
This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is...
Given an undirected graph whose edges are labeled or colored, edge weights indicating the cost of an...
In the generalized version of the classical Minimum Spanning Tree problem, the nodes of a graph are ...
This paper focuses on the capacitated minimum spanning tree(CMST)problem.Given a central processor a...
We propose algorithms to compute tight lower boundsand high quality upper bounds (UBs) for the multi...
We present a study on heuristic solution approaches to the minimum labelling Steiner tree problem, a...
We study the polyhedral structure of two related core combinatorial problems: the subtree cardinalit...
We propose algorithms to compute tight lower bounds and high quality upper bounds (UBs) for the mult...
This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu ...
AbstractGiven an undirected graph with weights associated with its edges, the degree-constrained min...
In this thesis we focus on the Capacitated Minimum Spanning Tree (CMST), an extension of the minimum...
Telsiz duyarga ağlar (TDA) üzerinde bulunan düğümlerin sahip oldukları enerji kaynakları genellikle ...