• International Journal of Computer Science & Network Security
• /
• v.24 no.2
• /
• pp.15-24
• /
• 2024

One of the most significant issues in combinatorial optimization is the classical NP-complete conundrum known as the 0/1 Knapsack Problem. This study delves deeply into the investigation of practical solutions, emphasizing two classic algorithmic paradigms, brute force, and dynamic programming, along with the metaheuristic and nature-inspired family algorithm known as the Genetic Algorithm (GA). The research begins with a thorough analysis of the dynamic programming technique, utilizing its ability to handle overlapping subproblems and an ideal substructure. We evaluate the benefits of dynamic programming in the context of the 0/1 Knapsack Problem by carefully dissecting its nuances in contrast to GA. Simultaneously, the study examines the brute force algorithm, a simple yet comprehensive method compared to Branch & Bound. This strategy entails investigating every potential combination, offering a starting point for comparison with more advanced techniques. The paper explores the computational complexity of the brute force approach, highlighting its limitations and usefulness in resolving the 0/1 Knapsack Problem in contrast to the set above of algorithms.

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

• Journal of Korean Institute of Industrial Engineers
• /
• v.9 no.2
• /
• pp.3-8
• /
• 1983

The multiple choice knapsack problem is modified. To solve this modified multiple choice knapsack problem, Lagrangian relaxation is used, and to take advantage of the special structure of subproblems obtained by decomposing this relaxed Lagrangian problem, a modified ranking algorithm is used. The K best rank order solutions obtained from each subproblem as a result of applying modified ranking algorithm are used to formulate restricted problems of the original problem. The optimality for the original problem of solutions obtained from the restricted problems is judged from the upper bound and lower bounds calculated iteratively from the relaxed problem and restricted problems, respectively.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1993.10a
• /
• pp.246-255
• /
• 1993

The paper presents the experimental studies on the effectiveness of some vibration isolators developed for reducing transmission of vibration from the powered knapsack sprayer to the back and shoulders of the operator. A test rig was used to conduct detailed experimental studies on the powered knapsack sprayer mounted on it and fitted with different vibration isolators. Structural features of vibration isolators have been presented and their effectiveness of isolating transmission of vibration, from the engine-blower of the sprayer to its main frame and the operator, has been presented and discussed. Vibration measurements and analyses made by using B & K equipment have proved that the vibration isolators are quite effective in reducing the vibration transmission. The operators felt much less discomfort when they used the sprayer fitted with the isolators developed for the purposes, as compared to the existing arrangement.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1991.11a
• /
• pp.72-84
• /
• 1991

본 논문에서는 컴퓨터 통신에 적합한 공개 키 암호시스팀을 제안한다. 이 방식은 기존의 Knapsack 형래 암호시스템 보다 간단하면서 높은 안전성을 갖는다. 이 Knapsack 형태의 공개 키 암호시스팀은 다변수 다항식의 초증가한 근을 기초로 한 것으로 암호화와 복호화 앨고리듬의 타당성을 보였다. 또한 제안된 공개 키 암호시스팀의 안전성은 다변수 다항식 분해의 다양성, 각 다항식에서 초증가 특성을 만족하는 근을 얻기 위한 어려움, 그리고 평문과 암호문 관계의 모호성을 기반으로 하며 이를 기존의 Knapsack 암호시스팀과 비교분석 하였다.

• Journal of the military operations research society of Korea
• /
• v.10 no.1
• /
• pp.57-63
• /
• 1984

The 0-1 multi-period Knapsack problem (MPKP) has a horizon of m periods, each having a number of types of projects with values and weights. Subject to the requirement, the cummulative capacity of the problem in each period i cannot be exceeded by the total weight of the projects selected in period 1, 2, ..., i. It is a problem of selecting the projects in such a way that the total value in the knapsack through the horizon of m periods is maximized. A search algorithm is developed and tested in this paper. Search rules that avoid the search of redundant partial solutions are used in the algorithm. Using the property of MPKP, a surrogate constraint concerned with the most available requirement is used in the bounding technique.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.3
• /
• pp.258-263
• /
• 2011

We study on a generalization of the two dimensional linear programming knapsack problem with the extended GUB constraint, which was presented in paper Won(2001). We identify some new parametric properties of the generalized problem and derive a solution algorithm based on the identified parametric properties. The solution algorithm has a worst case time complexity of order O($n^2logn$), where n is the total number of variables. We illustrate a numerical example.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.497-500
• /
• 2013

사물지능통신(Machine to Machine, M2M) 기술이 부각됨에 따라, 기존의 통신에 비해 사용되는 단말의 수가 점점 증가하고 있다. 따라서 다수의 단말로부터 전송하는 데이터가 이동통신 네트워크를 이용함에 있어 트래픽이 한계상황에 도달하여 원활하지 못한 통신망 운용을 초래할 수 있다. 본 연구는 M2M 통신에서 사용하게 될 이동통신망이 한계점에 도달했을 때 M2M 서비스의 원활한 처리를 위해 Knapsack Problem 알고리즘을 이용하여 가상의 시뮬레이터를 구현하였다. 가상의 시뮬레이터는 각각의 장비 그룹별로 데이터가 들어오게 되면 이동통신망에서 우선적으로 처리해야 될 M2M 통신의 서비스의 처리부터 나중에 처리 될 서비스까지 원활한 처리방법을 위해 구현하였으며, M2M 기술이 더욱 발전하게 되어 점차 소형화 되는 사물들이 많아짐에 따라, 폭증하게 될 이동통신망에서 M2M 서비스를 처리하는 것이 원활하도록 도움을 줄 것이다.

• Asia Marketing Journal
• /
• v.18 no.1
• /
• pp.23-35
• /
• 2016

Product customization has been popular since Internet shopping began. Many firms have introduced customization configuration systems, allowing customers to choose a wide range of product attributes, attracting them to participate in the shopping process, and increasing customer satisfaction. Paradoxically, the attribute-by-attribute (AbA) choice in the customization process requires a high-information processing load resulting in shopper confusion. To reduce this confusion, the CvSS (customization via starting solution) system has recently been developed. However, this system provides solution support only for the starting point of the configuration process. Thus, in this study, the authors proposes the CvWS (Customization via Waypoint Solutions) system, which would greatly reduce the customer effort needed to complete the configuration process by using a novel approach to solve the nonlinear knapsack problem. The newly proposed system is theoretically compared with the AbA customization as well as the CvSS system. Also, its feasibility is discussed in the context of the nonlinear multiconstraint knapsack problem.

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

We present an extension of the well-known generalized upper bound (GUB) constraint and consider a linear knapsack problem with both the extended GUB constraints and the simple upper bound (SUB) constraints. An efficient algorithm of order O($n^2log n$) is developed by exploiting structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.