Papers - KOIDE Takeshi
-
The hotel yield management with two types of room prices, overbooking and cancellations
Takeshi KOIDE and Hiroaki Ishii
International Journal of Production Economics 93-94 417 - 428 2005.1
-
An Improved Algorithm to Compute Marginal Reliability Importance in a Network System
Takeshi KOIDE, Shuichi SHINMORI and Hiroaki ISHII
the IEICE Transactions on Fundamentals E87-A ( 2 ) 454 - 460 2004.2
Joint Work
-
An Efficient Complete Enumeration Method for Network Design Problems and Its Applications
Takeshi KOIDE, Shuichi SHINMORI and Hiroaki ISHII
Journal of the Operations Research Society of Japan 45 ( 3 ) 299 - 316 2002.9
-
Topological optimization with a network reliability constraint
Takeshi KOIDE, Shuichi SHINMORI and Hiroaki ISHII
Discrete Applied Mathematics Vol.115 135 - 149 2001.11
-
A New Algorithm for Lower Bounds of All-terminal Reliability
Takeshi KOIDE, Shuichi SHINMORI and Hiroaki ISHII
Mathematica Japonica 51 ( 2 ) 301 - 311 2000.3
Joint Work
-
The Evaluations on Lower Bounds of All-terminal Reliability by Arc-packings for General Networks
Takeshi KOIDE, Shuichi SHINMORI and Hiroaki ISHII
the IEICE Transactions on Fundamentals E82-A ( 5 ) 784 - 791 1999.5
Joint Work
-
On Lower Bounds for Network Reliability by Series-parallel Graphs
Transactions of the Japan Society for Industrial and Applied Mathematics 9 ( 1 ) 15 - 35 1999.3
-
On Lower Bound for Network Reliability by Edge-packing
SHINMORI Shuichi, KOIDE Takeshi, ISHII Hiroaki
Transactions of the Japan Society for Industrial and Applied Mathematics 5 ( 2 ) 139 - 151 1995.6
Single Work
Publisher：The Japan Society for Industrial and Applied Mathematics
A simple model for a communication network is a probabilistic graph consisting of a set of nodes which is not fail and a set of edges which operates with a probability. One of the indicators which measure the performance of the network is all-terminal reliability, that is, probability that all nodes are connected with operational edges. Since to calculate its value precisely is NP-hard, it is important to obtain the bounds of the all-terminal reliability efficiently. In this paper, we propose the polynomial time algorithm that can derive the lower bound by transforming any graph to the grap...