Diameter Constrained Fuzzy Minimum Spanning Tree Problem
In this paper, we have studied the constrained version of the fuzzy minimum spanning tree problem. Costs of all the edges are considered as fuzzy numbers. Using the measure, a generalization of credibility measure, the problem is formulated as chance-constrained programming problem and dependent-cha...
Main Authors: | Sk. Md. Abu Nayeem, Madhumangal Pal |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer
2013-12-01
|
Series: | International Journal of Computational Intelligence Systems |
Subjects: | |
Online Access: | https://www.atlantis-press.com/article/25868438.pdf |
Similar Items
-
SOLVING THE DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM USING TABU AND MODIFIED PENALTY SEARCH METHODS
by: Wamiliana Wamiliana
Published: (2004-01-01) -
Data, instance sets, and instances generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants
by: Iago A. Carvalho, et al.
Published: (2023-10-01) -
Spanning trees with small diameters
by: Mikio Kano, et al.
Published: (2020-01-01) -
Some models for inverse minimum spanning tree problem with uncertain edge weights
by: Sagarika Biswal, et al.
Published: (2022-10-01) -
An approximation algorithm for the at least version of the generalized minimum spanning tree problem
by: Petrică C. Pop, et al.
Published: (2006-02-01)