Fuzzy random bottleneck spanning tree problems using possibility and necessity measures

DOI10.1016/S0377-2217(02)00523-4zbMath1030.90145MaRDI QIDQ1410325

Masatoshi Sakawa, Hiroaki Ishii, Hideki Katagiri

Publication date: 14 October 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Fuzzy random variableBottleneck spanning tree problemChance constrained programmingNecessity measurePolynomial order algorithmPossibility measure

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Related Items (14)

Stackelberg solutions for fuzzy random bilevel linear programming through level sets and probability maximization ⋮ Interactive fuzzy random two-level linear programming through fractile criterion optimization ⋮ Stackelberg solutions for fuzzy random two-level linear programming through probability maximization with possibility ⋮ Stackelberg solutions for fuzzy random two-level linear programming through level sets and fractile criterion optimization ⋮ A general concept for solving linear multicriteria programming problems with crisp, fuzzy or stochastic values ⋮ Quadratic bottleneck problems ⋮ INTERACTIVE DECISION MAKING USING POSSIBILITY AND NECESSITY MEASURES FOR A FUZZY RANDOM MULTIOBJECTIVE 0–1 PROGRAMMING PROBLEM ⋮ Interactive multiobjective fuzzy random linear programming: Maximization of possibility and probability ⋮ Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty ⋮ A fuzzy random multiobjective 0--1 programming based on the expectation optimization model using possibility and necessity measures ⋮ Interactive multiobjective fuzzy random programming through the level set-based probability model ⋮ Chance-constrained programming with fuzzy stochastic coefficients ⋮ Sistema imunológico artificial para resolver o problema da árvore geradora mínima com parâmetros fuzzy ⋮ Possibility/necessity-based probabilistic expectation models for linear programming problems with discrete fuzzy random variables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Fuzzy random variables - I. Definitions and theorems
• Linear programming with fuzzy random variable coefficients
• On fuzzy stochastic optimization
• Possibilistic linear programming: A brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem
• Stochastic bottleneck spanning tree problem
• Combinatorial Optimization with Rational Objective Functions
• Fuzzy random variables

This page was built for publication: Fuzzy random bottleneck spanning tree problems using possibility and necessity measures