Path Optimality Conditions for Minimum Spanning Tree Problem with Uncertain Edge Weights

  title={Path Optimality Conditions for Minimum Spanning Tree Problem with Uncertain Edge Weights},
  author={Jian Zhou and Lu Chen and Ke Wang},
  journal={Int. J. Uncertain. Fuzziness Knowl. Based Syst.},
This paper investigates the uncertain minimum spanning tree (UMST) problem where the edge weights are assumed to be uncertain variables. In order to propose effective solving methods for the UMST problem, path optimality conditions as well as some equivalent definitions for two commonly used types of UMST, namely, uncertain expected minimum spanning tree (expected UMST) and uncertain α-minimum spanning tree (α-UMST), are discussed. It is shown that both the expected UMST problem and the α-UMST… 

Uncertain Distribution-Minimum Spanning Tree Problem

This paper studies the minimum spanning tree problem on a graph with uncertain edge weights, which are formulated as uncertain variables and shows that this problem can be effectively solved via the proposed deterministic graph transformation-based approach with the aid of the β-distribution-path optimality condition.

Degree-constrained minimum spanning tree problem of uncertain random network

In order to seek out the degree-constrained minimum spanning tree (DCST) closest to the ideal chance distribution, an uncertain random programming model is formulated and an algorithm is presented to solve the DCMST problem.

Minimum spanning tree problem of uncertain random network

This paper focuses on the case where some weights are random variables and the others are uncertain variables, and a model is formulated to find a minimum spanning tree whose chance distribution is the closest to the ideal one.

On Multi-Objective Minimum Spanning Tree Problem under Uncertain Paradigm

Two uncertain programming models of the proposed uncertain multi-objective minimum spanning tree problem (UMMSTP) are developed and their corresponding crisp equivalence models are investigated, and the practical problem of optimizing the distribution of petroleum products was solved using a classical multi- objective solution technique, the epsilon-constraint method.

Models for inverse minimum spanning tree problem with fuzzy edge weights

A fuzzy α-minimum spanning tree model and a credibility maximization model are presented to formulate the problem according to different decision criteria, and a fuzzy simulation for computing credibility is designed and embedded into a genetic algorithm to produce some hybrid intelligent algorithms.

Minimum Spanning Tree with Uncertain Random Weights

This paper considers the minimum spanning tree problem with uncertain random weights in an uncertain random network. The concept of uncertain random minimum spanning tree is initiated for minimum

An algorithmic approach for finding minimum spanning tree in a intuitionistic fuzzy graph

This paper modifies the classical Bor˚uvka’s algorithm to generate the IMST of fuzzy graph, which is the lifeline of any city and describes the utility of IMST in a water distribution network.

Uncertain programming models for multi-objective shortest path problem with uncertain parameters

An uncertain multi-objective shortest path problem (UMSPP) for a weighted connected directed graph (WCDG) where every edge weight is associated with two uncertain parameters: cost and time is presented.

Entropy of Uncertain Random Variables wi h Application to Minimum Spanning Tree Problem

In this paper, a model is presented to formulate a minimum spanning tree problem with uncertain random edge weights involving a relative entropy chance distribution and some mathematical properties of this concept are investigated.


  • Hui LiBo ZhangJin Peng
  • Mathematics
  • 2017
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The



Two Uncertain Programming Models for Inverse Minimum Spanning Tree Problem

An inverse minimum spanning tree problem makes the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In

Uncertain Quadratic Minimum Spanning Tree Problem

It is shown that the problem of finding an uncertain quadratic - minimum spanning tree can be handled in the framework of the deterministic quadrato-minimum spanning tree problem requiring no particular solving methods.

Stochastic spanning tree problem

On Two-Stage Stochastic Minimum Spanning Trees

For the two-stage stochastic optimization formulation with finite scenarios, a simple iterative randomized rounding method on a natural LP formulation of the problem yields a nearly best-possible approximation algorithm.

A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs

A learning automata-based heuristic algorithm to solve the minimum spanning tree problem in stochastic graphs wherein the probability distribution function of the edge weight is unknown and the superiority of the proposed algorithm over the well-known existing methods both in terms of the number of samples and the running time of algorithm is shown.

The minimum spanning tree problem with fuzzy costs

The minimum spanning tree problem in a given connected graph is considered and Possibility theory is applied to characterize the optimality of edges of the graph and to choose a spanning tree under fuzzy costs.

Fuzzy quadratic minimum spanning tree problem

A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm

An Evolutionary Approach to Solve Minimum Spanning Tree Problem with Fuzzy Parameters

  • T.A. AlmeidaA. YamakamiM. Takahashi
  • Computer Science, Business
    International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06)
  • 2005
The minimum spanning tree problem with fuzzy parameters is studied and an exact algorithm is proposed to solve it. However, as this problem conveys the need of large number of comparisons, a genetic