Search | Korea Science

김기석;김기석
- Journal of the Korean Operations Research and Management Science Society
- /
- v.19 no.2
- /
- pp.1-19
- /
- 1994
A generalized network problem is a special class of linear programming problem whose coefficient matrix contains at most two nonzero elements per column. A generalized network problem with 0-1 flow restrictions is called an integer generalized network(IGN) problem. In this paper, we presented a branch and bound algorithm for the IGN that uses network relaxation. To improve the procedure, we develop various strategies, each of which employs different node selection criterion and/or branching variable selection criterion. We test these solution strategies and compare their efficiencies with LINDO on 70 randomly generated problems.
PDF

Choi, Ha-Nool;Yang, Keun-Woo
- Proceedings of the Korean Operations and Management Science Society Conference
- /
- 2008.10a
- /
- pp.329-341
- /
- 2008
Knowledge management has garnered attention due to its role of maintaining competitive advantage. Creating and sharing knowledge is an essential part of managing knowledge. However, the best knowledge is underutilized because employees tend to seek knowledge through their informal networks, not reach out to other sources for obtaining the best knowledge. Prior studies on informal networks pointed out a negative influence of heavy reliance on learning through informal networks but they paid little attention to a structure of informal networks and its impacts on diffusion of knowledge. The aim of our study is to show impacts of informal network on knowledge management by employing a network structure and investigating diffusion of knowledge within it. Our study found out that performance of learning becomes lower in a highly clustered network. Creating random links such as serendipitous learning can improve performance of knowledge management. When employees rely on a knowledge management system, creating random links is not necessary. Costs of adopting knowledge affect performance of knowledge management.
PDF

Kim Eun-Jin;Lee Byeong-Tae
- Proceedings of the Korean Operations and Management Science Society Conference
- /
- 2003.11a
- /
- pp.183-186
- /
- 2003
Customer profitability recognition is easier with CRM enabling technologies and the strategy of firing unprofitable customers prevails in the market. However, in the digital and Internet age, network externality is becoming more important. Therefore, the concern over firing unprofitable customers has increased. Our research is intended to develop strategic guidance for customer selection when firms implement CRM in the market with network externality.
PDF

Jung, Kyung-Hee
- Journal of the Korean Operations Research and Management Science Society
- /
- v.15 no.1
- /
- pp.117-133
- /
- 1990
This paper is concerned with determining a minisum location with jockeying for a server on a probabilistic network in which each customer type enters the network system permitting with jockeying through a specified node and a nonpreemptive service policy is in effect. An algorithm to locate a single Fixed Priority Queue Median with Jockeying (FPQMJ) on acyclic networks is developed by using the Generalized Benders' Decomposition technique. The results are then extended to a general network.
PDF