• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.2
• /
• pp.185-191
• /
• 2023

To the exact cover problem that remains NP-complete to which no polynomial time algorithm is made available, this paper proposes a linear time algorithm that yields an optimal solution. The proposed algorithm makes use of the set cover problem's major feature which states that "no identical element shall be included in more than one covering set". To satisfy this criterion, the proposed algorithm initially selects a subset with the minimum cardinality and deletes those that contain the cardinality identical to that of the selected subset. This process is repeatedly performed on remaining subsets until the final solution is obtained. Provided that the solution is unattainable, it selects subsets with the maximum cardinality and repeats the same process. The proposed algorithm has not only obtained the optimal solution with ease but also proved its wide applicability on N-queens problems, hence disproving the NP-completeness of the exact cover problem.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.161-176
• /
• 2005

In a situation that ordinal preferences on multiattribute weights are captured, we present two solution approaches: an exact approach and an approximate method. The former, an exact solution approach via interaction with a decision-maker, pursues the progressive reduction of a set of non-dominated alternatives by narrowing down the feasible attribute weights region. Subsequent interactive questions and responses, however, sometimes may not guarantee the best alternative or a complete rank order of a set of alternatives that the decision-maker desires to have. Approximate solution approaches, on the other hand, can be divided into three categories including surrogate weights methods, dominance value-based decision rules, and three classical decision rules. Their efficacies are evaluated in terms of choice accuracy via a simulation analysis. The simulation results indicate that a proposed hybrid approach, intended to combine an exact solution approach through interaction and a dominance value-based approach, is recommendable for aiding a decision making in a case that a final choice is seldom made at single step under attribute weights that are imprecisely specified beyond ordinal descriptions.

• Structural Engineering and Mechanics
• /
• v.42 no.3
• /
• pp.313-334
• /
• 2012

This paper examines the problem of a penny-shaped crack in a thermoporoelastic body. On the basis of the recently developed general solutions for thermoporoelasticity, appropriate potentials are suggested and the governing equations are solved in view of the similarity to those for pure elasticity. Exact and closed form fundamental solutions are expressed in terms of elementary functions. The singularity behavior is then discussed. The present solutions are compared with those in literature and an excellent agreement is achieved. Numerical calculations are performed to show the influence of the material parameters upon the distribution of the thermoporoelastic field. Due to its ideal property, the present solution is a natural benchmark to various numerical codes and simplified analyses.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.3
• /
• pp.145-155
• /
• 2004

The design of a communication network has long been a challenging optimization problem. Since the optimal design of a network topology is a well known as a NP-complete problem, many researches have been conducted to obtain near optimal solutions in polynomial time instead of exact optimal solutions. All of these researches suggested diverse heuristic algorithms that can be applied to network design problems. Among these algorithms, a simulated annealing algorithm has been proved to guarantee a good solution for many NP-complete problems. in applying the simulated annealing algorithms to network design problems, generating mechanisms for initial solutions and candidate solutions play an important role in terms of goodness of a solution and efficiency. This study aims at analyzing these mechanisms through experiments, and then suggesting reliable mechanisms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.207-215
• /
• 2015

This paper proposes a solution-yielding linear time algorithm to NP-complete Sudoku, to which no polynomial time algorithm has been proposed. The proposed algorithm is performed on blocks in the descending order of the number of clues they contain. It firstly determines all numbers that could possibly occur in the blank rows and columns of each block. By deriving an intersecting value of corresponding rows and columns, it assigns the final number for each blank. When tested on the traditional $9{\times}9$ Sudoku, the proposed algorithm has succeeded in obtaining the solution through performance of 9 times, the exact number of the blocks. Test results on modified Jigsaw Sudoku (9 blocks) and Hypersudoku (13 blocks) also show its success in deriving the solutions by execuring 9 and 13 times respectively. Accordingly, this paper proves that the Sudoku problem is in fact P-problem.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.111-117
• /
• 2015

The exam scheduling problem has been classified as nondeterministic polynomial time-complete (NP-complete) problem because of the polynomial time algorithm to obtain the exact solution has been unknown yet. Gu${\acute{e}}$ret et al. tries to obtain the solution using linear programming with $O(m^4)$ time complexity for this problem. On the other hand, this paper suggests chromatic number algorithm with O(m) time complexity. The proposed algorithm converts the original data to incompatibility matrix for modules and graph firstly. Then, this algorithm packs the minimum degree vertex (module) and not adjacent vertex to this vertex into the bin $B_i$ with color $C_i$ in order to exam within minimum time period and meet the incompatibility constraints. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(m) time complexity for exam scheduling problem, and gets the same solution with linear programming.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.31-39
• /
• 2015

The degree-constrained minimum spanning tree (d-MST) problem is considered NP-complete for no exact solution-yielding polynomial algorithm has been proposed to. One thus has to resort to an heuristic approximate algorithm to obtain an optimal solution to this problem. This paper therefore presents a polynomial time algorithm which obtains an intial solution to the d-MST with the help of Kruskal's algorithm and performs k-opt on the initial solution obtained so as to derive the final optimal solution. When tested on 4 graphs, the algorithm has successfully obtained the optimal solutions.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.432-435
• /
• 1995

In this paper a new approach to obtain the solution of the linear-quadratic Gaussian control problem for singularly perturbed discrete-time stochastic systems is proposed. The alogorithm proposed is based on exploring the previous results that the exact solution of the global discrete algebraic Riccati equations is found in terms of the reduced-order pure-slow and pure-fast nonsymmetric continuous-time algebraic Riccati equations and, in addition, the optimal global Kalman filter is decomposed into pure-slow and pure-fast local optimal filters both driven by the system measurements and the system optimal control input. It is shown that the optimal linear-quadratic Gaussian control problem for singularly perturbed linear discrete systems takes the complete decomposition and parallelism between pure-slow and pure-fast filters and controllers.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.17-26
• /
• 2008

The traveling salesman problem is to find tours through all cities at minimum cost ; simply visiting the cities only once that a salesman wants to visit. As such, the traveling salesman problem is a NP-complete problem ; an heuristic algorithm is preferred to an exact algorithm. In this paper, we suggest an effective cost relaxation using a candidate arc set which is obtained from a regression function for the traveling salesman problem. The proposed method sufficiently consider the characteristics of cost of arcs compared to existing methods that randomly choose the arcs for relaxation. For test beds, we used 31 instances over 100 cities existing from TSPLIB and randomly generated 100 instances from well-known instance generators. For almost every instances, the proposed method has found efficiently better solutions than the existing method.

• Interaction and multiscale mechanics
• /
• v.4 no.2
• /
• pp.123-137
• /
• 2011

We review a series of crack problems arising in the general deformations of a linearly elastic solid (Mode-I, Mode-II and Mode-III crack) and, perhaps more significantly, when the contribution of surface effects are taken into account. The surface mechanics are incorporated using the continuum based surface/interface model of Gurtin and Murdoch. We show that the deformations of an elastic solid containing a single crack can be decoupled into in-plane (Mode-I and Mode-II crack) and anti-plane (Mode-III crack) parts, even when the surface mechanics is introduced. In particular, it is shown that, in contrast to classical fracture mechanics (where surface effects are neglected), the incorporation of surface elasticity leads to the more accurate description of a finite stress at the crack tip. In addition, the corresponding stress fields exhibit strong dependency on the size of crack.