Fuzzy quadratic minimum spanning tree problem

DOI10.1016/j.amc.2004.06.051zbMath1099.90082OpenAlexW2125306618MaRDI QIDQ556109

Jinwu Gao, Mei Lu

Publication date: 13 June 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.06.051

zbMATH Keywords

Genetic algorithmCredibility measureFuzzy programmingMinimum spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Related Items (16)

Path Optimality Conditions for Minimum Spanning Tree Problem with Uncertain Edge Weights ⋮ The quadratic minimum spanning tree problem and its variations ⋮ Solving the quadratic minimum spanning tree problem ⋮ A characterization of linearizable instances of the quadratic minimum spanning tree problem ⋮ Chance-constrained programming models for capital budgeting with NPV as fuzzy parameters ⋮ Gas turbine diagnostics using a soft computing approach ⋮ The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm ⋮ Credibility-based chance-constrained integer programming models for capital budgeting with fuzzy parameters ⋮ A survey of credibility theory ⋮ The modes of convergence in the approximation of fuzzy random optimization problems ⋮ On characterization of credibilistic equilibria of fuzzy-payoff two-player zero-sum game ⋮ Fuzzy α-minimum spanning tree problem: definition and solutions ⋮ Combinatorial optimization in system configuration design ⋮ Concentration inequalities for nonlinear matroid intersection ⋮ Unnamed Item ⋮ On type-2 fuzzy weighted minimum spanning tree

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A study of the ranking function approach through mean values
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Default reasoning and possibility theory
• A procedure for ordering fuzzy subsets of the unit interval
• Fuzzy sets as a basis for a theory of possibility
• Chance constrained programming with fuzzy parameters
• Ranking of fuzzy sets based on the concept of existence
• An effective genetic algorithm approach to the quadratic minimum spanning tree problem
• Ranking fuzzy numbers based on decomposition principle and signed distance.
• Theory and practice of uncertain programming
• Uncertainty theory. An introduction to its axiomatic foundations.
• Fuzzy decision networks and deconvolution
• Dependent-chance programming in fuzzy environments
• Chance-Constrained Programming
• An Approach Based on Necessity Measure to the Fuzzy Spanning Tree Problems

This page was built for publication: Fuzzy quadratic minimum spanning tree problem