• 한국경영과학회지
• /
• 제32권2호
• /
• pp.89-97
• /
• 2007

We study the maximum integer multiflow problem and the minimum multicut problem in a ring network. Both problems in a general network are known to be NP-hard. In this paper, we develop polynomial time algorithms to solve the problems. We also prove that even In a ring network, maximum multiflow is not always integral, which implies that the amount of maximum integer flow does not always reach the minimum capacity of multicut.

• Structural Engineering and Mechanics
• /
• 제38권5호
• /
• pp.651-674
• /
• 2011

This paper presents a novel method for predicting the failure probability of structural or mechanical systems subjected to random loads and material properties involving multiple design points. The method involves Multicut High Dimensional Model Representation (Multicut-HDMR) technique in conjunction with moving least squares to approximate the original implicit limit state/performance function with an explicit function. Depending on the order chosen sometimes truncated Cut-HDMR expansion is unable to approximate the original implicit limit state/performance function when multiple design points exist on the limit state/performance function or when the problem domain is large. Multicut-HDMR addresses this problem by using multiple reference points to improve accuracy of the approximate limit state/performance function. Numerical examples show the accuracy and efficiency of the proposed approach in estimating the failure probability.

• 한국경영과학회지
• /
• 제28권4호
• /
• pp.131-143
• /
• 2003

In this paper, we present a survey about the various graph partition problems including the clustering problem, the k-cut problem, the multiterminal cut problem, the multicut problem, the sparsest cut problem, the network attack problem, the network disconnection problem. We compare those problems focusing on the problem characteristics such as the objective function and the conditions that the partitioned clusters should satisfy. We also introduce the mathematical programming formulations, and the solution approaches developed for the problems.

• Management Science and Financial Engineering
• /
• 제15권2호
• /
• pp.119-123
• /
• 2009

The minimum multicut problem on a cycle is to find a multicut on an undirected cycle such that the sum of weights is minimized, which is known to be polynomially solvable. This paper shows that there exists a compact polyhedral description of the set of feasible solutions to the problem whose number of variables and constraints is O($\upsilon\kappa$).