Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty

DOI10.1155/2012/364086zbMath1251.90099OpenAlexW2029454325WikidataQ58906741 ScholiaQ58906741MaRDI QIDQ1760657

Takashi Hasuike, Hideki Katagiri, Hiroshi Tsuda

Publication date: 15 November 2012

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/364086

zbMATH Keywords

reliabilitynetworksrandomnessbottleneck spanning tree problemedge costs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Polynomial time approximation schemes for the constrained minimum spanning tree problem
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Fuzzy programming and linear programming with several objective functions
• Robust discrete optimization and its applications
• Fuzzy random bottleneck spanning tree problems using possibility and necessity measures
• Stochastic bottleneck spanning tree problem
• Finding Minimum Spanning Trees
• On stochastic spanning tree problem
• Decision-Making in a Fuzzy Environment