• 한국기계연구소 소보
• /
• s.20
• /
• pp.13-20
• /
• 1990

An algorithm is presented for 3-dimensional contour lines with a hidden line removal ~technique developed by T.L. Janssen(l). Contour line algorithm on any 3-dimensional plane cutting solid body is also shown. NUFIG(2) algorithm is adopted for searching contour lines. Test problems show well-established contour lines on the surface and also on the cutting plane of the structure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.6
• /
• pp.465-470
• /
• 2013

In this paper, we introduce a modulation code design problem where best selection of two-dimensional codewords are determined to reduce two-dimensional (2D) Intersymbol Interference (ISI) and Interpage Interference (IPI), while when these codewords are randomly arranged on the storage, isolated pixel cannot be formed. Codeword selection problem and isolated pixel detection problem are formulated as integer program models and we develop a cutting plane algorithm where a valid cut is generated to remove current feasible solution to avoid isolated pixel by solving the isolated pixel detection subproblem. Using the proposed method, $4{\times}2$ 6/8 codewords with non-isolated pixel are found.

• Management Science and Financial Engineering
• /
• v.11 no.1
• /
• pp.49-61
• /
• 2005

We consider the graph disconnection problem, which is to find a set of edges such that the total cost of destroying the edges is no more than a given budget and the weight of nodes disconnected from a designated source by destroying the edges is maximized. The problem is known to be NP-hard. We present an integer programming formulation for the problem and develop an algorithm that includes a preprocessing procedure for reducing the problem size, a heuristic for providing a lower bound, and a cutting plane algorithm for obtaining an upper bound. Computational results for evaluating the performance of the proposed algorithm are also presented.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.3-3
• /
• 1993

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.57-57
• /
• 1997

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.3
• /
• pp.17-33
• /
• 2000

We consider the Steiner tree packing problem. For a given undirected graph G =(V, E) with positive integer capacities and non-negative weights on its edges, and a list of node sets(nets), the problem is to find a connection of nets which satisfies the edge capacity limits and minimizes the total weights. We focus on the switchbox routing problem in knock-knee model and formulate this problem as an integer programming using Steiner tree variables. The model contains exponential number of variables, but the problem can be solved using a polynomial time column generation procedure. We test the algorithm on some standard test instances and compare the performances with the results using cutting plane approach. Computational results show that our algorithm is competitive to the cutting plane algorithm presented by Grotschel et al. and can be used to solve practically sized problems.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.59-80
• /
• 1997

Designing highly survivable interoffice telecommunication networks is considered. The problem is formulated as a minimum-cost network design problem with three node connectivity constraints. These valid and facet-defining inequalities for the convex hull of the solution are presented. A branch and cut algorithm is proposed based on the inequalities to obtain the optimal solution. With the lower bound by the cutting plane algorithm, a delete-ink heuristic is proposed to otain a good upper bound in the branch and bound procedure. The effeciveness of the branch and cut algorithm is demonstrated with computational results for a variety of problem sets : different lower bounds, two types of link costs and large number of links. The cutting plane procedure based on the three inequalities provides excellent lower bounds to the optimal solutions.

• IE interfaces
• /
• v.8 no.2
• /
• pp.151-159
• /
• 1995

Two-dimensional cutting stock problem is to find a waste-minimizing method of cutting a single rectangular plane into a number of smaller pieces of known dimensions. In practice, besides wastes, setup cost taken during adjusting is of an important concern. We suggest 2-phased guillotine cutting method as a solution to the problem which minimize wastes and setup costs. Also, in order to reduce the computing time we apply techniques of discretization, cutoff, median. Experimental results show good performance of our algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.691-700
• /
• 1994

Voronoi diagram of a set of geometric entities on a plane such as points, line segments, or arcs is a collection of Voronoi polygons associated with each entity, where Voronoi polygon of an entity is a locus of point which is closer to the associated entity than any other entity. Voronoi diagram is one of the most fundamental geometrical construct and well-known for its theoretical elegance and the wealth of applications. Various geometric problems can be solved with the aid of Voronoi diagram. For example, the maximum tool diameter of a milling cutter for rough cutting in a pocket can be easily found, and the pocketing tool path can be efficiently generated from Voronoi diagram. In PCB design, the design rule checking can be easily done via Voronoi diagram, too. This paper discusses an algorithm to construct Voronoi diagram of a simple polygon which consists of simple curves such as line segments as well as arcs in a plane with O(nlogn) time complexity by employing the divide and conquer scheme.

• Management Science and Financial Engineering
• /
• v.10 no.1
• /
• pp.97-106
• /
• 2004

In this paper, we propose an effective cut generation method based on the Chvatal-Gomory procedure for a variable-capacity (0,l)-Knapsack problem with two general integer variables. We first derive a class of valid inequalities for the problem using Chvatal-Gomory procedure, then analyze the associated separation problem. Based on the results, we show that there exists a pseudo-polynomial time algorithm to solve the separation problem. By analyzing the theoretical strength of the inequalities which can be generated by the proposed cut generation method, we show that generated inequalties define facets under mild conditions. We also extend the result to the case in which a nontrivial upper bound is imposed on a general integer variable.