• 융합신호처리학회 학술대회논문집
• /
• 한국신호처리시스템학회 2000년도 하계종합학술대회논문집
• /
• pp.341-344
• /
• 2000

The 0-1 knapsack processor performing dynamic programming is designed and implemented on a programmable logic device. Three types of a processor, each with different behavioral models, are presented, and the operation of a processor of each type is verified with an instance of the 0-1 knapsack problem.

• 산업경영시스템학회지
• /
• 제19권40호
• /
• pp.137-142
• /
• 1996

An algorithm for solving the cardinality constrained linear programming knapsack problem is presented. The algorithm has a convenient structure for a branch-and-bound approach to the integer version, especially to the 0-1 collapsing knapsack problem. A numerical example is given.

• 한국통신학회논문지
• /
• 제16권9호
• /
• pp.893-900
• /
• 1991

And this system is compared with past knapsack system by implementation of low density attack in Brickell and Lagarias, Odlyzko’s method. Also the VLSI architecture for parallel implementation of this linearly shift knapsack system is presented

• 한국경영과학회지
• /
• 제17권2호
• /
• pp.117-122
• /
• 1992

We consider 0-1 mixed integer knapsack problems. They turn out to be no more difficult to solve than the corresponding 0-1 pure integer knapsack problems with efficient pseudopolynomial time algorithm.

• 대한산업공학회지
• /
• 제38권2호
• /
• pp.74-79
• /
• 2012

An efficient separation heuristic for the rank-1 Chvatal-Gomory cuts for the binary knapsack problem is proposed. The proposed heuristic is based on the decomposition property of the separation problem for the fixedcharge 0-1 knapsack problem characterized by Park and Lee [14]. Computational tests on the benchmark instances of the generalized assignment problem show that the proposed heuristic procedure can generate strong rank-1 C-G cuts more efficiently than the exact rank-1 C-G cut separation and the exact knapsack facet generation.

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

The generalized knapsack problem or gknap is the combinatorial optimization problem of optimizing a nonnegative linear function over the integral hull of the intersection of a polynomially separable 0-1 polytope and a knapsack constraint. The knapsack, the restricted shortest path, and the constrained spanning tree problem are a partial list of gknap. More interesting1y, all the problem that are known to have a fully polynomial approximation scheme, or FPTAS are gknap. We establish some necessary and sufficient conditions for a gknap to admit an FPTAS. To do so, we recapture the standard scaling and approximate binary search techniques in the framework of gknap. This also enables us to find a weaker sufficient condition than the strong NP-hardness that a gknap does not have an FPTAS. Finally, we apply the conditions to explore the fully polynomial approximability of the constrained spanning problem whose fully polynomial approximability is still open.

• 융합보안논문지
• /
• 제14권7호
• /
• pp.59-64
• /
• 2014

이 논문에서는 고정된 개수를 가진 bin들을 이용하여 실행 복잡도가 $p(n){\cdot}2^{O(\sqrt{n})}$인 알고리즘을 제시한다, 여기서 x는 (5)n개의 객체들에 대한 리스트의 길이에 대한 총 비트 수를 나타낸다. 이러한 방법은 수치적 크기나 비중의 합의 리스트를 이용하는 여러 가지 최적화 알고리즘이나 결정 문제등에 적용할 수 있다. 이 논문에서 제시한 알고리즘은 의사-다항식(pseudo-polynomial) 시간을 갖는 NP-Complete의 많은 문제들을 결정적인 서브-지수 시간에 해결할 수 있은 가능성을 제시한다. 여기서 제시한 알고리즘을 이용하여 생명공학의 유전자 분석에 적용하려고 한다.

• Journal of Information Processing Systems
• /
• 제18권5호
• /
• pp.665-676
• /
• 2022

In modern logistics, the effective use of the vehicle volume and loading capacity will reduce the logistic cost. Many heuristic algorithms can solve this knapsack problem, but lots of these algorithms have a drawback, that is, they often fall into locally optimal solutions. A fusion optimization method based on simulated annealing algorithm (SA) and binary particle swarm optimization algorithm (BPSO) is proposed in the paper. We establish a logistics knapsack model of the fusion optimization algorithm. Then, a new model of express logistics simulation system is used for comparing three algorithms. The experiment verifies the effectiveness of the algorithm proposed in this paper. The experimental results show that the use of BPSO-SA algorithm can improve the utilization rate and the load rate of logistics distribution vehicles. So, the number of vehicles used for distribution and the average driving distance will be reduced. The purposes of the logistics knapsack problem optimization are achieved.

• 한국경영과학회지
• /
• 제13권2호
• /
• pp.73-73
• /
• 1988

Knapsack problems represent many business application such as cargo loading, project selection, and capital budgeting. In this research we developed a knapsack problem solver based on Martello-Toth algorithm using a relational database management system on the PC platform. The solver used the menu-driven user interface. The solver can be easily integrated with the database of decision support system because the solver can access the database to retrieve the data for the model and to store the result directly.

• 경영과학
• /
• 제13권2호
• /
• pp.73-94
• /
• 1996

Knapsack problems represent many business application such as cargo loading, project selection, and capital budgeting. In this research we developed a knapsack problem solver based on Martello-Toth algorithm using a relational database management system on the PC platform. The solver used the menu-driven user interface. The solver can be easily integrated with the database of decision support system because the solver can access the database to retrieve the data for the model and to store the result directly.