• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.1-8
• /
• 2002

A Branch-and-Cut algorithm is a branch-and-bound algorithm in which rutting planes are generated throughout the branch-and-bound tree. It is now one of the most widespread and successful methods for solving mixed integer programming problems. In this paper we presents efficient implementation techniques of branch-and-cut algorithm for miked integer programming problems.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.40 no.3
• /
• pp.23-38
• /
• 2015

In this paper, we evaluate the strength of three families of cutting planes for a lot-sizing problem. Lot-sizing problem is very basic MIP model for production planning and many strong valid inequalities have been developed for a variety of relaxations in the literature. To use three families of cutting planes in Branch-and-Cut framework, we develop separation algorithms for each cut and implement them in CPLEX. Then, we perform computational study to compare the effectiveness of three cuts for randomly generated instances of the lot-sizing problem.

• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.167-172
• /
• 2006

Recently, wire-EDM became a necessity for many engineering applications, particularly in the dies making. No-Core cut process is helpful for operations in which falling slug can jam the machine or wire. In this paper a proposed CAM system (called NCPP) is introduced, to overcome the limitations of the existing CAM systems in the machining of No-Core cut. The proposed CAM system (NCPP) provides pocketing of No-core cut and optimal selection of the position of starting hole (wire threading point), to minimize toolpath length. It was written for data exchange between CAD-CAM-CNC machines. This data model will become part of the ISO (Data model for Computerized Numerical Controllers) international standard. The NCPP system has been implemented in Visual C++. Many examples are used to illustrate NCPP system. The results show that, NCPP saves the machining time by significant value. This value depends on the shape and complexity of the workpiece that is being cut.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.4
• /
• pp.42-49
• /
• 2003

The branch and bound techniques based on cut tree and eigenvector have been Introduced in the literature [1, 2, 3, 6, 9, 12]. These techniques are used as a basis to allocate departments to floors and then to fit departments with unchangeable dimensions into floors. Grouping algorithms to allocate departments to each floor are developed and branch and bound forms the basis of optimizing using the criteria of rectilinear distance. The proposed branch and bound technique, in theory, will provide the optimal solution on two dimensional layout. If the runs are time and/or node limited, the proposed method is a strong heuristic The technique is made further practical by the fact that the solution is constrained such that the rectangular shape dimensions length and width are fixed and a perfect fit is generated if a fit is possible. Computational results obtained by cut tree-based algorithm and eigenvector-based algorithm are shown when the number of floors are two or three and there is an elevator.

• Proceedings of the KSRS Conference
• /
• 2000.04a
• /
• pp.96-101
• /
• 2000

SAR(Synthetic Aperture Radar) interferometry 기술은 co-registration, 정밀궤도 계산, phase unwrapping, 지형보정과 같은 기술로 구성되어있다. 구속화된 위상값을 절대 위상값으로 변환하는 과정인 phase unwrapping 기술은 정밀지형고도를 얻는데 있어서 핵심기술이다. 본 연구에서는 JERS-1 SAR 영상으로부터 interferogram을 구하고, 이로부터 추출된 위상정보를 이용하여 branch cut(Goldstein et. al, 1988), minimum discontinuity(Flynn, 1997) 그리고 minimum $L^p$-norm(Ghiglia and Romero, 1996)방법 적용결과에 대한 비교 분석을 실시하였다. Goldstein 알고리즘은 수행속동가 매우 빠르지만 residue를 연결한 branch cut에 의해 분활된 영역 내에서, 서로 다른 적분 경로로 인해 위상이 단절되었다. 영상내의 모든 화소에서 절대 위상을 구한 minimum discontinuity와 minimum $L^p$-norm 알고리즘 수행 결과는 상관관계가 0.995로 매우 유사하였는데, 가중된 불연속선의 합을 최소화하는 minimum discontinuity 알고리즘이 minimum $L^p$-norm에 비해 영상 일부 지역에서 발생하는 위상 오차를 전파시키지 않는다는 장점이 있다. Minimum $L^p$-norm 방법은 다른 두 방법과 달리 위상정보 내에 많은 잡음이 있더라도 적절한 해를 구할 수 있다는 장점이 있다. 각 방법은 대상 자료의 특성에 따라 효율성이 있으나 Flynn의 알고리즘이 지역적 특성과 무관하게 가장 효과적임을 알 수 있었다.

• Management Science and Financial Engineering
• /
• v.16 no.1
• /
• pp.81-117
• /
• 2010

Semi-supervised learning incorporates unlabeled examples, whose labels are unknown, as well as labeled examples into learning process. Although transductive support vector machine (TSVM), one of semi-supervised learning models, was proposed about a decade ago, its application to large-scaled data has still been limited due to its high computational complexity. Our previous research addressed this limitation by introducing a branch-and-bound algorithm for finding an optimal solution to TSVM. In this paper, we propose three new techniques to enhance the performance of the branch-and-bound algorithm. The first one tightens min-cut bound, one of two bounding strategies. Another technique exploits a graph-based approximation to a support vector machine problem to avoid the most time-consuming step. The last one tries to fix the labels of unlabeled examples whose labels can be obviously predicted based on labeled examples. Experimental results are presented which demonstrate that the proposed techniques can reduce drastically the number of subproblems and eventually computational time.

• The Korean Journal of Community Living Science
• /
• v.17 no.1
• /
• pp.101-108
• /
• 2006

This study was conducted to develop the regulating methods for the optimal harvest stage of new sprout for woody plants, and to clarify the effects of storage condition and period on the growth of new sprout formed of Aralia elata cv. 'Jeongkwang'. Japanese angelica tree were collected in the Jangheung district of Jeonnam on 20. March, 2005, and those cut branches were stored at $5{\pm}2^{\circ}C$ and 80 to 90% of the relative humidity, and were cut in water. Survival rate of cut branches for Aralia elata cv. 'Jeongkwang' was significantly increased when that was used for the cutting after the collection with no storage. And those survival rate was much more increased when that was stored at 80 to 90% of relative humidity than 40 to 50% of relative humidity. Number of new sprouts formed which were not stored immediately after the collection 3.2 to 3.4, and that were stored at cold storage room before cutting and cut on 1. June and 1. August were 5.1 to 5.3. Leaf growth of cut branches cut in water on 20. March started at ten days after cutting, and that on 1. June and 1. August at one to two days after cutting. Slow and mature sprout growth of Aralia elata cv. 'Jeongkwang' which were cut in water were different by the cold storage periods. Nineteen days were needed for the mature growth of sprout when cut in water on 20. March, and thirteen days on 1. August.

• 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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.2
• /
• pp.69-85
• /
• 2006

Transductive Support Vector Machine(TSVM) is one of semi-supervised learning algorithms which exploit the domain structure of the whole data by considering labeled and unlabeled data together. Although it was proposed several years ago, there has been no efficient algorithm which can handle problems with more than hundreds of training examples. In this paper, we propose an efficient branch-and-bound algorithm which can solve large-scale TSVM problems with thousands of training examples. The proposed algorithm uses two bounding techniques: min-cut bound and reduced SVM bound. The min-cut bound is derived from a capacitated graph whose cuts represent a lower bound to the optimal objective function value of the dual problem. The reduced SVM bound is obtained by constructing the SVM problem with only labeled data. Experimental results show that the accuracy rate of TSVM can be significantly improved by learning from the optimal solution of TSVM, rather than an approximated solution.

• Korean Journal of Plant Resources
• /
• v.15 no.1
• /
• pp.43-49
• /
• 2002

Effects of BA treatment and cut planting methods on shooting and seedling characteristics were investigated to increase seedling products by cuttings of lacquer tree. Dipping on 1,000mg/L BA solution was better than dripping with same solution at 5 weeks after cut planting. As shooting rate was increased suddenly, it was 85％ at 10 weeks after cut planting. Among 3 dripping treatments, interval was not effective on shooting rate. Dripping per 2 days with 100 ㎕ of 1,000 mg/L BA solution was most effective on seedling height and leaf number and than dipping was more effective than dripping per 5 and 7 days. Branch developed on near part from dripped scion. Shooting of horizontal planting was earlier about a week and rate was increased suddenly from 3 to 6 weeks, it was highest with 96％ than others at 10 weeks after planting. Seedling of horizontal cut planting was tallest about 40cm and branch developed lower than vertical and oblique cut planting. In case of horizontal cut planting, 2-3 shoots were formed on different part of scion and than those were could divided to seedling, so horizontal cut planting was most effective to propagation of seedling than any others.