• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 한국신호처리시스템학회 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.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• 제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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제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

• Journal of the Korean Operations Research and Management Science Society
• /
• 제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.

• Journal of Korean Institute of Industrial Engineers
• /
• 제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.

• Journal of the Korean Operations Research and Management Science Society
• /
• 제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.

• Convergence Security Journal
• /
• 제14권7호
• /
• pp.59-64
• /
• 2014

We investigate $p(n){\cdot}2^{O(\sqrt{n})}$ algorithm for 0/1 knapsack problem where x is the total bit length of a list of sizes of n objects. The algorithm is adaptable of method that achieves a similar complexity for the partition and Subset Sum problem. The method can be applied to other optimization or decision problem based on a list of numerics sizes or weights. 0/1 knapsack problem can be used to solve NP-Complete Problems with pseudo-polynomial time algorithm. We try to apply this technique to bio-informatics problem which has pseudo-polynomial time complexity.

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

• Journal of the Korean Operations Research and Management Science Society
• /
• 제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.

• Korean Management Science Review
• /
• 제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.