Papers - KOIDE Takeshi
-
An Exact and Heuristic Approaches for A Multi-Machine Handling Scheduling Problem Reviewed International coauthorship
Takeshi Koide
Proceedings of 50th International Conference on Computers & Industrial Engineering (CIE50) 404 - 409 2024.1
Authorship：Lead author
-
複数研究室割当問題に対する実用性を重視した組合せ最適化による解法 Reviewed
小出武
日本経営システム学会誌 38 ( 2 ) 117 - 123 2021.11
Authorship：Lead author
-
Do Citizens of a City that Owns a Local Public Airport Have Attachment to the Airport and Use it? Reviewed
Yu Morimoto, Takeshi Koide and Yuko Sugiura
Journal of Air transport Studies 11 ( 2 ) 71 - 94 2020
-
Multi-Stage Optimization for University Examination Proctor Assignments Reviewed
Takeshi Koide
Proceedings of World Congress on Engineering and Computer Science 2019 (WCECS2019) 107 - 111 2019.10
Single Work
Authorship：Lead author
-
Combinatorial Optimization for University Examination Proctor Assignments Reviewed
Takeshi Koide
Proceedings of the International MultiConference of Engineers and Computer Scientists 2019 (IMECS 2019) 516 - 519 2019.3
Single Work
Authorship：Lead author
-
A Multi-agent Simulation Study for Congestion Mitigation in a University Campus Restaurant Invited Reviewed
Takeshi Koide, Takeru Kobayashi and Maki Kikuda
Transactions on Engineering Technologies - World Congress on Engineering and Computer Science 2017 99 - 109 2019
Joint Work
Authorship：Lead author
-
時空間ホテリングモデルと小売業における新聞売り子問題 Invited Reviewed
三道弘明，小出武，木庭淳
オペレーションズ・リサーチ 60 ( 5 ) 259 - 265 2015.5
Joint Work
-
A System Development for Laboratory Assignment Problem with Rotations: A Mixex Integer Programming Approach Reviewed
Takeshi Koide
Transactions on Engineering Technologies - Special Volume of the International MultiConference of Engineers and Computer Scientists 2014 141 - 154 2015.1
Single Work
Authorship：Lead author
-
A Study on Multi-Period Inventory Clearance Pricing in Consideration of Consumer's Reference Price Effect Reviewed
Takeshi Koide, Hiroaki Sandoh
Industrial Engineering & Management Systems 12 ( 2 ) 95 - 102 2013.6
Joint Work
Authorship：Lead author
-
Asset Value Game and Its Extension: Taking Past Actions into Consideration Reviewed International coauthorship International journal
Jun Kiniwa, Takeshi Koide and Hiroaki Sandoh
Agents and Artificial Intelligence, Communications in Computer and Information Science 358 319 - 331 2013.3
Joint Work
-
Two-Period Inventory Clearance Problem with Reference Price Effect of Demand Reviewed
Takeshi Koide, Hiroaki Sandoh
Engineering Letters 20 ( 3 ) 286 - 293 2012.9
Joint Work
Authorship：Lead author
-
A Mathematical Analysis on Daily Inventory Clearance Pricing with Consumer’s Reference Price Reviewed
Takeshi Koide, Hiroaki Sandoh
Industrial Engineering & Management Systems 11 ( 1 ) 30 - 38 2012.3
Joint Work
Authorship：Lead author
-
Optimal Pricing for Installbase Business of a Monopolist Considering Three Representative Consumer Segments
Hiroaki Sandoh and Takeshi Koide
Journal of the Operations Research Society of Japan 53 ( 3 ) 173 - 188 2010.9
-
Optimal Pricing for Install-Base Business Based on a Logit Model Reviewed
Takeshi Koide, Hiroaki Sandoh
International Journal of Japan Association for Management Systems 1 ( 1 ) 19 - 27 2009.9
Joint Work
Authorship：Lead author
-
Analysis of price behavior in lazy $-game Reviewed
Jun Kiniwa, Takeshi Koide, and Hiroaki Sandoh
Physica A: Statistical Mechanics and its Applications 388 ( 18 ) 3879 - 3891 2009.9
-
Optimal Pricing for Installbase Business of a Monopolist Considering Three Representative Consumer Segments Reviewed
Hiroaki Sandoh, Takeshi Koide
Journal of the Operations Research Society of Japan 53 ( 3 ) 173 - 188 2009.2
Joint Work
-
Economic analysis of an n-unit parallel redundant system based on a Stackelberg game formulation Reviewed
Takeshi Koide and Hiroaki Sandoh
Computers & Industrial Engineering 56 ( 1 ) 388 - 398 2009.2
-
単一ユニットシステムを基準とした2ユニット並列冗長システムの経済性分析
小出武，三道弘明
電子情報通信学会論文誌 J88-A ( 7 ) 848 - 857 2005.7
Single Work
-
Efficient Computation of Network Reliability Importance on K-Terminal Reliability
Takeshi KOIDE, Shuichi SHINMORI and Hiroaki ISHII
International Journal of Reliability, Quality and Safety Engineering 12 ( 3 ) 213 - 226 2005.6
-
Comaparison between two scale-inspection and warranty policies for weight-quality
Hiroaki Sandoh and Takeshi Koide
International Journal of Quality and Reliability Management 22 ( 7 ) 731 - 748 2005.5
-
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...