• 한국생물공학회:학술대회논문집
• /
• 2003.10a
• /
• pp.594-594
• /
• 2003

• 한국전기화학회:학술대회논문집
• /
• 2005.07a
• /
• pp.223-228
• /
• 2005

• Bulletin of the Korean Chemical Society
• /
• v.23 no.9
• /
• pp.1277-1320
• /
• 2002

A novel approach to ${\alpha}-amino-{\delta}-valerolactone$ derivatives 8 by the intramolecular Ugi five-center three-component reaction (U-5C-3CR) using the multifunctional starting material, L-pentahomoserine 5 is described.

• Research in Mathematical Education
• /
• v.8 no.3
• /
• pp.215-226
• /
• 2004

The purpose of this paper is to introduce an activity of student who found purely linear algebraic solution of the Blackout puzzle. It shows how we can help and work with gifted students. It deals with algorithm, mathematical modeling, optimal solution and software.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.187-201
• /
• 1994

This paper introduces an effective hybridization of the usual simplex method and an interior point method in the convergent framework of Dembo and Sahi. We formulate a specific and detailed algorithm (HYBRID) and report the results of some preliminary testing on small dense problems for its viability. By piercing through the feasible region, the newly developed hybrid algorithm avoids the combinatorial structure of linear programs, and several other interesting and important characteristics of this algorithm are also discussed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.2
• /
• pp.181-189
• /
• 2008

Survivability of a network is one of the most important issues in designing present-day communication networks. For the past few decades, a lot of researches have proposed the mathematical models to evaluate the survivability of networks. In this paper, we attempt to survey such researches and classify them based on how these researches measure the survivability of a network.

• Journal of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.469-479
• /
• 1996

Toric variety is a normal algebraic variety containing algebraic torus $T_N$ as an open dense subset with an algebraic action of $T_N$ which is an extension of the group law of $T_N$. A toric variety can be described in terms of a certain collection, which is called a fan, of cones. From this fact, the properties of a toric variety have strong connection with the combinatorial structure of the corresponding fan and the relations among the generators. That is, we can translate the diffcult algebrogeometric properties of toric varieties into very simple properties about the combinatorics of cones in affine spaces over the reals.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2004.11a
• /
• pp.381-383
• /
• 2004

Recently, sectionalizing switches have been coming to be operated by remote control through the distribution SCADA system. However, the problem of determining the optimal switching sequence is a combinatorial optimization problem, and is quite difficult to solve. Hence, it is imperative to develop practically applicable solution algorithms create a new arbitral distribution system configuration from an initial configuration, and some of these algorithms do not show a load transfer sequence to reach the objective system.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2005.05a
• /
• pp.418-420
• /
• 2005

Recently, sectionalizing switches have been coming to be operated by remote control through the distribution SCADA system. However, the problem of determining the optimal switching sequence is a combinatorial optimization problem, and is quite difficult In solve. Hence, it is imperative to develop practically applicable solution algorithms create a new arbitral distribution system configuration from an initial configuration and some of these algorithms do not show a load transfer sequence to reach the objective system.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.177-198
• /
• 1994

We consider an algorithm for the Crew Scheduling Problem (CSP) based on the Transportation Problem approach. The main flows of the algorithm are arranged in three steps. First we propose a heuristic algorithm of the greedy principle to obtain an initial feasible solution. Secondary we present a method of formulating CSP into a Modified Transportation Problem format. Lastly the procedures of network search to get the optimal solution are presented. This algorithm can be applied to the general GSP and also to most combinatorial problems like the Vehicle Routing Problems. The computational results show that the large size CSP's could be tackled.