Results 151 to 160 of about 128,039 (188)

Uncertain Quadratic Minimum Spanning Tree Problem

Journal of Communications, 2014
The quadratic minimum spanning tree problem is to find a spanning tree on a graph that minimizes a quadratic objective function of the edge weights. In this paper, the quadratic minimum spanning tree problem is concerned on the graph with edge weights being assumed as uncertain variables.
Jian Zhou, Xing He, Ke Wang
openaire   +1 more source

The quadratic minimum spanning tree problem

Naval Research Logistics, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Assad, Arjang, Xu, Weixuan
openaire   +2 more sources

Uncertain Distribution-Minimum Spanning Tree Problem

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2016
This paper studies the minimum spanning tree problem on a graph with uncertain edge weights, which are formulated as uncertain variables. The concept of ideal uncertain minimum spanning tree (ideal UMST) is initiated by extending the definition of the uncertain [Formula: see text]-minimum spanning tree to reect the overall properties of the α-minimum ...
Jian Zhou, Xiajie Yi, Ke Wang, Jing Liu
openaire   +1 more source

A constrained minimum spanning tree problem

Computers & Operations Research, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Guangting, Zhang, Guochuan
openaire   +2 more sources

Stochastic Bounded Diameter Minimum Spanning Tree Problem

Fundamenta Informaticae, 2015
In this paper, a learning automata-based algorithm is proposed for approximating a near optimal solution to the bounded diameter minimum spanning tree (BDMST) problem in stochastic graphs. A stochastic graph is a graph in which the weight associated with each edge is a random variable.
openaire   +1 more source

Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems

2017
Building on previous work about counting the number of spanning trees of an unweighted graph, we consider the case of edge-weighted graphs. We present a generalization of the former result to compute in pseudo-polynomial time the exact number of spanning trees of any given weight, and in particular the number of minimum spanning trees.
Antoine Delaite, Gilles Pesant
openaire   +2 more sources

The generalized minimum spanning tree problem

Proceedings of the 15th annual conference on Genetic and evolutionary computation, 2013
Bi-level optimisation problems have gained increasing interest in the field of combinatorial optimisation in recent years. With this paper, we start the runtime analysis of evolutionary algorithms for bi-level optimisation problems. We examine the NP-hard generalised minimum spanning tree problem and analyse the two approaches presented by Hu and Raidl
Dogan Corus, Per Kristian Lehre, Frank Neumann   +2 more
openaire   +1 more source

Generalized minimum spanning tree problem

2014
The Generalized Minimum Spanning Tree problem denoted by GMST is a generalized combinatorial optimization problem, spanning exactly one node from each cluster in an undirected graph. GMST problems are encountered in telecom-munications network planning. In our thesis, we developed a meta-heuristic method, Tabu Search algorithm, to solve this problem. A
openaire   +2 more sources

The traveling-salesman problem and minimum spanning trees: Part II

Mathematical Programming, 1970
This paper explores new approaches to the symmetric traveling-salesman problem in which 1-trees, which are a slight variant of spanning trees, play an essential role. A 1-tree is a tree together with an additional vertex connected to the tree by two edges.
Held, Michael, Karp, Richard M.
openaire   +3 more sources

The Complexity of Minimum Ratio Spanning Tree Problems

Journal of Global Optimization, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Skiścim, Christopher C., Palocsay, Susan W.   +1 more
openaire   +1 more source